Title :
Improved linear programming decoding and bounds on the minimum distance of LDPC codes
Author :
Burshtein, David ; Goldenberg, Idan
Author_Institution :
Sch. of Electr. Eng., Tel-Aviv Univ., Tel-Aviv, Israel
fDate :
Aug. 30 2010-Sept. 3 2010
Abstract :
We propose a technique for improving LP decoding, based on the merging of check nodes. This technique can be applied to standard as well as generalized LDPC codes. Furthermore, we show how a recently-discovered linear-complexity LP decoder can be used to derive non-trivial lower bounds on the minimum distance of specific LDPC codes, with complexity that exhibits quadratic growth with respect to the block length. This bound can be refined using the check node merging technique. The lower bound on the minimum distance is shown to be an upper bound on the fractional distance of the code.
Keywords :
linear codes; linear programming; parity check codes; LDPC codes; check node merging technique; improved linear programming decoding; linear complexity LP decoder; low-density parity check codes; Complexity theory; Iterative decoding; Maximum likelihood decoding; Merging; Upper bound; Linear programming decoding; iterative decoding; low-density parity-check (LDPC) codes; maximum likelihood (ML) decoding;
Conference_Titel :
Information Theory Workshop (ITW), 2010 IEEE
Conference_Location :
Dublin
Print_ISBN :
978-1-4244-8262-7
Electronic_ISBN :
978-1-4244-8263-4
DOI :
10.1109/CIG.2010.5592887