DocumentCode :
1796503
Title :
Matrix reordering techniques for memory conflict reduction for pipelined QC-LDPC decoder
Author :
Zhenzhi Wu ; Dake Liu ; Yanjun Zhang
Author_Institution :
Sch. of Inf. & Electron., Beijing Inst. of Technol., Beijing, China
fYear :
2014
fDate :
13-15 Oct. 2014
Firstpage :
354
Lastpage :
359
Abstract :
Layered Decoding (LD) algorithm is widely applied in high throughput QC-LDPC decoders. Among all check node update algorithms in LD, Turbo-Decoding Message-Passing (TDMP) is adopted by many proposals. A-posteriori memory access conflict under pipelined TDMP decoder incurs serious throughput decline. In this paper, several matrix reordering techniques are introduced to reduce the conflict occurrences without incurring the performance loss, which includes Row Exchange method, element Sequence Reordering method, and a conflict detector with pipeline stall insertion. They are integrated in a joint recursive deep-first searching procedure. Test results show that the efficiency improvement reaches up to 60% compared to non-optimized scenarios for 802.11n and 802.16e standards.
Keywords :
matrix algebra; parity check codes; search problems; turbo codes; LD algorithm; check node update algorithms; conflict occurrences; element sequence reordering method; joint recursive deep-first searching procedure; layered decoding algorithm; matrix reordering techniques; memory conflict reduction; pipelined QC-LDPC decoder; pipelined TDMP decoder; row exchange method; turbo-decoding message-passing; Decoding; Hardware; IEEE 802.11n Standard; IEEE 802.16 Standards; Indexes; Signal processing algorithms; Throughput; Conflict reduction; Matrix reordering; QC-LDPC;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications in China (ICCC), 2014 IEEE/CIC International Conference on
Conference_Location :
Shanghai
Type :
conf
DOI :
10.1109/ICCChina.2014.7008301
Filename :
7008301
Link To Document :
بازگشت