Title :
Iterative Decoding of L-step Majority-Logic Decodable Codes Based on Belief Propagation
Author_Institution :
Beijing Institutes of Tracking & Telecommun. Technol., Beijing
Abstract :
Iterative decoding of L-step Majority-Logic decodable (LSMLD) codes based on belief propagation (BP) is presented. The orthogonal Tanner graph of LSMLD codes is derived based on the L-step orthogonalized parity checks. The BP decoding algorithm based on the orthogonal Tanner graph (BP-O) is also designed. As the orthogonal Tanner graph is sparse and free of 4- cycles, LSMLD codes perform well under BP-O decoding. Simulation results show that BP-O decoding of LSMLD codes achieves a good soft-decision decoding gain over hard-decision decoding and the performance of LSMLD codes under BP-O decoding is equally well as that of LDPC codes with the same block length and rate under BP decoding.
Keywords :
iterative decoding; orthogonal codes; parity check codes; L-step majority-logic decodable codes; belief propagation; decoding algorithm; iterative decoding; orthogonal Tanner graph; AWGN; Algorithm design and analysis; Belief propagation; Iterative algorithms; Iterative decoding; Maximum likelihood decoding; Parity check codes; Performance gain; Symmetric matrices; Turbo codes;
Conference_Titel :
Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-1311-9
DOI :
10.1109/WICOM.2007.211