基于寻找小重量码字算法的LDPC码开集识别

于沛东; 彭华; 巩克现; 陈泽亮

doi:10.11959/j.issn.1000-436x.2017116

您当前的位置：

首页 >

文章列表页 >

基于寻找小重量码字算法的LDPC码开集识别

学术论文 | 更新时间：2024-06-05

- 基于寻找小重量码字算法的LDPC码开集识别
- LDPC code reconstruction based on algorithm of finding low weight code-words
- 通信学报 2017年38卷第6期页码：108-117
- 作者机构：
  
  解放军信息工程大学信息系统工程学院，河南郑州 450001
- 作者简介：
  
  [ "于沛东（1989-），男，湖南慈利人，解放军信息工程大学博士生，主要研究方向为信道编码及其识别分析。" ]
  [ "彭华（1973-），男，江西萍乡人，解放军信息工程大学教授、博士生导师，主要研究方向为软件无线电、通信信号处理等。" ]
  [ "巩克现（1976-），男，山东泰安人，解放军信息工程大学副教授、硕士生导师，主要研究方向为软件无线电、信道编码等。" ]
  [ "陈泽亮（1992-），男，湖南岳阳人，解放军信息工程大学硕士生，主要研究方向为信道编码识别分析。" ]
- 基金信息：
  
  国家自然科学基金资助项目(61401511)
- DOI：10.11959/j.issn.1000-436x.2017116
  中图分类号： TN911.7
- 网络出版日期：2017-06，
  
  纸质出版日期：2017-06-25
- 稿件说明：
移动端阅览
于沛东, 彭华, 巩克现, 等. 基于寻找小重量码字算法的LDPC码开集识别[J]. 通信学报, 2017,38(6):108-117.

Pei-dong YU, Hua PENG, Ke-xian GONG, et al. LDPC code reconstruction based on algorithm of finding low weight code-words[J]. Journal on communications, 2017, 38(6): 108-117.
于沛东, 彭华, 巩克现, 等. 基于寻找小重量码字算法的LDPC码开集识别[J]. 通信学报, 2017,38(6):108-117. DOI： 10.11959/j.issn.1000-436x.2017116.

Pei-dong YU, Hua PENG, Ke-xian GONG, et al. LDPC code reconstruction based on algorithm of finding low weight code-words[J]. Journal on communications, 2017, 38(6): 108-117. DOI： 10.11959/j.issn.1000-436x.2017116.

摘要

LDPC码的开集识别是信道编码识别领域的一个难点。首先，对实现开集识别所需接收码向量的数量进行了分析，给出了其理论下界。然后，根据这一下界，基于寻找小重量码字的算法，提出了一种新的LDPC码开集识别方法。该方法在接收码向量空间的对偶空间中逐个寻找小重量向量，即待识别的稀疏校验向量，从而重建稀疏校验矩阵。利用指数分布对迭代次数进行建模，给出了该方法的迭代停止准则及运算量分析。在无误码条件下，新方法克服了已有方法在适用范围和所需数据量的局限。在有误码条件下，与已有方法相比，在提高抗误码能力的同时保持较低的运算复杂度，更能满足实际应用的需求。对于QC-LDPC码，利用其稀疏校验矩阵的准循环特性，可以显著提高识别性能。

Abstract

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.

关键词

Keywords

references

解辉 , 黄知涛 , 王丰华 . 信道编码盲识别技术研究进展 [J ] . 电子学报 , 2013 , 41 ( 6 ): 1166 - 1176 .

XIE H , HUANG Z T , WANG F H . Research progress of blind recognition of channel coding [J ] . Acta Electronica Sinica , 2013 , 41 ( 6 ): 1166 - 1176 .

阔永红 , 曾伟涛 , 陈健 . 基于概率逼近的本原 BCH 码编码参数的盲识别方法 [J ] . 电子与信息学报 , 2014 , 36 ( 2 ): 332 - 339 .

KUO Y H , ZENG W T , CHEN J . Blind identification of primitive BCH codes parameters based on probability approximation [J ] . Journal of Electronics ＆Information Technology , 2014 , 36 ( 2 ): 332 - 339 .

YU P D , LI J , PENG H . A least square method for parameter estimation of RSC sub-codes of Turbo codes [J ] . IEEE Communications Letters , 2014 , 18 ( 4 ): 644 - 647 .

