Title :
Quantized min-sum decoders with low error floor for LDPC codes
Author :
Zhang, Xiaojie ; Siegel, Paul H.
Author_Institution :
Univ. of California, San Diego, La Jolla, CA, USA
Abstract :
The error floor phenomenon observed with LDPC codes and their graph-based, iterative, message-passing (MP) decoders is commonly attributed to the existence of error-prone substructures in a Tanner graph representation of the code. Many approaches have been proposed to lower the error floor by designing new LDPC codes with fewer such substructures or by modifying the decoding algorithm. In this paper, we show that one source of the error floors observed in the literature may be the message quantization rule used in the iterative decoder implementation. We then propose a new quantization method to overcome the limitations of standard quantization rules. Performance simulation results for two LDPC codes commonly found to have high error floors when used with the fixed-point min-sum decoder and its variants demonstrate the validity of our findings and the effectiveness of the proposed quantization algorithm.
Keywords :
decoding; directed graphs; iterative decoding; message passing; parity check codes; quantisation (signal); LDPC codes; Tanner graph representation; error floor; error prone substructures; iterative decoder implementation; low density parity check codes; message passing decoders; message quantization rule; quantized min-sum decoders; Algorithm design and analysis; Charge carrier processes; Decoding; Error analysis; Iterative decoding; Quantization;
Conference_Titel :
Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
978-1-4673-2580-6
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2012.6284049