DocumentCode
2494434
Title
A Bit-Node Centric Architecture for Low-Density Parity-Check Decoders
Author
Ratnayake, Ruwan N S ; Haratsch, Erich F. ; Wei, Gu-Yeon
Author_Institution
Harvard Univ., Cambridge
fYear
2007
fDate
26-30 Nov. 2007
Firstpage
265
Lastpage
270
Abstract
A bit-node centric decoder architecture for low- density parity-check codes is proposed. This architecture performs the optimum sum-product algorithm. A bit node processing unit computes the bit-to-check node messages sequentially, while the computation of the check-to-bit node messages is broken up into several steps. A stand-alone decoder architecture, and a decoder architecture for a concatenated detector-decoder system are presented. The proposed stand-alone decoder architecture requires significantly less memory compared to other known serial architectures. The hardware requirements are reduced even further for the concatenated detector-decoder system.
Keywords
concatenated codes; decoding; parity check codes; product codes; bit-node centric decoder architecture; bit-to-check node message; check-to-bit node message; concatenated detector-decoder system; low-density parity-check decoder; optimum sum-product algorithm; stand-alone decoder architecture; Computational complexity; Computer architecture; Concatenated codes; Hardware; Iterative decoding; Message passing; Parallel architectures; Parity check codes; Turbo codes; Wiring;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE
Conference_Location
Washington, DC
Print_ISBN
978-1-4244-1042-2
Electronic_ISBN
978-1-4244-1043-9
Type
conf
DOI
10.1109/GLOCOM.2007.57
Filename
4410967
Link To Document