Efficient check node update implementation for normalized min-sum algorithm

This paper has presented various min-sum related LDPC decoding algorithms and their typical hardware architectures of check node update in the scenario of parallel implementation. The m-to-2m decoder has been introduced to generate more efficient new hardware implementations of check node update, wh...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:TENCON 2007 - 2007 IEEE Region 10 Conference s. 1 - 4
Hlavní autoři: Lu Xin, Liang Yongsheng, Xu Jun
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.10.2007
Témata:
Additive white noise
AWGN
Baseband
Code standards
Gaussian channels
Hardware
Information technology
Iterative decoding
Parity check codes
Turbo codes
ISBN:1424412714, 9781424412716
ISSN:2159-3442
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í:This paper has presented various min-sum related LDPC decoding algorithms and their typical hardware architectures of check node update in the scenario of parallel implementation. The m-to-2m decoder has been introduced to generate more efficient new hardware implementations of check node update, which can obviously reduce the number of multiplication operations for normalized min-sum algorithm for high rate LDPC codes. Simulations have claimed the performance of normalized min-sum is nearly the same as that of Log-BP, namely the optimal algorithm. In general, this paper has proved that normalized min-sum is good choices as LDPC decoding methods.
ISBN:1424412714
9781424412716
ISSN:2159-3442
DOI:10.1109/TENCON.2007.4429021