高误码率下Turbo码交织器的恢复方法  

Reconstruction of Turbo-code Interleaver at High Bit Error Rate

作　　者：任亚博[1,2] 张健[2] 刘以农 

机构地区：[1]请华大学工程物理系,北京100084 [2]中国工程物理研究院电子工程研究所,绵阳621900

出　　处：《电子与信息学报》2015年第8期1926-1930,共5页Journal of Electronics & Information Technology

基　　金：NSAF基金(11176005)资助课题

摘　　要：该文提出了一种针对高误码条件下Turbo码交织器的恢复方法,应用于码率为1/3的并行级联Turbo码。信道编码识别是非合作信号处理领域的重要内容,Turbo码交织器的恢复是其中的一个难点。现有的识别方法可以有效地处理无误码时的问题,而实际通信中Turbo码经常应用于信道质量较差的情况,此时误码率会较高,且码长较长,这些方法将失效。利用校验向量的特征,可将交织器的每个位置分离开来,单独求解,使得交织器中每个位置的恢复仅依赖于几个相关的位置,避免了误码累加效应,从而解决了在高误码率,长码长时的识别问题,其复杂度较低。在仿真结果中,对典型的长度达10000的随机交织器,接收序列10%误码率的情况下,实现了正确的恢复。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码 交织器 恢复 

分 类 号：TN911.22[电子电信—通信与信息系统]