Turbo码中迭代译码的迭代终止准则研究

本文介绍了Turbo码中迭代译码的两种新的迭代终止准则,并通过仿真研究了这两种迭代终止准则的性能。这两种迭代终止准则都是基于互熵（CE）的概念,但是后一种比CE准则更简单,具有更低的计算复杂度。     

部分系统Turbo码的研究

对一种码率为1／2的部分系统turbo码性能进行了讨论。它是通过对码率为1／3的turbo码的校验位和信息位进行删余得到的。这种码的“误码下限”（error-floor）比对应的系统码要低。因此,码率为1／2的turbo码,在没有增加编码和译码复杂性的情况下,通过简单地对信息位和校验位的删除可以提高性能。     

交器对Turbo码性能影响的研究

研究了Turbo码系统性能，并对其中的交器进行研究。结果表明使用随机交织器可明显改善系统性能，加大交织深度有助于改善系统性能。     

不同译码器结构对Turbo码性能的影响

文章给出了两种译码顺序不同的Ｔｕｒｂｏ码译码器,并通过软判决维特比算法作译码业比较两种结构的译码效果。     

一种新的Turbo码译码的迭代停止判决

Turbo码译码由于是迭代译码,因此带来了译码延时大的问题,运用动态的迭代译码算法为了来解决这个延时大的问题,首先对CRC,HDA,SCR,SDR和IHDA这五种动态停止迭代判决进行了讨论,并且对它们进行了分析和比较。其次在基于文献[1]提出来的迭代停止判决的思想上,即就是根据信道条件好坏的情况下,提出了CRC-SDR迭代停止判决。最后对所提出的CRC-SDR停止迭代判决进行了仿真并且和其他译码迭代停止判决的仿真结果相比,可知CRC-SDR的译码平均迭代次数明显降低,而且译码的性能并没有下降,因此可知提出来的CRC-SDR改进算法是可行的和有效的。     

Turbo码的译码算法

介绍了Turbo码的基本概念,详细推导了最大后验译码算法(MAP)、对数最大后验译码算法(LOG-MAP)、最大对数后验译码算法(MAX-LOG-MAP)以及软输出Viterbi算法(SOVA),利用上述算法对分量码进行译码,然后进行迭代,可以逼近最大似然译码。     

Turbo码的改进译码方法

本文在Turbo码的常用迭代译码方法的基础上加以改进,引入迭代步进因子以改善迭代译码的收敛特性,论文还给出了迭代步进因子的产生方法并进行了计算机仿真.     

一种用于cdna2000的新的Turbo码迭代译码方案

由于Ｔｕｒｂｏ码优异的纠错性能使得其在第三代移动通信（３Ｇ）系统中倍受重视。无论是ＷＣＤＭＡ还是ｃｄｍａ２０００都将其作为侯选的信道编码方案，并且将其列为３Ｇ的核心技术之一。本文将ｃｄｍａ２０００中的Ｔｕｒｂｏ码和同等译码复杂度的卷积码进行比较，给出了在加性白高斯噪声信道和瑞利衰落信道中的仿真结果。     

Turbo码技术最新进展

Turbo码是信道编码技术的重大突破，结合最新的研究成果，根据Turbo码的结构和实现，系统地分析了其研究和实现中的关键技术，重点分析了Turbo码和其它纠错码的级联，以及和TCM，空时码等技术的结合，及其在均衡和多用户检测技术中的应用。Turbo码已经从理论研究和仿真实验开始走向实际应用，最后叙述了Turbo码在实际系统中的应用进展。     

Turbo码译码算法的迭代准则

仿真分析了迭代次数对Turbo编码性能的影响,包括对误比特率(BER)和误帧率(FER)的影响.并通过对附加信息的距离变化进行度量,提出了一种新的迭代停止判断准则,这种准则能动态地选择迭代次数.     

Iterative multiuser turbo-code receiver for DS-CDMA

