Hybrid Hard-Decision Iterative Decoding of Irregular Low-Density Parity-Check Codes

Time-invariant hybrid (Hscr TI ) decoding of irregular low-density parity-check (LDPC) codes is studied. Focusing on Hscr TI algorithms with majority-based (MB) binary message-passing constituents, we use density evolution (DE) and finite-length simulation to analyze the performance and the converge...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on communications Ročník 55; číslo 2; s. 292 - 302
Hlavní autoři: Zarrinkhat, P., Banihasherni, A.H.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.02.2007
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithm design and analysis
Algorithms
Analytical models
Applied sciences
Asymptotic properties
Binary system
Channels
Codes
Coding, codes
Convergence
Decoding
Density
Density evolution (DE)
Error probability
Evolution
Exact sciences and technology
Focusing
hybrid decoding
Information, signal and communications theory
irregular low-density parity-check (LDPC) codes
Iterative algorithms
iterative coding schemes
Iterative decoding
Low density parity check codes
message-passing decoding algorithms
Parity check codes
Performance analysis
Robustness
Signal and communications theory
Telecommunications and information theory
Upper bound
Performance evaluation
Binary channel
Error probability
hybrid decoding
iterative coding schemes
Optimal algorithm
Iterative method
Density evolution (DE)
Iterative decoding
Upper bound
Memoryless channel
Message passing
Simulation
Coding
message-passing decoding algorithms
Parity check codes
Error correcting code
irregular low-density parity-check (LDPC) codes
ISSN:0090-6778, 1558-0857
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í:Time-invariant hybrid (Hscr TI ) decoding of irregular low-density parity-check (LDPC) codes is studied. Focusing on Hscr TI algorithms with majority-based (MB) binary message-passing constituents, we use density evolution (DE) and finite-length simulation to analyze the performance and the convergence properties of these algorithms over (memoryless) binary symmetric channels. To apply DE, we generalize degree distributions to have the irregularity of both the code and the decoding algorithm embedded in them. A tight upper bound on the threshold of MB Hscr TI algorithms is derived, and it is proven that the asymptotic error probability for these algorithms tends to zero, at least exponentially, with the number of iterations. We devise optimal MB Hscr TI algorithms for irregular LDPC codes, and show that these algorithms outperform Gallager's algorithm A applied to optimized irregular LDPC codes. We also show that compared to switch-type algorithms, such as Gallager's algorithm B, where a comparable improvement is obtained by switching between different MB algorithms, MB Hscr TI algorithms are more robust and can better cope with unknown channel conditions, and thus can be practically more attractive.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2006.888584