A low-cost serial decoder architecture for low-density parity-check convolutional codes

被引:11
作者
Bates, Stephen [1 ]
Chen, Zhengang [1 ]
Gunthorpe, Logan [1 ]
Pusane, Ali Emre [2 ]
Zigangirov, Kamil Sh. [2 ]
Costello, Daniel J., Jr. [2 ]
机构
[1] Univ Alberta, Dept Elect & Comp Engn, Edmonton, AB T6G 2V4, Canada
[2] Univ Notre Dame, Dept Elect Engn, Notre Dame, IN 46556 USA
基金
美国国家航空航天局; 加拿大自然科学与工程研究理事会; 美国国家科学基金会;
关键词
convolutional codes (CCs); data communication; error correction codes; high-speed integrated circuits;
D O I
10.1109/TCSI.2008.918002
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We propose a low-cost serial decoder architecture for low-density parity-check convolutional codes (LDPC-CCs). It has been shown that LDPC-CCs can achieve comparable performance to LDPC block codes with constraint length much less than the block length. The proposed serial decoder architecture for LDPC-CCs uses a single decoding processor. Terminated data frames are sent through the processor iteratively until correctly decoded -or a maximum number of iterations is reached. This architecture saves memory consumption and uses a very small number of logic elements, making it especially suitable for strong LDPC-CCs with large code memory. The proposed architecture is realized for a (2048,3,6) regular LDPC-CC on an Altera Stratix FPGA. With a maximum of 100 iterations, the design achieves up to 9-Mb/s throughput using only a very small portion of the field-programmable gate array resources.
引用
收藏
页码:1967 / 1976
页数:10
相关论文
共 38 条
[11]  
Chen ZG, 2005, GLOB TELECOMM CONF, P1250
[12]   Construction of low-density parity-check convolutional codes through progressive edge-growth [J].
Chen, ZG ;
Bates, S .
IEEE COMMUNICATIONS LETTERS, 2005, 9 (12) :1058-1060
[13]   On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit [J].
Chung, SY ;
Forney, GD ;
Richardson, TJ ;
Urbanke, R .
IEEE COMMUNICATIONS LETTERS, 2001, 5 (02) :58-60
[14]   Multi-Gbit/sec low density parity check decoders with reduced interconnect complexity [J].
Darabiha, A ;
Carusone, AC ;
Kschischang, FR .
2005 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), VOLS 1-6, CONFERENCE PROCEEDINGS, 2005, :5194-5197
[15]   A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols [J].
Djurdjevic, I ;
Xu, J ;
Abdel-Ghaffar, K ;
Lin, S .
IEEE COMMUNICATIONS LETTERS, 2003, 7 (07) :317-319
[16]  
Dowla Farid, 2003, HDB RF WIRELESS TECH
[17]   Time-varying periodic convolutional codes with low-density parity-check matrix [J].
Felstrom, AJ ;
Zigangirov, KS .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (06) :2181-2191
[18]   LOW-DENSITY PARITY-CHECK CODES [J].
GALLAGER, RG .
IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01) :21-&
[19]  
Howard SL, 2005, 2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, P1131
[20]   ON TAIL BITING CONVOLUTIONAL-CODES [J].
MA, HH ;
WOLF, JK .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1986, 34 (02) :104-111