Soft-bit decoding of regular low-density parity-check codes

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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on circuits and systems. II, Express briefs Ročník 52; číslo 10; s. 646 - 650
Hlavní autoři: Howard, S.L., Gaudet, V.C., Schlegel, C.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.10.2005
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:1549-7747, 1558-3791
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1549-7747
1558-3791
DOI:10.1109/TCSII.2005.850742