Design of an Area-Efficient High-Throughput Shift-Based LDPC decoder

An area-efficient high-throughput shift-based LDPC decoder architecture is proposed. The specially designed (512, 1,024) parity-check matrix is effective for partial parallel decoding by the min-sum algorithm (MSA). To increase throughput during decoding, two data frames are fed into the decoder to minimize idle time of the check node unit (CNU) and the variable node unit (VNU). Thus, the throughput is increased to almost two-fold. Unlike the conventional architecture, the message storage unit contains shift registers instead of de-multiplexers and registers. Therefore, hardware costs are reduced. Routing congestion and critical path delay are also reduced, which increases energy efficiency. An implementation of the proposed decoder using TSMC 0.18 μm CMOS process achieves a decoding throughput of 1.725 Gbps, at a clock frequency of 56 MHz, a supply voltage of 1.8 V, and a core area of 5.18 mm2. The normalized area is smaller and the throughput per normalized power consumption is higher than those reported using the conventional architectures.

[1]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[2]  A. J. Blanksby,et al.  A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check code decoder , 2001, IEEE J. Solid State Circuits.

[3]  Jinghu Chen,et al.  Decoding low-density parity check codes with normalized APP-based algorithm , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[4]  An Pan,et al.  An Area-Efficient and Low-Power Multirate Decoder for Quasi-Cyclic Low-Density Parity-Check Codes , 2010, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[5]  Ajay Dholakia,et al.  Efficient implementations of the sum-product algorithm for decoding LDPC codes , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[6]  Frank R. Kschischang,et al.  Power Reduction Techniques for LDPC Decoders , 2008, IEEE Journal of Solid-State Circuits.

[7]  In-Cheol Park,et al.  Loosely coupled memory-based decoding architecture for low density parity check codes , 2005, IEEE Transactions on Circuits and Systems I: Regular Papers.

[8]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[9]  Keshab K. Parhi,et al.  VLSI implementation-oriented (3, k)-regular low-density parity-check codes , 2001, 2001 IEEE Workshop on Signal Processing Systems. SiPS 2001. Design and Implementation (Cat. No.01TH8578).

[10]  Kenta Kasai,et al.  Detailedly Represented Irregular Low-Density Parity-Check Codes , 2003, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[11]  Payam Pakzad,et al.  VLSI architectures for iterative decoders in magnetic recording channels , 2001 .

[12]  Tomoaki Ohtsuki,et al.  LDPC Codes in Communications and Broadcasting , 2007, IEICE Trans. Commun..

[13]  Vincent C. Gaudet,et al.  Design of High-Throughput Fully Parallel LDPC Decoders Based on Wire Partitioning , 2010, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[14]  J.M.F. Moura,et al.  Partition-and-shift LDPC codes , 2005, IEEE Transactions on Magnetics.

[15]  Shu Lin,et al.  A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols , 2003, IEEE Communications Letters.

[16]  Marc P. C. Fossorier,et al.  Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices , 2004, IEEE Trans. Inf. Theory.