Title :
Terminated LDPC convolutional codes over GF(2p)
Author :
Uchikawa, Hironori ; Kasai, Kenta ; Sakaniwa, Kohichi
Author_Institution :
Dept. of Commun. & Integrated Syst., Tokyo Inst. of Technol., Tokyo, Japan
fDate :
Sept. 29 2010-Oct. 1 2010
Abstract :
In this paper, we present a construction method of terminated non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an expansion of Felstrom and Zigangirov construction [1] for non-binary LDPC convolutional codes. The rate-compatibility of the non-binary LDPC convolutional codes is also discussed. The proposed rate-compatible code is designed from one single mother (2,4)-regular non-binary LDPC convolutional code of rate 1/2. Higher-rate codes are produced by puncturing the mother code and lower-rate codes are produced by multiplicatively repeating the mother code. For moderate values of the syndrome former memory, simulation results show that mother non-binary LDPC convolutional code outperform binary LDPC convolutional codes with comparable constraint bit length. And the derived low-rate and high-rate non-binary LDPC convolutional codes exhibit good decoding performance without loss of large gap to the Shannon limits.
Keywords :
Galois fields; convolutional codes; information theory; parity check codes; Felstrom construction; GF(2p); Shannon limits; Zigangirov construction; convolutional codes; nonbinary low-density parity-check codes; rate-compatible code; syndrome former memory; terminated LDPC; Block codes; Complexity theory; Convolutional codes; Decoding; Memory management; Parity check codes;
Conference_Titel :
Communication, Control, and Computing (Allerton), 2010 48th Annual Allerton Conference on
Conference_Location :
Allerton, IL
Print_ISBN :
978-1-4244-8215-3
DOI :
10.1109/ALLERTON.2010.5706907