Title :
Partially-regular LDPC codes with linear encoding complexity and improved thresholds
Author :
Zigangirov, D.K. ; Zigangirov, K.S. ; Costello, Daniel J.
Author_Institution :
Inst. for Problems of Inf. Transm., Moscow, Russia
fDate :
July 31 2011-Aug. 5 2011
Abstract :
We consider an ensemble of systematic low-density parity-check (LDPC) codes of length N with linear encoding complexity, i.e., with complexity O(N). We call these codes partially-regular, since they can be considered as modifications of regular LDPC codes. Further, their iterative decoding thresholds on the binary erasure channel (BEC) are found to be significantly better than the thresholds of the corresponding regular LDPC codes.
Keywords :
binary codes; channel coding; iterative decoding; linear codes; parity check codes; binary erasure channel; iterative decoding thresholds; linear encoding complexity; partially-regular LDPC codes; systematic low-density parity-check codes; Complexity theory; Encoding; Equations; Iterative decoding; Mathematical model; Systematics;
Conference_Titel :
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location :
St. Petersburg
Print_ISBN :
978-1-4577-0596-0
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2011.6034184