Turbo编译器中交织器的选择

本文探讨了Ｔｕｒｂｏ编译码器中交织器的选择问题,首先从Ｔｕｒｂｏ码的并行级联编码九基于最大后验概率（ＭＡＰ）算法的迭代译码原理出发分析了交织器对Ｔｕｒｂｏ码的纠错性能的巨大影响,然后总结了Ｔｕｒｂｏ码中交织器设计的一些基本埋头工作春各自特点,最后给出了Ｔｕｒｂｏ码中有关交织器的实用性结论。     

Turbo码中交织器和子码的综合设计

分析了距离谱和交织器结构对 Ｔｕｒｂｏ码性能的影响，介绍了高斯信道中一种新的 Ｔｕｒｂｏ码设计方法。该方法对交织器及子码进行综合设计，并给出了交织器的设计方法。仿真结果表明，通过交织器和子码的综合设计可以获得优异的误比特率性能。     

Turbo码综合性能分析与Turbo编码调制

对 Ｔｕｒｂｏ码的 ＲＳＣ分量码、交织器、调制方式、信道以及迭代译码算法进行了综合研究与性能分析，并给出了一种基于逐比特ＭＡＰ算法的Ｔｕｒｂｏ编码与多元调制相结合的编码调制方式。仿真结果表明，该方案将Ｔｕｒｂｏ码的高编码增益与多元调制的高频谱利用率有效地结合在一起，是一种功率和频谱高效的编码调制方式，比传统的ＴＣＭ方式有更好的性能。     

Turbo码系统中交织器的设计

Ｔｕｒｂｏ码由于很好地应用了香农信道编码定理中的随机性编译码条件而获得了几乎接近香农理论发的性能。其中编、译码过程中交织器的设计是实现随机性的核心。本文主要介绍了分块交织器和伪随机交织器的设计,并提出一种两者相结合的新的交织器类型。根据仿真结果,从理论上分析了三种交织的优缺点及在不同通信领域中应用Ｔｕｒｂｏ码时选取交织器的原则。     

基于卷积面向分组Turbo码的交织器研究

交织器是影响Ｔｕｒｂｏ码性能的重要因素．本文提出一种适用于基于卷积面向分组Ｔｕｒｂｏ码的交织器构造方法,并由此给出一种简单实用的交织方案,模拟实验表明该交织方案性能良好．     

设计低资源需求的短帧Turbo码交织器

本文叙述在Ｔｕｒｂｏ码交织器中低资源需求的问题,讨论了低资源需求交织器的设计原则,分析了采用所设计交织器的距离谱和误码率特性,报告了在ＦＰＧＡ上综合布线的结果,结果表明该交织器性能较好,易于在专用集成电路上实现。     

Turbo码中快速交织器的设计

分析了交织器在Ｔｕｒｂｏ码中的重要作用，以及目前交织器存在的缺陷，介绍了一种快速交织器的设计方法。该交织器易于实现，具有交织时延低的突出优点。计算机仿真结果表明，该快速交织器可以获得优异的性能。     

Turbo码随机性交织器设计

深空测控中为获得较高的编码增益需要用到信道编译码技术。Turbo码是一种逼近香农限的高性能的信道编译码,其中,交织器的设计是影响Turbo码性能的关键因素之一。论述了交织器设计的基本准则,并详细介绍了3种常见的随机性交织器:伪随机交织器、S随机交织器和S改进型交织器的交织原理,对比分析了3种交织器的优缺点并给出了仿真结果。结果表明,交织器生成方式的不同将带来不同的Turbo码译码性能。     

改进的TurbO码算法的FPGA实现

本文提出一种使用ＦＰＧＡ实现改进的Ｔｕｒｂｏ码算法的方法。在选用改进的最优周期交织序列的交织器和ＳＩＳＯ(软输入软输出)译码器的Ｍａｘ－Ｌｏｇ－ＭＡＰ译码算法的硬件实现过程中,采用“自上而下” 和“自下而上”相结合的设计方法。在采用并行算法的同时巧妙地改变前向矢量的计算顺序,减少了占用的硬件资源。整个设计在ＭＡＸ＋ＰＬＵＳⅡ软件环境下仿真的结果表明,本设计实现的改进的Ｔｕｒｂｏ码编码/译码器具有良好的误码性能和较高的实用价值。     

一种具有低相关特性的分块交织器的设计

Ｔｕｒｂｏｃｏｄｅｓ是近年信道编码理论研究的热点课题。交织器的设计问题是Ｔｕｒｂｏｃｏｄｅｓ研究中的主要问题之一。本文结合Ｔｕｒｂｏｃｏｄｅｓ在个人通信中的应用问题，对分块交织方法进行了研究，给出了一种新的交织器的设计方案，理论分析和计算机仿真证实了此方案在实现上和相关性上都具有良好的性能。同时，本文从理论上解释了在交织长度很大时，交织器的选择对Ｔｕｒｂｏｃｏｄｅｓ译码性能几乎没有影响的原因。     

Multilevel turbo coding with short interleavers

