On finite precision implementation of low density parity check codes decoder
Authors:
- Z. WangZWZ. Wang
- K.K. ParhiKPK.K. Parhi
- 13 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 202-205
Abstract
In this paper, we analyze the finite precision effects on the decoding performance of Gallager's low density parity check (LDPC) codes and develop optimal finite word lengths of variables as far as the tradeoffs between the performance and hardware complexity are concerned. We have found that 4 bits and 6 bits are adequate for representing the received data and extrinsic information, respectively. Simulation results indicate that the quantization scheme we have developed for the LDPC decoder is effective in approximating the infinite precision implementation.Keywords
This publication has 7 references indexed in Scilit:
- Design of provably good low-density parity check codes2002
- Efficient encoding of low-density parity-check codesIEEE Transactions on Information Theory, 2001
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Interleaver structures for turbo codes with reduced storage memory requirement1999
- Design of interleavers for turbo codes: iterative interleaver growth algorithms of polynomial complexityIEEE Transactions on Information Theory, 1999
- Low-Density Parity-Check Codes1963
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962