Construction of quasi‐cyclic low‐density parity‐check codes with low encoding complexity

Low encoding complexity is very important for quasi-cyclic low-density parity-check QC-LDPC codes used in wireless communication systems. In this paper, a new scheme is presented to construct QC-LDPC codes with low encoding complexity. This scheme is called two-stage particle swarm optimization TS-PSO algorithm, in which both the threshold and girth distribution of QC-LDPC codes are considered. The proposed scheme is composed of two stages. In the first stage, we construct a binary base matrix of QC-LDPC code with the best threshold. The matrix is constructed by combining a binary PSO algorithm and the protograph extrinsic information transfer PEXIT method. In the second stage, we search an exponent matrix of the QC-LDPC code with the best girth distribution. This exponent matrix is based on the base matrix obtained in the first stage. Consequently, the parity-check matrix of the QC-LDPC code with the best threshold and best girth distribution are constructed. Furthermore, bit error rate performances are compared for the QC-LDPC codes constructed by proposed scheme, the QC-LDPC code in 802.16e standard, and the QC-LDPC code in Tam's study. Simulation results show that the QC-LDPC codes proposed in this study are superior to both the 802.16e code and the Tam code on the additive white Gaussian noise AWGN and Rayleigh channels. Moreover, proposed scheme is easily implemented, and is flexible and effective for constructing QC-LDPC codes with low encoding complexity. Copyright © 2012 John Wiley & Sons, Ltd.

[1]  Niyazi Odabasioglu,et al.  An optimized scheduling scheme in OFDMA WiMax networks , 2010 .

[2]  A. Massa,et al.  Optimization of a Spline-Shaped UWB Antenna by PSO , 2007, IEEE Antennas and Wireless Propagation Letters.

[3]  M. Karimi,et al.  Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes , 2012, IEEE Transactions on Information Theory.

[4]  Chia-Ju Wu,et al.  A PSO Method With Nonlinear Time-Varying Evolution for Optimal Design of Harmonic Filters , 2009 .

[5]  Kyeongcheol Yang,et al.  Quasi-cyclic LDPC codes for fast encoding , 2005, IEEE Transactions on Information Theory.

[6]  Sae-Young Chung,et al.  On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.

[7]  Niyazi Odabasioglu,et al.  Performance of low density parity check coded continuous phase frequency shift keying (LDPCC‐CPFSK) over fading channels , 2007, Int. J. Commun. Syst..

[8]  Niyazi Odabasioglu,et al.  Performance of low density parity check coded continuous phase frequency shift keying (LDPCC-CPFSK) over fading channels: Research Articles , 2007 .

[9]  Y. Rahmat-Samii,et al.  Advances in Particle Swarm Optimization for Antenna Designs: Real-Number, Binary, Single-Objective and Multiobjective Implementations , 2007, IEEE Transactions on Antennas and Propagation.

[10]  Z. Cai,et al.  Efficient encoding of IEEE 802.11n LDPC codes , 2006 .

[11]  Marco Chiani,et al.  Protograph LDPC Codes Design Based on EXIT Analysis , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[12]  Evangelos Eleftheriou,et al.  Progressive edge-growth Tanner graphs , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[13]  Amir H. Banihashemi,et al.  New Sequences of Capacity Achieving LDPC Code Ensembles Over the Binary Erasure Channel , 2010, IEEE Trans. Inf. Theory.

[14]  Stephan ten Brink,et al.  Design of low-density parity-check codes for modulation and detection , 2004, IEEE Transactions on Communications.

[15]  Chunming Zhao,et al.  Shortening for irregular QC-LDPC codes , 2009, IEEE Communications Letters.

[16]  Victor Fernandez,et al.  Low-cost encoding of IEEE 802.11n , 2008 .

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

[18]  Paul H. Siegel,et al.  Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels , 2001, IEEE J. Sel. Areas Commun..

[19]  Hua Xiao,et al.  Improved progressive-edge-growth (PEG) construction of irregular LDPC codes , 2004, IEEE Communications Letters.

[20]  Chia-Yu Lin,et al.  Operation reduced low‐density parity‐check decoding algorithms for low power communication systems , 2013, Int. J. Commun. Syst..

[21]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[22]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

[23]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

[24]  C. K. Michael Tse,et al.  A class of QC-LDPC codes with low encoding complexity and good error performance , 2010, IEEE Communications Letters.

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

[26]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[27]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[28]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

[29]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[30]  Eiji Oki,et al.  PSO: preventive start-time optimization of OSPF link weights to counter network failure , 2010, IEEE Communications Letters.

[31]  Thakshila Wimalajeewa,et al.  Optimal Power Scheduling for Correlated Data Fusion in Wireless Sensor Networks via Constrained PSO , 2008, IEEE Transactions on Wireless Communications.

[32]  J. Thorpe.  Low-Density Parity-Check (LDPC) Codes Constructed from Protographs , 2003 .

[33]  Amir H. Banihashemi,et al.  Systematic design of low-density parity-check code ensembles for binary erasure channels , 2010, IEEE Transactions on Communications.

[34]  Moon Ho Lee,et al.  Large girth quasi-cyclic LDPC codes based on the chinese remainder theorem , 2009, IEEE Communications Letters.