The impact of the interleaver, embedded in the encoder for a parallel concatenated code, called the turbo code, is studied. The known turbo codes consist of long random interleavers, whose purpose is to reduce the value of the error coefficients. It is shown that an increased minimum Hamming distance can be obtained by using a structured interleaver. For low bit-error rates (BERs), we show that the performance of turbo codes with a structured interleaver is better than that obtained with a random interleaver. Another important advantage of the structured interleaver is the short length required, which yields a short decoding delay and reduced decoding complexity (in terms of memory). We also consider the use of turbo codes as component codes in multilevel codes. Powerful coding structures that consist of two component codes are suggested. Computer simulations are performed in order to evaluate the reduction in coding gain due to suboptimal iterative decoding. From the results of these simulations we deduce that the degradation in the performance (due to suboptimal decoding) is very small     

KBturbo码中交织器的设计

已知比特(KB,Known Bits)turbo码是采用将KB周期性的插入到信息比特中,不显著增加系统复杂程度而较大提高turbo码译码性能。但因为一般采用了随机交织器,所以在引入KB方法时,产生了不等差错保护的问题。这个问题可以通过采用KB交织器,将KB在交织器中均匀分配来解决。仿真证实,以伪随机交织器和S随机交织器为基础的KB交织器可以显著提高系统性能。而且采用KB turbo码可以方便地实现速率适配,满足第三代移动通信系统的要求。     

Comparison of iterative decoder performance with union bounds for short frame turbo codes

We consider short frame turbo codes, suitable for delay-sensitive services such as conversational speech, or for encoding single ATM cells. We compare the uniform interleaver bound of Benedetto and Montorsi, and a union bound obtained by estimating the weight distribution due to the actual pseudo-random interleaver, with the simulated BER using an iterative decoder. We show that the uniform interleaver bound is significantly pessimistic at high SNR, where the random interleaver union bound is quite close. However, at lower SNR the ber exceeds the union bound, showing that it does not achieve ml decoding. We also consider half rate turbo codes formed by puncturing various proportions of the data and parity sequences, and adapt the uniform interleaver bounds for these codes. We show that while the union bounds predict better performance for data-punctured codes, in practice they perform better only at high snr and for limited proportions of data puncturing.     

Combined turbo codes and interleaver design

The impact of the distance spectrum and interleaver structure on the bit error probability of turbo codes is considered. A new turbo code design method for Gaussian channels is presented. The proposed method combines a search for good component codes with interleaver design. The optimal distance spectrum is used as the design criterion to construct good turbo component codes at low signal-to-noise ratios (SNRs). In addition, an interleaver design method is proposed. This design improves the code performance at high SNR. Search for good component codes at low SNR is combined with a code matched interleaver design. This results in new turbo codes with a superior error performance relative to the best known codes at both low and high SNR. The performance is verified by both analysis and simulation     

Improved upper bounds on the ML decoding error probability ofparallel and serial concatenated turbo codes via their ensemble distancespectrum

The ensemble performance of parallel and serial concatenated turbo codes is considered, where the ensemble is generated by a uniform choice of the interleaver and of the component codes taken from the set of time-varying recursive systematic convolutional codes. Following the derivation of the input-output weight enumeration functions of the ensembles of random parallel and serial concatenated turbo codes, the tangential sphere upper bound is employed to provide improved upper bounds on the block and bit error probabilities of these ensembles of codes for the binary-input additive white Gaussian noise (AWGN) channel, based on coherent detection of equi-energy antipodal signals and maximum-likelihood decoding. The influence of the interleaver length and the memory length of the component codes is investigated. The improved bounding technique proposed here is compared to the conventional union bound and to a alternative bounding technique by Duman and Salehi (1998) which incorporates modified Gallager bounds. The advantage of the derived bounds is demonstrated for a variety of parallel and serial concatenated coding schemes with either fixed or random recursive systematic convolutional component codes, and it is especially pronounced in the region exceeding the cutoff rate, where the performance of turbo codes is most appealing. These upper bounds are also compared to simulation results of the iterative decoding algorithm     

Performance Bounds for Unequal Error Protecting Turbo Codes

In many communications systems, data can be divided into different importance levels. For these systems, unequal error protection (UEP) techniques are used to guarantee lower BER for the more important classes. In particular, if the precise characteristics of the channel are not known, UEP can be used to recover the more important classes even in poor receiving conditions. In this paper, we derive bounds on the performance of unequal error protecting turbo codes. These bounds serve as an important tool in predicting the performance of these codes. In order to derive the bounds, we introduce the notion of UEPuniform interleaver which is a random interleaver that does not change the order of classes in the turbo code frame. We also present a method to derive the weight enumerating function for UEP turbo codes.     

Interleaver design for turbo codes

The performance of a turbo code with short block length depends critically on the interleaver design. There are two major criteria in the design of an interleaver: the distance spectrum of the code and the correlation between the information input data and the soft output of each decoder corresponding to its parity bits. This paper describes a new interleaver design for turbo codes with short block length based on these two criteria. A deterministic interleaver suitable for turbo codes is also described. Simulation results compare the new interleaver design to different existing interleavers     

Recent Advances in Turbo Code Design and Theory

The discovery of turbo codes and the subsequent rediscovery of low-density parity-check (LDPC) codes represent major milestones in the field of channel coding. Recent advances in the design and theory of turbo codes and their relationship to LDPC codes are discussed. Several new interleaver designs for turbo codes are presented which illustrate the important role that the interleaver plays in these codes. The relationship between turbo codes and LDPC codes is explored via an explicit formulation of the parity-check matrix of a turbo code, and simulation results are given for sum product decoding of a turbo code.