Flexible, Cost-Efficient, High-Throughput Architecture for Layered LDPC Decoders with Fully-Parallel Processing Units

被引:14
作者
Nguen-Ly, Mien T. [1 ,2 ]
Gupta, Tushar [1 ]
Pezzin, Manuel [1 ]
Savin, Valentin [1 ]
Declereq, David [2 ]
Colofana, Sorin [3 ]
机构
[1] CEA LETI, MINATEC Campus, Grenoble, France
[2] Univ Cergy Pontoise, CNRS UMR8051, ENSEA, ETIS, Cergy Pontoise, France
[3] Delft Univ Technol, Comp Engn Lab, NL-2600 AA Delft, Netherlands
来源
19TH EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN (DSD 2016) | 2016年
关键词
PARITY-CHECK CODES;
D O I
10.1109/DSD.2016.33
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper, we propose a layered LDPC decoder architecture targeting flexibility, high-throughput, low cost, and efficient use of the hardware resources. The proposed architecture provides full design time flexibility, i.e., it can accommodate any Quasi-Cyclic (QC) LDPC code, and also allows redefining a number of parameters of the QC-LDPC code at the run time. The main novelty of the paper consists of: (1) a new low-cost processing unit that merges the logical functionalities of the Variable-Node Unit (VNU) and the A Posteriori Log-Likelihood Ratio (AP-LLR) unit in an efficient way, (2) a high speed, low-cost Check-Node Unit (CNU) architecture, which is executed twice at each iteration in order to complete the computation of the check-node messages, (3) a splitting of the iteration processing in two perfectly symmetric stages, executed in two consecutive clock cycles, each one using exactly the same processing resources; the processing load is perfectly balanced between the two clock cycles, thus yielding an optimal clock frequency. Synthesis results targeting a 65nm CMOS technology for a (3, 6)-regular (648, 1296) Quasi-Cyclic LDPC code and for the WiMax (1152, 2304) irregular QC-LDPC code show significant improvements in terms of area and throughput compared to the baseline architecture discussed in this paper, as well as several state of the art implementations.
引用
收藏
页码:230 / 237
页数:8
相关论文
共 16 条
[1]  
[Anonymous], 2006, 80216E2005 IEEE COMP
[2]  
[Anonymous], IEEE INT C FIELD PRO
[3]  
[Anonymous], HDB SEMICONDUCTOR MA
[4]  
Boutillon E, 2014, CHANNEL CODING: THEORY, ALGORITHMS, AND APPLICATIONS, P583, DOI 10.1016/B978-0-12-396499-1.00013-3
[5]   Quasi-cyclic low-density parity-check codes from circulant permutation matrices [J].
Fossorier, MPC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (08) :1788-1793
[6]   Reduced complexity iterative decoding of low-density parity check codes based on belief propagation [J].
Fossorier, MPC ;
Mihaljevic, M ;
Imai, H .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1999, 47 (05) :673-680
[7]  
Heidari T, 2013, IRAN CONF ELECTR ENG
[8]  
Hocevar DE, 2004, 2004 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEMS DESIGN AND IMPLEMENTATION, PROCEEDINGS, P107
[9]   Multi-standard high-throughput and low-power quasi-cyclic low density parity check decoder for worldwide interoperability for microwave access and wireless fidelity standards [J].
Kanchetla, Vijaya Kumar ;
Shrestha, Rahul ;
Paily, Roy .
IET CIRCUITS DEVICES & SYSTEMS, 2016, 10 (02) :111-120
[10]   Iterative decoding of compound codes by probability propagation in graphical models [J].
Kschischang, FR ;
Frey, BJ .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1998, 16 (02) :219-230