DocumentCode :
2328950
Title :
A 11.5-Gbps LDPC decoder based on CP-PEG code construction
Author :
Chen, Chih-Lung ; Lin, Kao-Shou ; Chang, Hsie-Chia ; Fang, Wai-Chi ; Lee, Chen-Yi
Author_Institution :
Dept. of Electron. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan
fYear :
2009
fDate :
14-18 Sept. 2009
Firstpage :
412
Lastpage :
415
Abstract :
In this paper, a LDPC decoder chip based on CPPEG code construction is presented. The (2048, 1920) irregular LDPC code generated by CP-PEG algorithm has better performance than other PEG-based codes; however, the large check node degrees introduced by high code-rate 15/16 become the implementation bottleneck. To design such a high code-rate LDPC decoder, our approach features variable-node-centric sequential scheduling to reduce iteration number, single piplelined decoder architecture to lessen the message storage memory size, as well as optimized check node unit to further compress the register number. Overall 73% message storage memory is saved as compared with traditional architecture. Fabricated in 90 nm 1P9M CMOS technology, a test decoder chip could achieve maximum 11.5 Gbps throughput under 1.4 V supply voltage with core area of 2.7 times 1.4 mm2. The energy efficiency is only 0.033 nJ/bit with 5.77 Gbps at 0.8 V to meet IEEE 802.15.3c requirements.
Keywords :
CMOS digital integrated circuits; codecs; logic design; parity check codes; CMOS; CP-PEG code construction; IEEE 802.15.3c; LDPC decoder; bit rate 11.5 Gbit/s; bit rate 5.77 Gbit/s; iteration number; message storage memory size; single piplelined decoder architecture; size 90 nm; variable-node-centric sequential scheduling; voltage 0.8 V; voltage 1.4 V; Bipartite graph; CMOS technology; Cascading style sheets; Energy efficiency; Iterative algorithms; Iterative decoding; Parity check codes; Scheduling algorithm; Throughput; Variable structure systems; High throughput; LDPC; sequential scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
ESSCIRC, 2009. ESSCIRC '09. Proceedings of
Conference_Location :
Athens
ISSN :
1930-8833
Print_ISBN :
978-1-4244-4354-3
Type :
conf
DOI :
10.1109/ESSCIRC.2009.5325933
Filename :
5325933
Link To Document :
بازگشت