Title :
LDPC product codes
Author :
Qi, Zhang ; Sum, Chun
Author_Institution :
Dept. of Electr. & Comput. Eng., Nat. Univ. of Singapore
Abstract :
Low-density parity-check (LDPC) codes are well known for their abilities to achieve near Shannon channel capacity limit and low decoding complexity compared with the turbo decoder. However, their encoding complexities grow with the square of the code length. In this paper, we proposed a type of LDPC product codes, which can significantly lower the encoding complexity at the expense of slight degradation in error-rate performance as well as slight increase in decoding complexity
Keywords :
computational complexity; parity check codes; product codes; LDPC; Shannon channel capacity limit; decoding complexity; encoding complexity; error-rate performance; low-density parity-check code; product code; turbo decoder;
Conference_Titel :
Communications Systems, 2004. ICCS 2004. The Ninth International Conference on
Conference_Location :
Singapore, China
Print_ISBN :
0-7803-8549-7
DOI :
10.1109/ICCS.2004.1359423
