DocumentCode :
847190
Title :
Low-complexity concatenated two-state TCM schemes with near-capacity performance
Author :
Ping, Li ; Bai, Baoming ; Wang, Xinmei
Author_Institution :
Dept. of Electron. Eng., City Univ. of Hong Kong, China
Volume :
49
Issue :
12
fYear :
2003
Firstpage :
3225
Lastpage :
3234
Abstract :
This paper presents a family of concatenated two-state trellis-coded modulation (CT-TCM) schemes. Compared with the existing turbo-type bandwidth-efficient coded modulation schemes, the proposed codes have significantly reduced complexity without sacrificing performance. A joint design strategy for all component codes is established. This leads to so-called asymmetrical and time-varying trellis structures, which possess good Hamming and Euclidean distance distributions. The performance of the proposed codes is demonstrated by simulation results.
Keywords :
Hamming codes; binary codes; communication complexity; concatenated codes; error correction codes; iterative decoding; statistical distributions; trellis coded modulation; turbo codes; Euclidean distance; Hamming distance; concatenated two-state trellis-coded modulation; error-correction code; graph code; iterative decoding; parallel concatenated codes; turbo code; Associate members; Concatenated codes; Convolutional codes; Electronic mail; Intserv networks; Iterative decoding; Laboratories; Modulation coding; Parity check codes; Turbo codes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2003.820011
Filename :
1255547
Link To Document :
بازگشت