A number of different iterative decoding methods are proposed for multiuser interference cancellation in a code-division multiple-access system where turbo-codes are utilized for forward error correction (FEC). The individual users are decoded separately with the operation of iterative interference cancellation being mixed with iterative decoding of the turbo-code. This results in a modest increase in the overall complexity as compared to a conventional single-user receiver utilizing turbo-code for FEC. Numerical results are presented showing that the proposed iterative decoders show an improvement in the bit error rate performance and/or a reduction in the computational complexity as compared to similar previously known methods reported by M.C. Reed et al. (see 8th IEEE Int. Symp. Personal, Indoor and Mobile Radio Commun. - PIMRC'97, vol.2, p.740-4, 1997; IEEE Trans. Commun., vol.46, p.1693-9, 1998).     

A code-matched interleaver design for turbo codes

A code-matched interleaver design for turbo codes in which a particular interleaver is constructed to match the code weight distribution is proposed. The design method is based on the code distance spectrum. The low weight paths in the code trellis which give large contributions to the error probability in the signal-to-noise ratio region of interest for practical communication systems are eliminated so that they do not appear in the overall code trellis after interleaving. The proposed interleaver improves the code error performance at moderate to high signal-to-noise ratio and considerably increases the asymptotic slope of the error probability curves     

Performance comparison between Gaussian interleaver, Rayleigh interleaver, and dithered golden interleaver

This paper is a proposal for a new form of random interleaver for a turbo code based on the probability distribution of channel statistic model of transmission, instead of a uniform probability distribution. In our work, we use the normal (Gaussian) and Rayleigh probability distribution in accordance with the channel type and compare them with classic random interleaver (uniform distribution) and with dithered golden interleaver [invention of the Communications Research Centre (CRC)]. The results show that this new form of random interleaver gives identical results compared to the simulated case of dithered golden interleaver.     

Improved algorithms for the determination of turbo-code weight distributions

We discuss algorithms for determining exactly the lower terms of the weight distribution of a turbo code. Several improvements on the recently introduced algorithm by Garello et al. are outlined. The techniques presented in this letter improve the observed asymptotic complexity by a factor proportional to the information length. As an example, the improved algorithm is applied to the determination of the minimum distance of all universal mobile telecommunications system turbo codes. We further apply the improved algorithm to high-rate turbo codes using high-rate nonpunctured constituent codes. To reduce complexity, the constituent codes are represented by a minimal information bit-oriented trellis.     

Defining performance limits for turbo-code assisted synchronizationin DVB-S systems

The operating Es/No of the European Digital Video Broadcasting over Satellite (DVB-S) system can be reduced by utilizing turbo codes, although this reduces the performance of both carrier and symbol synchronizers. While maximum likelihood decision directed (ML-DD) feedback algorithms for both carrier and symbol synchronization can be shown to approach the Cramer-Rao bound (CRB), at reasonable Es/No, at low Es/No incorrect decisions reduce their performance. If improved decisions are made available to the algorithms then even at low Es/No the CRB can be approached. By utilizing a turbo code to provide improved symbol estimates tracking performance can be improved. In a practical system, however, there is an unavoidable delay caused by the decoder, which reduces tracking performance. This paper is concerned with examining the tradeoff between improved decisions and unavoidable delay. Limits are shown for performance and interleaver size to make this approach to the synchronization problem practical     

基于3GPP交织器的可变码长Turbo码并行交织器设计

高速Turbo译码器实现中交织器的设计是一个非常重要的问题。在没有任何性能损失的情况下设计无内存访问冲突、高并行度的交织器已有多种方法，但是它们不能够根据码长参数的变化实时产生，这限制了译码器设计的灵活性。现提出了一种基于3GPP中可变码长交织器的并行交织器，其最大的优点就是可以实时产生。并且通过计算机仿真给出了这种交织器的性能，并与3GPP标准中的交织器做了性能比较。     

随机交织器的设计与实现

本文首先分析了随机交织器在Ｔｕｒｂｏ码中的重要作用。然后讨论了交织器长度的选择原则,并且对ＡＷＧＮ信道和Ｒａｙｌｅｉｇｎ衰落信道条件下交织深度对Ｔｕｒｂｏ码性能的影响进行了计算机模拟。在此基础上,给出了随机交织器的两种硬件电路实现方案,其中方案二便于ＡＳＩＣ实现。     

确定性交织器的研究

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

LTE中基于Turbo编码的速率匹配算法的DSP快速实现方案

针对现有TD-LTE终端测试仪表因信道编码处理速度慢导致下行达不到理论峰值速率问题,本文在深入研究了3GPP协议中的Rate Matching算法的基础上,提出了一种基于DSP芯片快速实现RM算法的方案,优化下行信道编码,利用地址置换代替数据置换以减小速率匹配的处理延时.通过对比代码优化前后的算法执行时间,表明基于该方案的RM算法具有较小的处理延时.此方案推动了TD-LTE终端测试仪表实现下行理论峰值速率,为加快LTE发展提供了动力.     

一种改进的DRP交织器及其在IEEE 802.16a中的应用

对卷积Turbo码进行了研究,提出了一种用于卷积Turbo码的改进的DRP交织器,并将其应用到IEEE802.16a系统里,系统仿真表明,用这种改进的DRP交织器构建的四进制卷积Turbo码对系统性能有进一步改善。