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-likelihood-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 |
Fingerprint
Keywords
- Belief propagation (BP)
- Iterative decoding algorithms
- Low-density parity-check (LDPC) codes
- Soft output decoding
ASJC Scopus subject areas
- Signal Processing
- Electrical and Electronic Engineering
Cite this
Soft-bit decoding of regular low-density parity-check codes. / Howard, Sheryl L; Gaudet, Vincent C.; Schlegel, Christian.
In: IEEE Transactions on Circuits and Systems II: Express Briefs, Vol. 52, No. 10, 10.2005, p. 646-650.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Soft-bit decoding of regular low-density parity-check codes
AU - Howard, Sheryl L
AU - Gaudet, Vincent C.
AU - Schlegel, Christian
PY - 2005/10
Y1 - 2005/10
N2 - 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-likelihood-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.
AB - 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-likelihood-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.
KW - Belief propagation (BP)
KW - Iterative decoding algorithms
KW - Low-density parity-check (LDPC) codes
KW - Soft output decoding
UR - http://www.scopus.com/inward/record.url?scp=27644590963&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=27644590963&partnerID=8YFLogxK
U2 - 10.1109/TCSII.2005.850742
DO - 10.1109/TCSII.2005.850742
M3 - Article
VL - 52
SP - 646
EP - 650
JO - IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
JF - IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing
SN - 1057-7130
IS - 10
ER -