Soft-Bit Decoding of Regular Low-Density Parity-Check Codes

Sheryl L. Howard; Vincent C. Gaudet; Christian Schlegel

doi:10.1109/TCSII.2005.850742

Soft-Bit Decoding of Regular Low-Density Parity-Check Codes

Sheryl L. Howard, Vincent C. Gaudet, Christian Schlegel

Informatics, Computing, and Cyber Systems, School of

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

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	https://doi.org/10.1109/TCSII.2005.850742
State	Published - Oct 2005

Keywords

Belief propagation (BP)
iterative decoding algorithms
low-density parity-check (LDPC) codes
soft output decoding

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/TCSII.2005.850742

Cite this

@article{15f8bb80097a4a41bc5ddb4f131faf11,

title = "Soft-Bit Decoding of Regular Low-Density Parity-Check Codes",

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.",

keywords = "Belief propagation (BP), iterative decoding algorithms, low-density parity-check (LDPC) codes, soft output decoding",

author = "Howard, {Sheryl L.} and Gaudet, {Vincent C.} and Christian Schlegel",

year = "2005",

month = oct,

doi = "10.1109/TCSII.2005.850742",

language = "English (US)",

volume = "52",

pages = "646--650",

journal = "IEEE Transactions on Circuits and Systems II: Express Briefs",

issn = "1549-7747",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "10",

}

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-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.

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-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.

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

AN - SCOPUS:27644590963

SN - 1549-7747

VL - 52

SP - 646

EP - 650

JO - IEEE Transactions on Circuits and Systems II: Express Briefs

JF - IEEE Transactions on Circuits and Systems II: Express Briefs

IS - 10

ER -

Soft-Bit Decoding of Regular Low-Density Parity-Check Codes

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this