Reconstruction of Turbo-code Interleaver at High Bit Error Rate
Ren Ya-bo①② Zhang Jian② Liu Yi-nong①
①(Department of Engineering Physics, Tsinghua University, Beijing 100084, China) ②(Institute of Electronic Engineering, China Academy of Engineering Physics, Mianyang 621900, China)
An algorithm to recover a Turbo-code interleaver is proposed at high Bit Error Rate (BER), and it is applied to the 1/3 parallel concatenated Turbo-code. The recognition of channel coding plays an important part in the field of non-cooperative signal processing; recovering a Turbo-code interleaver is one difficulty. There are already some effective algorithms for the noiseless condition, but in actual communication system, Turbo code is often used in a high noisy level, where the BER is high and the word length is long: these algorithms would be ineffective. Using the characteristic of the parity-heck vector, each position of the interleaver can be separated and solved independently. Thus, it makes the recovery of every position only rely on several correlative positions, which avoids the error accumulation effect. The algorithm solves the problem when the BER is high and the code length is long, and it also has low complexity. Simulations show that for a Turbo code with interleaver length 10000 and BER 10%, the algorithm runs successfully.
任亚博,张健,刘以农. 高误码率下Turbo码交织器的恢复方法[J]. 电子与信息学报, 2015, 37(8): 1926-1930.
Ren Ya-bo, Zhang Jian, Liu Yi-nong. Reconstruction of Turbo-code Interleaver at High Bit Error Rate. JEIT, 2015, 37(8): 1926-1930.
Xie Hui, Huang Zhi-tao, and Wang Feng-hua. Research progress of blind recognition of channel coding[J]. Acta Electronica Sinica, 2013, 41(6): 1166-1176.
[2]
Moosavi R and Larsson E G. A fast scheme for blind identification of channel codes[C]. IEEE Global Telecommunications Conference 2011, Linkoping, Sweden, 2011: 1-5.
[3]
Bringer J and Chabanne H. Code reverse engineering problem for identification codes[J]. IEEE Transactions on Information Theory, 2012, 58(4): 2406-2412.
[4]
闫郁翰. 信道编码盲识别技术研究[D]. [硕士论文], 西安电子科技大学, 2012.
[5]
Marazin M, Gautier R, and Burel G. Algebraic method for blind recovery of punctured convolutional encoders from an erroneous bitstream[J]. IET Signal Processing, 2012, 6(2): 122-131.
Yu Pei-dong, Li Jing, and Peng Hua. A new algorithm for channel coding recognition using soft decision[J]. Acta Electronica Sinica, 2013, 41(2): 301-306.
Liu Jian-cheng and Yang Xiao-jing. Blind recognition of (2,1,m) convolutional code based on parity-check Statistics[J]. Electronic Information Warfare Technology, 2013, 28(1): 1-4.
[8]
Karimian Y and Attari M A. Recognition of channel encoder parameters from intercepted bitstream[C]. IEEE 2013 21st Iranian Conference on Electrical Engineering (ICEE), Mashhad, 2013: 1-5.
[9]
Moosavi R and Larsson E G. Fast blind recognition of channel codes[J]. IEEE Transactions on Communications, 2014, 62(5): 1393-1405.
[10]
Barbier J. Reconstruction of Turbo-code encoders[J]. SPIE, 2005, 5819: 463-473.
[11]
Cluzeau M, Finiasz M, and Tillich J P. Methods for the reconstruction of parallel Turbo codes[C]. IEEE International. Symposium on Information Theory, Austin, TX, USA, 2010: 2008-2012.
[12]
Cote M and Sendrier N. Reconstruction of a Turbo-code interleaver from noisy observation[C]. IEEE International Symposium on Information Theory, Austin, TX, USA, 2010: 2003-2007.
Li Xiao-tian, Li Yan-bin, Zan Jun-jun, et al.. An algorithm for recognition of Turbo code length based on matrix analysis[J]. Radio Engineering of China, 2012, 42(4): 23-26.
Li Xiao-tian, Zhang Run-sheng, and Li Yan-bin. Research on the recognition algorithm of Turbo codes on trellis termination[J]. Journal of Xidian University, 2013, 40(4): 161-166.
[16]
Valembois A. Detection and recognition of a binary linear code[J]. Discrete Applied Mathematics, 2001, 111(1): 199-218.
