DocumentCode
2716636
Title
Interconnection Network for Structured Low-Density Parity-Check Decoders
Author
Malema, Gabofetswe ; Liebelt, Michael
Author_Institution
Sch. of Electr. & Electron. Eng., Adelaide Univ., SA
fYear
2005
fDate
5-5 Oct. 2005
Firstpage
537
Lastpage
540
Abstract
Most structured codes use the group-and-permute design approach in which rows and columns are divided into groups of the same size. Row/column groups and individual row-column are connected by some permutation. A general group-and-permute decoder requires an interconnection network for group-to-group communication. In this paper we suggest the use of self-routed Benes networks based on the communication pattern of LDPC codes. Bipartite edge coloring is used to schedule messages such that there are no switch network output conflicts. The looping routing algorithm for Benes networks is used to compute switching codes. Both scheduling information and switching codes are pre-computed and stored for each design code since they do not change in the lifetime of the code
Keywords
multiprocessor interconnection networks; parity check codes; LDPC codes; bipartite edge coloring; group-and-permute design; group-to-group communication; interconnection network; looping routing algorithm; self-routed Benes networks; structured low-density parity-check decoders; Australia; Communication switching; Decoding; Design engineering; Multiprocessor interconnection networks; Parity check codes; Processor scheduling; Routing; Switches; Telephony;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2005 Asia-Pacific Conference on
Conference_Location
Perth, WA
Print_ISBN
0-7803-9132-2
Type
conf
DOI
10.1109/APCC.2005.1554118
Filename
1554118
Link To Document