A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution
- 13 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1021-1025
- https://doi.org/10.1109/glocom.2001.965572
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Soft-output decoding algorithms for continuous decoding of parallel concatenated convolutional codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the design of low-density parity-check codes within 0.0045 dB of the Shannon limitIEEE Communications Letters, 2001
- Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximationIEEE Transactions on Information Theory, 2001
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962