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

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

Abstract

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.

Key words: channel code reconstruction, LDPC code, quasi-cyclic LDPC code, exponential distribution

CLC Number:

TN911.7

Pei-dong YU,Hua PENG,Ke-xian GONG,Ze-liang CHEN. LDPC code reconstruction based on algorithm of finding low weight code-words[J]. Journal on Communications, 2017, 38(6): 108-117.

Figures/Tables 7

实验条件	文献[10]算法		本文算法
实验条件	$\bar{P}$	$\bar{N}$	$\bar{P}$	$\bar{N}$	T
第1组	100%	12	100%	4 185	2 630
第2组	33.5%	27	100%	6 748	2 630
第3组	0.5%	10	100%	42 026	16 580
第4组	5.3%	12	100%	4 986	1 854
第5组	0.2%	9	100%	18 182	6 799

References 18

[1]	解辉, 黄知涛, 王丰华 . 信道编码盲识别技术研究进展[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.
[2]	阔永红, 曾伟涛, 陈健 . 基于概率逼近的本原 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.
[3]	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.
[4]	刘骏, 李静, 于沛东 . 一种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.
[5]	马钰, 张立民 . 基于实时检测的扰码重建算法[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.
[6]	MACKAY D . Good error-correcting codes based on very sparse matrices[J]. IEEE Transactions on Information Theory, 1999,45(2): 399-431.
[7]	Wireless LAN medium access control (MAC) and physical layer (PHY) specifications amendment 5:enhancements for higher throughput[S]. IEEE Std.802.11n-2009, 2009.
[8]	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.
[9]	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.
[10]	包昕, 周磊砢, 何可 ,等. 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.
[11]	包昕, 周磊砢, 何可 ,等. 误码条件下的 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.
[12]	CLUZEAU M , . Block code reconstruction using iterative decoding techniques[C]// Proceedings of IEEE International Symposium on Information Theory Seattle. USA, 2006: 2269-2273.
[13]	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.
[14]	CLUZEAU M , TILLICH J P . On the code reverse engineering problem[C]// IEEE International Symposium on Information Theory. Toronto,Canada, 2008: 634-638.
[15]	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.
[16]	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.
[17]	李开丁 . 关于 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.
[18]	CHABOT C , . Recognition of a code in a noisy environment[C]// IEEE International Symposium on Information Theory. Nice,France, 2007: 2211-2215.

Metrics

Recommended 0

No Suggested Reading articles found!

实验条件	(n,k)	对角结构	对角位置	k′
第1组	(648,324)	双对角	已知	324
第2组	(648,324)	双对角	未知	324
第3组	(648,324)	双对角	已知	200
第4组	(1 008,504)	－	－	504
第5组	(1 008,504)	－	－	300

实验条件	(n,k)	p	误码字率	M	M_c
第1组	(1 008,504)	0.01	100%	1 008	60
第2组	(1 008,504)	0.005	99.6%	1 008	95
第3组	(1 008,504)	0.002	86.9%	1 008	200
第4组	(648,432)	0.001	48.2%	648	324
第5组	(648,432)	0.001	48.2%	500	324
第6组	(648,324)	0.002	72.1%	648	240
第7组	(648,324)	0.002	72.1%	500	240

实验结果	识别结果		译码效果
实验结果	N_c,2	P	p	误码字率
第1组	400	62.9%	6.3×10^?4	42.1%
第2组	100	76.4%	7.5×10^?5	6.2%
第3组	100	94.3%	0	0
第4组	100	60.7%	7.9×10^?5	4.8%
第5组	100	43.9%	3.5×10^?4	19.9%
第6组	100	69.6%	2.2×10^?4	12.7%
第7组	100	57.2%	4.5×10^?4	25.6%

实验条件	N_c,2
第1组	5.9
第2组	1.5
第3组	1.0
第4组	4.6
第5组	5.4
第6组	4.8
第7组	5.2

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

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 7

References 18

Related Articles 15

Metrics

Recommended 0

[1]	Ming ZHAO,Xiao-lin ZHANG. Novel construction of QC-LDPC codes with modified 2-D GRS codes [J]. Journal on Communications, 2015, 36(2): 193-199.
[2]	. Improved multi-bits flipping algorithm for high-speed LDPC decoding [J]. Journal on Communications, 2014, 35(2): 16-124.
[3]	Ke-xiang MA,Ji-cheng SUN,Meng WANG,Yu-ming ZHANG,Hai-lin ZHANG. Improved multi-bits flipping algorithm for high-speed LDPC decoding [J]. Journal on Communications, 2014, 35(2): 0-124.
[4]	Guang-hua HE,Bao-ming BAI,Xiao MA,Bing LI. Low-complexity likelihood probability derivation algorithm for non-binary LDPC-coded modulation system [J]. Journal on Communications, 2013, 34(9): 84-91.
[5]	Bo ZHANG,Wei LIN,Chun-yuan LIU,Bao-ming BAI. On the designand performance of nonbinary LDPC codes on burst errorchannels [J]. Journal on Communications, 2013, 34(7): 98-104.
[6]	. On the designand performance of nonbinary LDPC codes on burst errorchannels [J]. Journal on Communications, 2013, 34(7): 11-104.
[7]	Zi-qiang CHEN,Shan OUYANG,Hai-lin XIAO,Yue-lei XIE. Jointed LDPC codes design for half-duplex relay channels [J]. Journal on Communications, 2013, 34(3): 134-140.
[8]	Guo-hua ZHANG,Rong SUN,Xin-mei WANG. Explicit construction of girth-eight QC-LDPC codes and its application in CRT method [J]. Journal on Communications, 2012, 33(3): 171-176.
[9]	Rui-jia YUAN,Bao-ming BAI. Efficient storage method for FPGA-based partially parallel QC-LDPC decoder [J]. Journal on Communications, 2012, 33(11): 165-170.
[10]	Li-li ZHANG,Ze-mao ZHAO,Jian-rong BAO. Construct of QC-LDPC codes based on Z-shape and arithmetic progression sequence [J]. Journal on Communications, 2010, 31(8A): 117-121.
[11]	Jian-quan LIU,You-yun XU,Yue-ming CAI. Soft value flipping decoding algorithm for LDPC codes based on adjoint vectors sum [J]. Journal on Communications, 2009, 30(9): 60-68.
[12]	Guo-hua ZHANG,Xin-mei WANG. Applied quasi-cyclic LDPC codes from doubly-extended RS code and cyclic MDS code [J]. Journal on Communications, 2008, 29(6): 101-106.
[13]	Chun-guang YAO,Xin GE,Ying-nan LIU,Jian ZHANG. Construction of LDPC codes for higher burst-error detecting [J]. Journal on Communications, 2007, 28(11): 108-112.
[14]	Jin LI,Han HUA,Jing-yu HUA,Xiao-hu YOU. Analysis of stop criterions in the decoder of parallel concatenated LDPC codes [J]. Journal on Communications, 2006, 27(4): 95-100.
[15]	Yu-ling ZHANG,Dong-feng YUAN,HENGXiang C. New UEP mapping strategy in LDPC-coded modulation systems [J]. Journal on Communications, 2006, 27(12): 98-102.