DocumentCode
447147
Title
Repeat accumulate coded modulation with partial iterative demapping
Author
Chen, Xiaoqing ; Yu, Ping ; Yang, Hongwen ; Yang, Dacheng
Author_Institution
Sch. of Telecommun. Eng., Beijing Univ. of Posts & Telecommun., China
Volume
1
fYear
2005
fDate
12-14 Oct. 2005
Firstpage
396
Lastpage
399
Abstract
Repeat accumulate (RA) codes are the known simplest one among the family of the capacity-approaching codes. It is much simpler than turbo codes and low density parity check (LDPC) codes, and hence is a competitive choice for the applications of B3G/3G or 4G systems. The main drawback of RA codes, the low code rate, can be overcome by concatenating modulations. In this paper, performance of RA coded demapping (RACM-ID) and referred to as RA coded modulation with partial iterative demapping (RACM-PID) is proposed. The algorithm is equivalent to reduce the degree of the modulation nodes, which is the most calculation cost in the Tanner graph, and thus we have reduced a large part of the calculation complexity of iterative demapping (ID) while keeping the most of the performance gain due to ID. Simulation results are presented for 8PSK and 16QAM examples.
Keywords
iterative decoding; modulation coding; LDPC; PSK; QAM; Tanner graph; coded demapping; concatenating modulations; low density parity check; partial iterative demapping; repeat accumulate coded modulation; turbo codes; Bandwidth; Costs; Error correction codes; Iterative algorithms; Iterative decoding; Message passing; Modulation coding; Parity check codes; Performance gain; Turbo codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications and Information Technology, 2005. ISCIT 2005. IEEE International Symposium on
Print_ISBN
0-7803-9538-7
Type
conf
DOI
10.1109/ISCIT.2005.1566877
Filename
1566877
Link To Document