LDPC code reconstruction based on algorithm of finding low weight code-words

被引：0
|
作者：
Yu P.-D. [1 ]
Peng H. [1 ]
Gong K.-X. [1 ]
Chen Z.-L. [1 ]
机构：
[1] School of Information Systems Engineering, PLA Information Engineering University, Zhengzhou
来源：
| 2017年 / Editorial Board of Journal on Communications卷 / 38期
基金：
中国国家自然科学基金;
关键词：
Channel code reconstruction; Exponential distribution; LDPC code; Quasi-cyclic LDPC code;
D O I：
10.11959/j.issn.1000-436x.2017116
中图分类号：
学科分类号：
摘要：
LDPC code reconstruction without a candidate set is one of the tough problems in channel code reconstruction. First, theoretical analysis was provided for the number of received code-vectors needed for the reconstruction, and a lower bound was derived. Then, according to the lower bound, and based on an algorithm for finding low weight code-words, a new reconstruction method was proposed. It looked for low weight vectors one by one from the dual space of the received code-vector space and used them to reconstruct the sparse parity-check matrices. Number of iterations and the computational complexity of the method were analyzed based on exponential distribution theory. Under noise-free conditions, drawbacks of the existing method, including limited applicable range and large quantity of required data, have been overcame. Under noisy conditions, the proposed method has higher robustness against noise and relatively low complexity, compared to existing methods. For QC-LDPC codes, the reconstruction performance can be further improved using the quasi-cyclic property of their sparse parity-check matrices. © 2017, Editorial Board of Journal on Communications. All right reserved.
引用
收藏
页码：108 / 117
页数：9
相关论文
共 18 条
  • [1] Xie H., Huang Z.T., Wang F.H., Research progress of blind recognition of channel coding, Acta Electronica Sinica, 41, 6, pp. 1166-1176, (2013)
  • [2] Kuo Y.H., Zeng W.T., Chen J., Blind identification of primitive BCH codes parameters based on probability approximation, Journal of Electronics & Information Technology, 36, 2, pp. 332-339, (2014)
  • [3] Yu P.D., Li J., Peng H., A least square method for parameter estimation of RSC sub-codes of Turbo codes, IEEE Communications Letters, 18, 4, pp. 644-647, (2014)
  • [4] Liu J., Li J., Yu P.D., An iterative estimation method for random interleaver of Turbo codes, Journal on Communications, 36, 6, (2015)
  • [5] Ma Y., Zhang L.M., Reconstruction of scrambler with real-time test, Journal of Electronics & Information Technology, 38, 7, pp. 1794-1799, (2016)
  • [6] Mackay D., Good error-correcting codes based on very sparse matrices, IEEE Transactions on Information Theory, 45, 2, pp. 399-431, (1999)
  • [7] Wireless LAN medium access control (MAC) and physical layer (PHY) specifications amendment 5: enhancements for higher throughput, (2009)
  • [8] Xia T., Wu H.C., Novel blind identification of LDPC codes using average LLR of syndrome a posteriori probability, IEEE Transactions on Signal Processing, 62, 3, pp. 632-640, (2014)
  • [9] Yu P.D., Peng H., Li J., On blind recognition of channel codes within a candidate set, IEEE Communications Letters, 20, 4, pp. 736-739, (2016)
  • [10] Bao X., Zhou L.K., He K., Et al., A method of restructuring LDPC parity-check matrix, Journal of University of Electronic Science and Technology of China, 45, 2, pp. 191-196, (2016)
12