确定性交织器的研究

本文分析了交织器在turbo码中的重要作用，以及随机交织器存在的缺陷，并提出了一种确定性交织器的设计方法。该交纪念品器具有简明的解析表达式，易于实现。计算机仿真结果表明，该确定交织器可以获得的性能优于随机交织器的平均性能。     

衰落信道中结合短帧交织的Turbo码的研究

Turbo码作为信道编码方案,可以获得较高的误比特性能,而交织器的设计是影响Turbo码性能的关键环节。在码的重量分析的基础上,借用稀疏矩阵概念,对S型随机交织器进行改进,提出了一种短帧交织器的设计原则,它可以减少低重量码的数量,从而提高Turbo码的性能。     

直升机卫星通信系统中Turbo码外交织器设计与仿真

在直升机卫星通信系统(HSCS)中,如何克服由于旋翼遮挡导致的系统性能恶化是一个亟需解决的关键问题。旋翼遮挡相当于对码字信息的成片删除,通过分析删余Turbo码中删余矩阵的设计准则,首先对Turbo码的编码结构进行改进,并提出了一种适用于直升机旋翼遮挡环境下的交织器。它满足以下特性:将删除均匀分散在整个码字序列中,变突发错误为随机错误;码字中每个信息位与其对应的2比特校验位中最多只删1位;与被删比特组相邻的两个比特组保留;删除部分中以信息位-校验位1-校验位2的模式循环,这些特性保证了删除信息的可靠恢复。最后对不同遮挡比例下新型交织器与传统交织器进行仿真比较,结果表明采用新型交织器改善了数据传输的误码率(BER)性能,提高了HSCS系统的可靠性。     

改进交织的单层极化码高阶编码调制系统

极化码作为一种新型编码方式,被采纳为5G通信中的短码方案。本文将极化码应用到比特交织编码调制（Bit-Interleaved Coded Modulation,BICM）系统,优化交织器的设计,提出了一种新型交织算法。相比于现有的交织算法,新型交织算法的提出是基于比特信道可靠性衡量参数,将高可靠性的比特信道与低可靠性的比特信道交错设计,按照高可靠性信道对低可靠性信道辅助译码的方式,提高极化码的纠错性能。由于新型交织算法只存在于比特信道可靠度参数的简单排序,在复杂度上没有明显增加。仿真结果表明:新型交织算法具有优异的性能,当误码率为10-5,码长为256时,采用新型交织算法的极化码BICM系统与LDPC码的BICM系统相比大约有1.51 dB的增益。      

一种基于递归系统卷积码校验重量下限的匹配交织器设计方法

针对短帧Turbo码中交织器优化设计问题,提出了一种基于递归系统卷积码(RSC)校验重量下限的匹配交织器设计方法.文中重新分析了Turbo码中"局部坏点"具体形式,然后提出并证明了一种估计RSC分量码校验序列重量下限的方法,并将其应用于交织器映射方式优选时局部坏点对应Turbo码字重量下限估计,只有能够保证所有局部坏点对应码字重量的交织方法才被认为合法.仿真表明,与几种现有交织器设计方法相比,本文提出的匹配交织器设计方法性能更加优良,可以有效改善Turbo码的误比特性能.     

Turbo码结合已知比特的不等保护方案设计

交织器的引入使Turbo码对不同信息位具有明显的不等保护特性,从而对其性能产生影响。为了提高Turbo码译码性能,在给定的S距离伪随机交织器下,首先通过对多组随机输入信息序列的位误比特率仿真分析,找到对Turb0码性能影响较大的关键比特位置,然后在对Turbo码不等保护特性和已知比特Turbo码进行理论分析和研究的基础上,提出了关键比特不等保护和结合已知比特的Turbo码不等保护两种方案。最后,对提出的方案进行了仿真验证,结果表明在交织长度分别为200和400两种条件下,两种保护方案在高信噪比时与未保护相比均有0．2dB以上增益．且结合已知比特的Turbo码不等保护方案比关键比特保护方案性能更优。     

基于短帧交织的Turbo码编码器研究

