[1] Liang Yuan, Zhang Shulin, Gu Pinbiao, Wu Lenan, et al. Efficient construction and encoding of QC-LDPC codesby cyclic lifting of protographs [J]. Journal of Southeast University (English Edition), 2015, 31 (1): 25-30. [doi:10.3969/j.issn.1003-7985.2015.01.005]
Copy
Efficient construction and encoding of QC-LDPC codesby cyclic lifting of protographs(
)
基于原型图循环提升的高效QC-LDPC码构造和编码
)Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]
- Volumn:
- 31
- Issue:
- 2015 1
- Page:
- 25-30
- Research Field:
- Information and Communication Engineering
- Publishing date:
- 2015-03-30
Info
- Title:
- Efficient construction and encoding of QC-LDPC codesby cyclic lifting of protographs
- 基于原型图循环提升的高效QC-LDPC码构造和编码
- Author(s):
- Liang Yuan; Zhang Shulin; Gu Pinbiao; Wu Lenan
- School of Information Science and Engineering, Southeast University, Nanjing 210096, China
- Keywords:
- low-density parity-check(LDPC)codes; quasi-cyclic LDPC codes; cyclic lifting; protograph LDPC codes
- PACS:
- TN911.21
- DOI:
- 10.3969/j.issn.1003-7985.2015.01.005
- Abstract:
- Quasi-cyclic low-density parity-check(QC-LDPC)codes can be constructed conveniently by cyclic lifting of protographs. For the purpose of eliminating short cycles in the Tanner graph to guarantee performance, first an algorithm to enumerate the harmful short cycles in the protograph is designed, and then a greedy algorithm is proposed to assign proper permutation shifts to the circulant permutation submatrices in the parity check matrix after lifting. Compared with the existing deterministic edge swapping(DES)algorithms, the proposed greedy algorithm adds more constraints in the assignment of permutation shifts to improve performance. Simulation results verify that it outperforms DES in reducing short cycles. In addition, it is proved that the parity check matrices of the cyclic lifted QC-LDPC codes can be transformed into block lower triangular ones when the lifting factor is a power of 2. Utilizing this property, the QC-LDPC codes can be encoded by preprocessing the base matrices, which reduces the encoding complexity to a large extent.
- 通过原型图的循环提升可方便地构造准循环低密度奇偶校验(QC-LDPC)码.为了保证QC-LDPC码的性能, 消除Tanner图中的短环, 首先设计一种算法用于找出原型图中的有害短环, 然后提出一种贪婪算法用于对提升后的校验矩阵中的单位循环位移子阵分配适合的循环位移量.与已有的DES算法相比, 所提出的贪婪算法在分配循环位移量时施加了更多的限制条件来提升性能, 仿真结果表明它比DES算法能消除更多的短环.当提升因子为2的整数次幂时, 证明了所得QC-LDPC码的校验阵可转化成分块下三角阵的形式.利用该性质, 由原型图循环提升得到的QC-LDPC码仅需对基矩阵做预处理就可以实现编码, 极大地降低了QC-LDPC码的编码复杂度.
References:
[1] Wang C C. Code annealing and the suppressing effect of the cyclically lifted LDPC code ensemble [C]//IEEE Information Theory Workshop. Chengdu, China, 2006: 86-90.
[2] Asvadi R, Banihashemi A H, Ahmadian-Attari M. Lowering the error floor of LDPC codes using cyclic liftings [J]. IEEE Transactions on Information Theory, 2011, 57(4): 2213-2224.
[3] Asvadi R, Banihashemi A H, Ahmadian-Attari M. Design of finite-length irregular protograph codes with low error floors over the binary-input AWGN channel using cyclic liftings [J]. IEEE Transactions on Communications, 2012, 60(4): 902-907.
[4] Divsalar D, Dolinar S, Jones C R, et al. Capacity-approaching protograph codes [J]. IEEE Journal on Selected Areas in Communications, 2009, 27(6): 876-888.
[5] Tian T, Jones C R, Villasenor J D, et al. Selective avoidance of cycles in irregular LDPC code construction [J]. IEEE Transactions on Communications, 2004, 52(8): 1242-1247.
[6] Di C, Proietti D, Telatar I E, et al. Finite-length analysis of low-density parity-check codes on the binary erasure channel [J]. IEEE Transactions on Information Theory, 2002, 48(6): 1570-1579.
[7] Richardson T J. Error floors of LDPC codes [C]//41th Allerton Conference on Communication Control and Computing. Urbana, USA, 2003: 1426-1435.
[8] Sharon E, Litsyn S. Constructing LDPC codes by error minimization progressive edge growth [J]. IEEE Transactions on Communications, 2008, 56(3): 359-368.
[9] Fossorier M P C. Quasi-cyclic low-density parity-check codes from circulant permutation matrices [J]. IEEE Transactions on Information Theory, 2004, 50(8): 1788-1793.
[10] Hu X Y, Eleftheriou E, Arnold D M. Regular and irregular progressive edge growth Tanner graphs [J]. IEEE Transactions on Information Theory, 2005, 51(1): 386-398.
[11] Richardson T J, Urbanke R L. The capacity of low-density parity-check codes under message-passing decoding [J]. IEEE Transactions on Information Theory, 2001, 47(2): 599-618.
[12] Richardson T J, Urbanke R L. Efficient encoding of low-density parity-check codes [J]. IEEE Transactions on Information Theory, 2001, 47(2): 638-656.
Memo
- Memo:
-
Biographies: Liang Yuan(1990—), male, graduate; Zhang Shulin(corresponding author), male, master, associate professor, slzhang@seu.edu.cn.
Foundation item: The National Key Technology R& D Program of China during the 12th Five-Year Plan Period(No.2012BAH15B00).
Citation: Liang Yuan, Zhang Shulin, Gu Pinbiao, et al.Efficient construction and encoding of QC-LDPC codes by cyclic lifting of protographs[J].Journal of Southeast University(English Edition), 2015, 31(1):25-30.[doi:10.3969/j.issn.1003-7985.2015.01.005]