Memory-efficient quasi-cyclic spatially coupled low-density parity-check and repeat-accumulate codes

The authors propose the construction of spatially coupled low-density parity-check (SC-LDPC) codes using a periodic time-variant quasi-cyclic (QC) algorithm. The QC-based approach is optimised to obtain memory efficiency in storing the parity-check matrix in the decoders. A hardware model of the parity-check storage units has been designed for a Xilinx field-programmable gate array (FPGA), to compare the logic and memory requirements for various approaches. It is shown that the proposed QC SC-LDPC code (with optimisation) can be stored with reasonable logic resources and without the need of block memory in the FPGA. In addition, a significant improvement in the processing speed is also achieved. This study also proposes a new QC algorithm for constructing spatially coupled repeat-accumulate (SC-RA) codes. The proposed construction reduces the implementation complexity of the encoder and subsequently saves significant computational resources required for storing and accessing the circulants in the decoder. The performance of the proposed code is also compared with the standard RA codes through simulations.

[1]  M. Gomes,et al.  High throughput encoder architecture for DVB-S2 LDPC-IRA codes , 2007, 2007 Internatonal Conference on Microelectronics.

[2]  H. Jin,et al.  Irregular repeat accumulate codes , 2000 .

[3]  Shu Lin,et al.  QSN—A Simple Circular-Shift Network for Reconfigurable Quasi-Cyclic LDPC Decoders , 2010, IEEE Transactions on Circuits and Systems II: Express Briefs.

[4]  Ali Emre Pusane,et al.  Deriving Good LDPC Convolutional Codes from LDPC Block Codes , 2010, IEEE Transactions on Information Theory.

[5]  Seiichi Mita,et al.  A Class of Generalized Quasi-Cyclic LDPC Codes: High-Rate and Low-Complexity Encoder for Data Storage Devices , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[6]  Sarah J. Johnson,et al.  Spatially Coupled Repeat-Accumulate Codes , 2013, IEEE Communications Letters.

[7]  Hideki Imai,et al.  Spatially coupled quasi-cyclic quantum LDPC codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[8]  Mikael Skoglund,et al.  Diversity–Multiplexing Tradeoff in MIMO Channels With Partial CSIT , 2007, IEEE Transactions on Information Theory.

[9]  Daniel J. Costello,et al.  LDPC block and convolutional codes based on circulant matrices , 2004, IEEE Transactions on Information Theory.

[10]  Rüdiger L. Urbanke,et al.  Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BEC , 2010, IEEE Transactions on Information Theory.

[11]  Gang Wang,et al.  A new method of detecting cycles in Tanner graph of LDPC codes , 2009, 2009 International Conference on Wireless Communications & Signal Processing.

[12]  Meixiang Zhang,et al.  Efficient soft demodulation scheme for digital video broadcasting via satellite - Second generation system , 2014, IET Commun..

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

[14]  Dariush Divsalar,et al.  Coding theorems for 'turbo-like' codes , 1998 .

[15]  Sunghwan Kim,et al.  On the girth of tanner (3, 5) quasi-cyclic LDPC codes , 2006, IEEE Transactions on Information Theory.

[16]  Gerhard Fettweis,et al.  A dual-core programmable decoder for LDPC convolutional codes , 2008, 2008 IEEE International Symposium on Circuits and Systems.

[17]  Hui Jiang,et al.  A class of irregular repeat accumulate code with flexible code length and without short circles , 2011, 2011 International Conference on Electrical and Control Engineering.

[18]  Kamil Sh. Zigangirov,et al.  Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.

[19]  Sarah J. Johnson,et al.  Practical Interleavers for Repeat--Accumulate Codes , 2009, IEEE Transactions on Communications.

[20]  Vassilis Paliouras,et al.  An encoding scheme and encoder architecture for rate-compatible QC-LDPC codes , 2011, 2011 IEEE Workshop on Signal Processing Systems (SiPS).

[21]  Stephen Bates,et al.  Construction of low-density parity-check convolutional codes through progressive edge-growth , 2005, IEEE Communications Letters.

[22]  Xu Chen,et al.  A 2.0 Gb/s Throughput Decoder for QC-LDPC Convolutional Codes , 2013, IEEE Transactions on Circuits and Systems I: Regular Papers.

[23]  D. Costello,et al.  Approaching capacity with asymptotically regular LDPC codes , 2009, 2009 Information Theory and Applications Workshop.

[24]  Sarah J. Johnson,et al.  A family of irregular LDPC codes with low encoding complexity , 2003, IEEE Communications Letters.

[25]  Michael Lentmaier,et al.  Iterative Decoding Threshold Analysis for LDPC Convolutional Codes , 2010, IEEE Transactions on Information Theory.

[26]  Sarah J. Johnson,et al.  Combinatorial Interleavers for Systematic Regular Repeat-Accumulate Codes [Transactions Letters] , 2008, IEEE Transactions on Communications.

[27]  Vikram Arkalgud Chandrasetty,et al.  FPGA Implementation of a LDPC Decoder using a Reduced Complexity Message Passing Algorithm , 2011, J. Networks.

[28]  Michael Lentmaier,et al.  Quasi-cyclic asymptotically regular LDPC codes , 2010, 2010 IEEE Information Theory Workshop.

[29]  Michael Lentmaier,et al.  Distance Bounds for an Ensemble of LDPC Convolutional Codes , 2007, IEEE Transactions on Information Theory.

[30]  Ning Chen,et al.  Memory Efficient Decoder Architectures for Quasi-Cyclic LDPC Codes , 2008, IEEE Transactions on Circuits and Systems I: Regular Papers.

[31]  Chuan Yi Tang,et al.  A 2.|E|-Bit Distributed Algorithm for the Directed Euler Trail Problem , 1993, Inf. Process. Lett..

[32]  Giuseppe Caire,et al.  Design methods for irregular repeat-accumulate codes , 2003, IEEE Transactions on Information Theory.

[33]  Jianhui Wang,et al.  QC-IRA-d Codes Based on Circulant Permutation Matrices , 2011, IEEE Communications Letters.