非收尾Turbo码交织器的识别方法

Recognition of unterminated Turbo-code interleaver

提出了一种对非归零Turbo码交织器的识别方法。二元域上某类有理式的级数展开具有周期性,从而可知,在同一个周期点上,来自信息序列上2个比特与相应交织位上的2个比特之和为0,进而可得到一种识别方法:第1步恢复出2个交织位置,此后每步恢复1个位置。根据周期长度的不同,算法被分成若干条并行链路,链路数即为周期长度。

An algorithm to recover an unterminated turbo-code interleaver is proposed. It is found that for some rational functions, their series are periodic, and then the sum of two bits from the info sequence and two bits from the corresponding interleaver sequence is 0. There comes out a recognition algorithm: two interleaved positions are recovered first; other positions would be recovered step by step. The algorithm is sliced into several lists, and the number equals to the period.