DocumentCode
2266978
Title
Memory-efficient decoding of LDPC codes
Author
Lee, Jason Kwok-San ; Thorpe, Jeremy
Author_Institution
California Univ., Berkeley, CA
fYear
2005
fDate
4-9 Sept. 2005
Firstpage
459
Lastpage
463
Abstract
We present a low-complexity quantization scheme for the implementation of regular (3,6) LDPC codes. The quantization parameters are optimized to maximize the mutual information between the source and the quantized messages. Using this non-uniform quantized belief propagation algorithm, we have simulated that an optimized 3-bit quantizer operates with 0.2 dB implementation loss relative to a floating point decoder, and an optimized 4-bit quantizer operates less than 0.1 dB quantization loss
Keywords
decoding; parity check codes; floating point decoder; implementation loss; low-complexity quantization scheme; memory-efficient decoding; nonuniform quantized belief propagation algorithm; optimized 3-bit quantizer; optimized 4-bit quantizer; quantization loss; quantization parameters; quantized messages; regular (3,6) LDPC codes; Belief propagation; Decoding; Hardware; Laboratories; Logic; Message passing; Parity check codes; Propulsion; Quantization; Signal processing algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location
Adelaide, SA
Print_ISBN
0-7803-9151-9
Type
conf
DOI
10.1109/ISIT.2005.1523376
Filename
1523376
Link To Document