Finite Alphabet Iterative Decoders-Part I: Decoding Beyond Belief Propagation on the Binary Symmetric Channel

We introduce a new paradigm for finite precision iterative decoding on low-density parity-check codes over the binary symmetric channel. The messages take values from a finite alphabet, and unlike traditional quantized decoders which are quantized versions of the belief propagation (BP) decoder, the...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on communications Ročník 61; číslo 10; s. 4033 - 4045
Hlavní autori:	Planjery, Shiva Kumar, Declercq, David, Danjean, Ludovic, Vasic, Bane
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York, NY IEEE 01.10.2013 Institute of Electrical and Electronics Engineers
Predmet:	Applied sciences Arrays Belief propagation binary symmetric channel Charge carrier processes Coding, codes Computer Science Decoding error floor Exact sciences and technology finite precision iterative decoding Information Theory Information, signal and communications theory Iterative decoding Low-density parity-check codes Quantization (signal) Signal and communications theory Telecommunications and information theory trapping sets Alphabet Performance evaluation Binary channel belief propagation Logarithmic function binary symmetric channel error floor Updating trapping sets Iterative decoding Credal approach Trapping Low-density parity-check codes Subgraph Floating point Error correcting code Parity check codes finite precision iterative decoding
ISSN:	0090-6778
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!