상세 보기
Low-Complexity Decoding Scheme for 1× K Differential Space-Time Line Coded System with M-PSK Modulation
- Joung, Jingon;
- Yuen, Chau
Citations
WEB OF SCIENCE
0Citations
SCOPUS
0초록
This study considers a 1 × K differential space-time line coded system with one transmit antenna and K receive antennas. A conventional joint maximum likelihood (ML) detection method requires a computational complexity order of O(KM2) for the M-phase-shift keying symbols. By decomposing the joint ML into two individual ML detections and bounding the M search constellation points by three regardless of modulation size, the proposed bounded ML detection can significantly reduce computational complexity to O(K). The numerical results verify that the complexity reduction of the proposed detection method can be obtained without compromising any bit-error-rate performance. © 1967-2012 IEEE.
키워드
Differential space-time line code; STLC; maximum likelihood; ML; phase-shift keying; PSK; REGENERATIVE 2-WAY RELAY; BLOCK-CODES; MIMO; PERFORMANCE; DIVERSITY; CHANNEL
- 제목
- Low-Complexity Decoding Scheme for 1× K Differential Space-Time Line Coded System with M-PSK Modulation
- 저자
- Joung, Jingon; Yuen, Chau
- 발행일
- 2025-09
- 유형
- Article
- 권
- 74
- 호
- 9
- 페이지
- 14961 ~ 14966