DocumentCode
989918
Title
Block-Interlaced LDPC Decoders With Reduced Interconnect Complexity
Author
Darabiha, Ahmad ; Carusone, Anthony Chan ; Kschischang, Frank R.
Author_Institution
Toronto Univ., Toronto
Volume
55
Issue
1
fYear
2008
Firstpage
74
Lastpage
78
Abstract
Two design techniques are proposed for high-throughput low-density parity-check (LDPC) decoders. A broadcasting technique mitigates routing congestion by reducing the total global wirelength. An interlacing technique increases the decoder throughput by processing two consecutive frames simultaneously. The brief discusses how these techniques can be used for both fully parallel and partially parallel LDPC decoders. For fully parallel decoders with code lengths in the range of a few thousand bits, the half-broadcasting technique reduces the total global wirelength by about 26% without any hardware overhead. The block interlacing scheme is applied to the design of two fully parallel decoders, increasing the throughput by 60% and 71% at the cost of 5.5% and 9.5% gate count overhead, respectively.
Keywords
broadcasting; decoding; parity check codes; telecommunication congestion control; telecommunication network routing; block-interlaced LDPC decoder; broadcasting technique; code length; interconnect complexity; low-density parity-check decoder; routing congestion; Bit error rate; Broadcasting; Hardware; Iterative decoding; Memory management; Parallel architectures; Parity check codes; Routing; Throughput; Very large scale integration; 10-GB Ethernet; channel coding; decoder architectures; iterative message-passing; low-density parity-check (LDPC) codes; very-large-scale integration (VLSI);
fLanguage
English
Journal_Title
Circuits and Systems II: Express Briefs, IEEE Transactions on
Publisher
ieee
ISSN
1549-7747
Type
jour
DOI
10.1109/TCSII.2007.905328
Filename
4389924
Link To Document