Abstract
A novel representation, using soft-bit messages, of the belief propagation (BP) decoding algorithm for low-density parity-check codes is derived as an alternative to the log-likeli-hood-ratio (LLR)-based BP and min-sum decoding algorithms. A simple approximation is also presented. Simulation results demonstrate the functionality of the soft-bit decoding algorithm. Floating-point soft-bit and LLR BP decoding show equivalent performance; the approximation incurs 0.5-dB loss, comparable to min-sum performance loss over BP. Fixed-point results show similar performance to LLR BP decoding; the approximation converges to floating-point results with one less bit of precision.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 646-650 |
| Number of pages | 5 |
| Journal | IEEE Transactions on Circuits and Systems II: Express Briefs |
| Volume | 52 |
| Issue number | 10 |
| DOIs | |
| State | Published - Oct 2005 |
| Externally published | Yes |
Keywords
- Belief propagation (BP)
- iterative decoding algorithms
- low-density parity-check (LDPC) codes
- soft output decoding
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Fingerprint Dive into the research topics of 'Soft-Bit Decoding of Regular Low-Density Parity-Check Codes'. Together they form a unique fingerprint.
Cite this
Howard, S. L., Gaudet, V. C., & Schlegel, C. (2005). Soft-Bit Decoding of Regular Low-Density Parity-Check Codes. IEEE Transactions on Circuits and Systems II: Express Briefs, 52(10), 646-650. https://doi.org/10.1109/TCSII.2005.850742