Decoding low density parity check codes with finite quantization bits
Authors:
- Li PingLPLi Ping
- W.K. LeungWLW.K. Leung
- 1 February 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 4 (2) , 62-64
Abstract
This letter is concerned with the implementation issue of the sum-product algorithm (SPA) for decoding the low density parity check codes. It is shown that the direct implementation of the original form of SPA is sensitive to the quantization effect. We propose a parity likelihood ratio technique to overcome the problem. It is shown that for comparable performance the new method can be implemented with much less quantization bits, which can lead to considerably lower decoding cost.Keywords
This publication has 6 references indexed in Scilit:
- Multiple turbo codes2002
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Modified turbo codes with low decoding complexityElectronics Letters, 1998
- Near Shannon limit performance of low density paritycheck codesElectronics Letters, 1997
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962