新型(2k, k, 1)卷积码的构造

doi:10.3969/j.issn.1000-436x.2014.06.026

Journal on Communications ›› 2014, Vol. 35 ›› Issue (6): 200-206.doi: 10.3969/j.issn.1000-436x.2014.06.026

• Academic communication • Previous Articles

Construction of a new class of (2k, k, 1) convolutional codes

Cheng-chang ZHENG^1,²,Wan-quan PENG³,Bo WEI²

¹ College of Electroning Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
² Laboratory of Aerocraft Tracking Telemetering ＆Command and Communication,Ministry of Education, Chongqing University, Chongqing 400030, China
³ Chongqing Vocational Institute of Engineering; Chongqing 400037, China

Online:2014-06-25 Published:2017-06-29
Supported by:
The National Natural Science Foundation of China;The Natural Science Foundation of Chongqing;The Fundamental Research Funds for the Central Universities;The Fundamental Research Funds for the Central Universities

Abstract

Abstract:

A new class of (2k,k,1) convolutional codes are created by combining double cyclic codes and (2,1,1) convolu-tional codes, and also a new method for creation long codes with short ones was proposed. The structural mechanism of the codes was revealed by defining a state transition matrix and using algebraic method as well as grille graph. This code structure was excellent in both proportionality and diversity, besides, the distance characteristics of it are also quite well. Simulation results show that, the (2k,k,1) convolutional codes present some advantages over the traditional one in error correction performance and decoding speed.

Key words: convolutional codes, state transition matrix, viterbi decoding

Cheng-chang ZHENG,Wan-quan PENG,Bo WEI. Construction of a new class of (2k, k, 1) convolutional codes[J]. Journal on Communications, 2014, 35(6): 200-206.

Figures/Tables 7

References 13

[1]	ROBINSON J , BERNSTEIN A . A class of binary recurrent codes with limited error propagation[J]. IEEE Transactions on Informational The-ory, 2011.250-267.
[2]	MASSEY J , COSTLLO D . Nonsystematic convolutional codes for sequential decoding in space applications[J]. IEEE Transactions on Communication Theory, 1971,19(5): 806-813.
[3]	BRIAN C . Complementary punctured-pair convolutional codes for digital audio broadcasting[J]. IEEE Transactions on Communication Theory, 2000,48(11): 1829-1839.
[4]	林舒 . 差错控制编码[M]. 北京：机械工业出版社, 2007.384-394. LIN S . Error Control Coding[M]. Beijing: China Machine Press, 2007.384-394.
[5]	BERROU C , GLAVIEUX A . Near optimum error correcting coding and decoding: turbo-codes[J]. IEEE Transactions on Communication Theory, 1996,44(10): 1261-1271.
[6]	TANNER R M , SRIDHARA D , et al. LDPC block and convolutional codes based on circulant matrices[J]. IEEE Transactions on Informa-tional Theory, 2004,50(12): 2966-2984.
[7]	KATSIOTIS A , RIZOMILIOTIS P , et al. New constructions of high-performance low-complexity convolutional codes[J]. IEEE Transactions on Informational Theory, 2010,58(7): 1950-1961.
[8]	PUSANE A E , SMARANDACHE R , et al. Deriving good LDPC convolutional codes from LDPC block codes[J]. IEEE Transactions on Informational Theory, 2011,57(2): 835-857.
[9]	柏鹏，张凤鸣李俊涛 . 一种新的卷积码自由距离计算方法[J]. 弹箭与制导学报， 2005,25(2): 415-417. BAI P , ZHANG F M , LI J T . A new algorithm for computing free dis-tances of convolutional codes[J]. Journal of Projectiles, Rockets, Mis-siles and Guidance, 2005,25(2): 415-417.
[10]	王新梅 . 纠错码-原理与方法[M]. 西安：西安电子科技大学出版社, 2001. WANG X M . Error Correcting Codes-Princip1e and Method[M]. Xi'an: Xidian University Press, 2001.
[11]	彭万权，伍小兵，张承畅 . 一种维特比译码器的矩阵实现方案[J]. 电路与系统学报， 2012,17(3): 115-120. PENG W Q , WU X B , ZHANG C C . A matrix implementation scheme of viterbi decoder[J]. Journal of Circuits and Systems, 2012,17(3): 115-120.
[12]	SUN F , ZHANG T . Low-power state-parallel relaxed adaptive viterbi decoder[J]. IEEE Transactions on Circuits and Systems, 2007,54(5): 1060-1068.
[13]	彭万权，冯文江 . 乘积码基于相关运算的迭代译码[J]. 电路与系统学报， 2006,11(4): 26-30. PENG W Q , FENG W J . A new iterative decoding for product codes with correlation operation[J]. Journal of Circuits and Systems, 2006,11(4): 26-30.

Metrics

Recommended 0

No Suggested Reading articles found!

信息位(k)	P矩阵	最小距离
2	[1 2]	2
3	[3 5 6]	3
4	[13 15 16 7]	4
5	[7 23 31 34 16]	4
6	[16 7 43 61 70 34]	4
7	[154 66 33 146 63 131]	4
8	[164 72 35 216 107 243 321 350]	5

k=l	(2k, k, 1)	(2, 1, l)
2	1.8×10⁷	4.8×10⁶
3	1.7×10⁷	4.9×10⁶
4	1.6×10⁷	4.2×10⁶
5	1.1×10⁷	3.8×10⁶
6	6.4×10⁶	2.9×10⁶
7	5.6×10⁶	2.6×10⁶
8	2.2×10⁶	1.3×10⁶

Construction of a new class of (2k, k, 1) convolutional codes

RichHTML

PDF

Knowledge

Cited

Abstract

Cite this article

share this article

Figures/Tables 7

References 13

Related Articles 4

Metrics

Recommended 0

[1]	. Construction of a new class of (2k, k, 1) convolutional codes [J]. Journal on Communications, 2014, 35(6): 26-206.
[2]	Xiao-ling HUANG,Hua-long YANG. Research of fast decoding for longer constraint length convolutional codes [J]. Journal on Communications, 2010, 31(3): 57-64.
[3]	Hai-xian ZHOU,Guo-liang XU,Wei YAO. Novel decoding of convolutional codes for OCDMA system [J]. Journal on Communications, 2009, 30(3): 89-92.
[4]	Xiao-zheng SONG,Lu LIU,An-hong DANG,Jun-xiong TANG. Study on new scheme of byte-wise interleaving and convolutional coding for high-data-rate optical wireless communication system [J]. Journal on Communications, 2007, 28(10): 38-43.