Low-Complexity Decoding Scheme for 1× K Differential Space-Time Line Coded System with M-PSK Modulation
Citations

WEB OF SCIENCE

0
Citations

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 codeSTLCmaximum likelihoodMLphase-shift keyingPSKREGENERATIVE 2-WAY RELAYBLOCK-CODESMIMOPERFORMANCEDIVERSITYCHANNEL
제목
Low-Complexity Decoding Scheme for 1× K Differential Space-Time Line Coded System with M-PSK Modulation
저자
Joung, JingonYuen, Chau
DOI
10.1109/TVT.2025.3562055
발행일
2025-09
유형
Article
저널명
IEEE Transactions on Vehicular Technology
74
9
페이지
14961 ~ 14966