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

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

一种基于Turbo编译码方案的BPSK系统误比特性能研究

在介绍Turbo编码、译码原理的基础上,建立一个典型BPSK通信系统模型,将Turbo码与其它编码方式分别运用于该系统模型,通过Matlab仿真,研究、分析了系统在不同编译码方式下的误比特性能,最后给出结论。     

Turbo乘积码在衰落信道中的应用

基于Turbo乘积码的编译码原理,利用Matlab仿真工具,对以(64,57,4)扩展汉明码为子码的Turbo乘积码进行迭代次数、量化比特数等不同参数的性能仿真,根据仿真结果选取最佳的设计参数,同时通过仿真给出了Turbo乘积码在衰落信道中的应用效果。结合Matlab仿真,在Quartus环境中完成编译码算法的硬件设计与调试,并将其应用到无线通信调制解调器中。测试结果表明,Turbo乘积码显著改善了调制解调器在衰落信道中的误码性能。     

比特交织Turbo编码调制的8PSK符号映射

基于对Turbo编码器输出的系统比特和校验比特的不等错误保护(UEP),提出了一种新的比特交织Turbo编码调制(BITCM)的8PSK符号映射方案,即对于码率为1/3的Turbo码,校验比特映射到8PSK星座点中具有较好传输性能的比特位置上,而系统比特映射到较差传输性能的比特位置上。实现新映射方案的关键是比特交织器的设计。仿真结果表明,新的映射方案在AWGN信道下,误码率为10-3时,可获得大于0.2dB的信噪比增益,而这一增益的获得并没有牺牲频谱效率和增加系统的复杂性。     

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

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

Turbo码在深空通信中应用

Turbo码具有逼近Shannon容量限的优异性能,介绍了应用于深空通信的Turbo码编码方案和相应的译码算法,并给出了采用修正Max-Log-Map译码算法的深空CCSDS标准Turbo码的软件仿真性能和硬件系统实测性能。通过计算机仿真和硬件实测结果表明,采用该修正Max-Log-Map译码算法的Turbo码译码器易于硬件实现,同时Turbo码仿真性能和实际性能一致,适用于实际工程应用。     

短Turbo码的交织器设计

介绍了一种短Turbo码交织器的设计方法 ,给出了一个短交织器的设计例子 ,其仿真结果表明 ,这种交织器对于短Turbo码很有效。在Turbo码帧长度处于 10 0到 10 0 0时 ,与Turbo码使用块交织和伪随机交织相比 ,误码性能有了大幅度的提高。     

Turbo码解码过程中的加权算法

本文通过调整迭代解码过程中系统位接收值的加权系数,提出了一种Turbo码加权迭代解码算法。该算法改变了迭代运算后Turbo码解码器输出软值中系统位接收值信息和它的外部估计信息的比重,使Turbo码无论在低信噪比或是在高信噪比时均具有优良的纠错性能。仿真结果显示,采用Turbo码加权迭代解码算法,不仅能提高Turbo码的收敛速度,而且能进一步降低Turbo码解码时的地板值,使Turbo码的比特误码率在高、低信噪比时都能够得到进一步改善。     

一种简单的Turbo码的迭代停止判据

Turbo码提出之后,由于其优异的性能成为研究热点。但为了得到其优异的性能,在译码过程中需要进行多次迭代,这造成巨大的译码延时。在不影响性能的情况下,为减少译码延时,迭代停止在Turbo码迭代译码过程中十分重要。提出一种基于似然比绝对值大于某一门限的比特数目的迭代停止判据。并且给出平均迭代次数、译码性能的仿真。仿真结果证明该算法的有效性。     

删余Turbo乘积码的编译码算法分析

基于现有的Turbo乘积码的编译码方法,提出一种附加删余的Turbo乘积码编译码算法,介绍其编码器的构造方法,阐述了译码算法及实现框图,分析了删余信息对传输帧长的影响,仿真了其误码性能,并与未删余的Turbo乘积码做比较。分析和仿真结果表明,附加删余的Turbo乘积码可满足特定系统传输速率及帧长的需要,在相同的信噪比下,删余Turbo乘积码的误码性能优于未加删余的误码性能。     

一种新颖的Turbo码MAP译码器

根据Turbo码trellis结束的情况及Turbo码的特征本文提出了一种新的Turbo码MAP译码器。这是基于MAP译码器中两个组成译码器性能的不一致所作改进,从分析和仿真结果我们可以看到该方法的优势。     

TD-LTE系统中咬尾卷积码译码器的FPGA实现

在LTE中,为了获得正确无误的数据传输,要采用差错控制编码技术。LTE中是采用Viterbi和Turbo加速器来实现前向纠错。咬尾卷积码保证格形起始和终止于某个相同的状态,它具有不要求传输任何额外比特的优点。本文提出一种在FPGA中实现的咬尾卷积码的Viterbi译码算法,并在Xilinx的XC3S500E芯片上实现了该算法,最后对该算法性能进行了分析。     