刘骏 , 李静 , 于沛东 . 一种Turbo码随机交织器的迭代估计方法 [J ] . 通信学报 , 2015 , 36 ( 6 ):2015140.

LIU J , LI J , YU P D . An iterative estimation method for random interleaver of Turbo codes [J ] . Journal on Communications , 2015 , 36 ( 6 ):2015140.

马钰 , 张立民 . 基于实时检测的扰码重建算法 [J ] . 电子与信息学报 , 2016 , 38 ( 7 ): 1794 - 1799 .

MA Y , ZHANG L M . Reconstruction of scrambler with real-time test [J ] . Journal of Electronics ＆Information Technology , 2016 , 38 ( 7 ): 1794 - 1799 .

MACKAY D . Good error-correcting codes based on very sparse matrices [J ] . IEEE Transactions on Information Theory , 1999 , 45 ( 2 ): 399 - 431 .

Wireless LAN medium access control (MAC) and physical layer (PHY) specifications amendment 5:enhancements for higher throughput [S ] . IEEE Std.802.11n-2009 , 2009 .

XIA T , WU H C . Novel blind identification of LDPC codes using average LLR of syndrome a posteriori probability [J ] . IEEE Transactions on Signal Processing , 2014 , 62 ( 3 ): 632 - 640 .

YU P D , PENG H , LI J . On blind recognition of channel codes within a candidate set [J ] . IEEE Communications Letters , 2016 , 20 ( 4 ): 736 - 739 .

包昕 , 周磊砢 , 何可 , 等 . LDPC码稀疏校验矩阵的重建方法 [J ] . 电子科技大学学报 , 2016 , 45 ( 2 ): 191 - 196 .

BAO X , ZHOU L K , HE K , et al . A method of restructuring LDPC parity-check matrix [J ] . Journal of University of Electronic Science and Technology of China , 2016 , 45 ( 2 ): 191 - 196 .

包昕 , 周磊砢 , 何可 , 等 . 误码条件下的 LDPC 码盲识别算法 [J ] . 西安交通大学学报 , 2015 , 49 ( 12 ): 53 - 58 .

BAO X , ZHOU L K , HE K , et al . A recognition algorithm for LDPC codes of blind in a noisy environment [J ] . Journal of Xi’an Jiaotong University , 2015 , 49 ( 12 ): 53 - 58 .

CLUZEAU M , . Block code reconstruction using iterative decoding techniques [C ] // Proceedings of IEEE International Symposium on Information Theory Seattle . USA , 2006 : 2269 - 2273 .

CLUZEAU M , FINIASZ M . Recovering a code’s length and synchronization from a noisy intercepted bit-stream [C ] // IEEE International Symposium on Information Theory . Seoul,Korea , 2009 : 2737 - 2741 .

CLUZEAU M , TILLICH J P . On the code reverse engineering problem [C ] // IEEE International Symposium on Information Theory . Toronto,Canada , 2008 : 634 - 638 .

CANTEAUT A , CHABAUD F . A new algorithm for finding minimum weight words in a linear codes:application to primitive narrow-sense BCH codes of length 511 [J ] . IEEE Transactions on Information Theory , 1998 , 44 ( 1 ): 367 - 378 .

CHEN L , XU J , DJURDJEVIC I , et al . Near-Shannon-limit quasi-cyclic low-density parity-check codes [J ] . IEEE Transactions on Communications , 2004 , 52 ( 7 ): 1038 - 1042 .

李开丁 . 关于 n 个独立同分布的指数分布的最值问题的期望和方差 [J ] . 大学数学 , 2005 , 21 ( 4 ): 125 - 127 .

LI K D . About the mean and variance of the maximum and minimum of n independent exponential distributed random variables [J ] . College Mathematics , 2005 , 21 ( 4 ): 125 - 127 .

CHABOT C , . Recognition of a code in a noisy environment [C ] // IEEE International Symposium on Information Theory . Nice,France , 2007 : 2211 - 2215 .

浏览量

768

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

用于LDPC码快速译码的改进多比特翻转算法

基于FPGA的部分并行QC-LDPC译码器高效存储方法

利用双重扩展RS码及循环MDS码构造实用化的LDPC码

基于伴随向量和的软值翻转LDPC译码算法