A proof of maximum contention-free property of interleavers for Turbo codes using permutation polynomials over integer rings

It is well known that interleavers play a critical role in Turbo coding/decoding schemes, and contention-free interleaver design has become a serious problem in the paraUelization of Turbo decoding, which is indispensable to meet the demands for high throughput and low latency in next generation mobile communication systems. This paper unveils the fact that interleavers based on permutation polynomials modulo N are contention-free for every window size W, a factor of the intedeaver length N, which, also called maximum contention-free interleavers.

基于OFDM移动多媒体通信系统中BITCM的评估

针对基于OFDM(OrthorgonalFrequencyDivisionMultiplexing)未来移动多媒体通信系统中的BITCM(Bit-InterleavedTurbo-CodedModulation)的性能进行了评估,经研究发现,对于移动多媒体通信系统中通常采用帧的大小,在有效的信噪比区域内,Turbo编码的约束长度的增加并不一定会给BITCM的性能带来大的改善,相反,在某些情况下它还有可能导致性能的降低。笔者从Turbo码的重量分布角度对这种现象给出了解释,而且从性能评估结果中得出结论,对基于OFDM的移动多媒体通信系统的BITCM,在约束长度为4时具有最好的性能与复杂度之间的转换特性。