本文分析了Turbo码编码器及其输出码字的组成原理,基于使输出码字最小汉明重量最大化和使最小汉明重量输出码字出现的概率最小化的原则,结合结构化交织器和随机交织器的优点,提出了一种伪随机的结构化反块交织器,并进一步提出了采用双伪随机反块交织器的Turbo码编码器方案.该方案有效的增大了Turbo码输出码字的最小汉明距离,同时避免了Turbo码边缘效应且具有伪随机性,因此,可有效的提高系统的纠错性能.仿真实验结果显示,该方案在短帧传输的条件下有着最佳的综合性能.特别是在信噪比高时,采用该方案与采用其它交织器的Turbo码方案相比,在提高系统的可靠性上具有明显的优势.     

紫外光通信QPP交织器研究

交织器是Turbo码的重要组成部分,它可以有效地提高Turbo码在整个通信系统中的性能.依据S随机交织器的设计思想,运用计算机搜索的方法,提出了一种具有最大S距离的二次转换多项式(SQPP)的搜索算法,并在紫外光通信多次散射信道中对SQPP交织器的性能进行了仿真和分析,最后得出了适合紫外光通信的SQPP交织器的参数.     

一种适用于空分复用MIMO系统的迭代检测器

本文在比特交织turbo编码调制的空分复用M IMO系统发送框架下,研究了一类与Turbo码的迭代译码联合进行的软干扰抵消迭代检测算法。在首次检测中,使用了基于匹配滤波(M F)的多级串行软干扰抵消方法,在后续的检测中使用了单级并行软干扰抵消方法。本文又把迭代检测同turbo码的迭代译码联合,大大降低了每次联合检测turbo译码需要的迭代译码次数。     

具有UEP特性的Turbo码图像传输技术研究

文中对Turbo码的编译码结构做出改进,采用不同的turbo码交织器和解交织器、不同的译码算法以及不同的迭代译码次数,根据图像各部分数据的重要性不等的特性,给出了一种新的不等错误保护（UEP）方案。仿真结果表明,该方案提高了图像的传输质量,降低了系统的传输时延。     

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     

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     

The Effect of Block Interleaving in an LDPC‐Turbo Concatenated Code

The effect of block interleaving in a low density parity check (LDPC)‐turbo concatenated code is investigated in this letter. Soft decoding can be used in an LDPC code unlike the conventional Reed‐Solomon (RS) code. Thus, an LDPC‐turbo concatenated code can show better performance than the conventional RS‐turbo concatenated code. Furthermore, the performance of an LDPC‐turbo code can be improved by using a block interleaver between the LDPC and turbo code. The average number of iterations in LDPC decoding can also be reduced by a block interleaver.     

On the theory and performance of trellis termination methods forturbo codes

The performance of a turbo code can be severely degraded if no trellis termination is employed. This paper investigates the implications of the choice of trellis termination method for turbo codes, and explains the origin of the performance degradation often experienced without trellis termination. An efficient method to derive the distance spectrum of turbo codes for different trellis termination methods is presented. Further, we present interleaver design rules that are tailored to each termination method. Using interleavers designed with these restrictions, we demonstrate that the performance difference between various termination methods is very small, including no trellis termination at all. For example, we demonstrate a turbo code with a 500-bit interleaver that exhibits no sign of an error floor for frame error rates as low as 10^-8, even though no trellis termination is employed     

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

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

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.     

Turbo Codes for 10-66GHz WiMax Systems

In this paper, performances of turbo codes for 10-66GHz WiMax system are analyzed and simulated. The channel of WiMax system is modeled as Rician channel due to the short wavelength. The uniform interleaver is used in the performance analysis to derive the average upper bound of performance of turbo codes. Simulations of bit error rate (BER) performances are performed for WiMax systems with/without turbo codes. It is shown that about 4.3dB coding gain can be achieved by using a [1,11/13,15/13] turbo code with 5 iterations, and thus the required transmission power of WiMax system can be decreased. It is also demonstrated that the performances of turbo codes are improved by increasing the interleaver length and the iteration number.     

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     

A turbo code interleaver design criterion based on the performanceof iterative decoding

The performance of a turbo code is dependent on two code properties: its distance spectrum and its suitability to be iteratively decoded. Both these properties are influenced by the choice of interleaver used in the turbo encoder. This paper presents an interleaver design criterion that focuses on the performance of iterative decoding, based on the correlation properties of the extrinsic inputs. Interleavers designed with the proposed criterion achieve very competitive performances, both in terms of convergence rates and error correcting capabilities