A comparison of turbo codes using different trellis terminations

This paper investigates the incidence of trellis termination on the performance of turbo codes and accounts for the performance degradation often experienced in the absence of trellis termination. Analytical upper bounds on the performance for the ensemble of turbo codes using different trellis termination strategies as well as performance results obtained by computer simulation are presented. In the case of uniform interleaving, the performance differences between various termination methods are relatively small, except when using no trellis termination at all.     

一种基于矩阵分析的Turbo码长识别算法

针对信息截获领域中Turbo码识别问题,提出了一种基于矩阵分析的Turbo码长识别算法。简述了Turbo码编码和归零的基本原理,深入分析了Turbo码第1路、第2路、第3路和整体的生成矩阵,得出其本质上是一种线性分组码。将线性分组码的码长识别方法引入到Turbo码识别当中,并对算法进行了改进。仿真实验表明,此方法在较高的误码率基础上有着良好的识别效果。     

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     

Performance of continuous and blockwise decoded turbo codes

In this letter we define and evaluate the average maximum-likelihood performance of the three ways of co-decoding turbo codes. In all cases the information sequence is split into blocks of N bits (N being the length of the interleaver used by the turbo code), that are encoded by the first constituent encoder and, after interleaving, by the second encoder. In the first operation mode, both constituent encoders work in a continuous fashion, whereas in the second, at the end of each block, a suitably chosen sequence of bits is appended to the information block in order to terminate the trellises of both constituent codes. In the third mode, the operation is similar to the second, but, instead of trellis termination, both constituent encoders are simply reset     

一种短延时Turbo编码调制系统的设计

本文设计了一种比传统体制减少了一半延时的Turbo编码调制系统,介绍了交织器的相关限制.提出了一种在译码过程中对信道值的估计方法,使得外信息的计算更加趋于精确,从而提高了译码性能.这种迭代译码算法是标准格码调制译码算法的一种自然推广,同时也类似于二元Turbo码在BPSK调制下的逐比特译码算法.采用吞吐率为2bits/s/Hz的8PSK调制,比特错误率为10^-5所需的信噪比与Shannon限相距不到0.4dB.     

Turbo码在INMARSAT-M4系统中的应用

研究JPEG图像通过INMARSAT-M4系统的高速数据线路传输时,Turbo码和16QAM的应用对该系统的性能影响情况.通过计算机仿真,给出了M4系统采用Turbo码作为前向纠错码时,在不同迭代次数下恢复的图像和误比特率曲线,并与M4系统采用卷积码的情况进行比较.仿真结果表明,Turbo码和16QAM的结合不仅提高了通信系统的可靠性和有效性,还节省了系统发射功率.     

Simultaneous zero-tailing of parallel concatenated codes

In a parallel concatenated convolutional code, an information sequence is encoded by a convolutional encoder, and an interleaved version of the information sequence is encoded by another convolutional encoder. We discuss the situation in which we require both convolutional encoders to end in the all-zero state. To do so, we have to split an information word in two parts. One part contains the true information bits, and the second part contains the so-called tail bits, which are special bits with values computed such that both encoders end in the all-zero state. Depending on the interleaver, a different number of tail bits are needed. By using a constructive method, we give a characterization of all interleavers for a prescribed number of tail bits. We explain the method of encoding. In addition, simulations have been carried out to investigate the performance of codes resulting from simultaneous zero-tailing. This shows that simultaneous zero-tailing is similar in performance as compared to previously known zero-tailing methods (but with fewer trellis termination bits) and that it is better than zero-tailing just one of the encoders.     

Design and implementation of low-energy turbo decoders

Turbo codes have been chosen in the third generation cellular standard for high-throughput data communication. These codes achieve remarkably low bit error rates at the expense of high-computational complexity. Thus for hand held communication devices, designing energy efficient Turbo decoders is of great importance. In this paper, we present a suite of MAP-based Turbo decoding algorithms with energy-quality tradeoffs for additive white Gaussian noise (AWGN) and fading channels. We derive these algorithms by applying approximation techniques such as pruning the trellis, reducing the number of states, scaling the extrinsic information, applying sliding window, and early termination on the MAP-based algorithm. We show that a combination of these techniques can result in energy savings of 53.2%(50.0%) on a general purpose processor and energy savings of 80.66%(80.81%) on a hardware implementation for AWGN (fading) channels if a drop of 0.35 dB in SNR can be tolerated, at a bit error rate (BER) of 10/sup -5/. We also propose an adaptive Turbo decoding technique that is suitable for low power operation in noisy environments.