极低码率Turbo码及其应用研究

针对极低信噪比条件下的传输,研究了极低码率Turbo码的编译码器结构,仿真分析了其性能。提出了极低码率Turbo码在高带宽容量、复杂信道环境,例如：短波通信、流星余迹通信等系统中的使用方法。比较了极低码率Turbo码与高码率Turbo码加扩频的性能。研究表明,极低码率Turbo码较传统高码率Turbo码有更好的性能,能将自适应调制编码技术向低信噪比环境扩展。     

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

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

极低信噪比环境下的载波同步算法研究

在极低信噪比环境下,需要使用纠错能力强的编码比如Turbo码,但Turbo码系统的缺点是要求近乎理想的载波同步。然而,在极低信噪比环境下,Turbo编码系统的同步是具有挑战性的工作。文章提出了一种基于最大均方软输出的扫频和面向判决载波同步相结合的载波同步算法。仿真结果表明,该算法能捕获较大的频偏和相偏,且在极低信噪比环境下,仍能正常工作,其性能非常接近理想同步条件下的性能。     

Turbo码在DVB-S系统中的应用研究

Turbo码以其优异的纠错性能被应用于多领域。为了提高DVB-S系统的性能,文中将Turbo码引入了DVB-S系统。利用仿真系统,引入Turbo码与传统的系统进行了性能比较。针对两种不同译码算法,给出了两种系统在不同信噪比下的误码率曲线。实验结果表明,引入Turbo码后系统的性能有明显的提高。     

短波跳频系统中分组Turbo码在阻塞干扰下的性能分析

该文基于短波跳频(FH)系统的特点,对短波跳频系统中分组 Turbo码的联合上界进行了分析和推导,给出了该编码在阻塞干扰存在的情况时平均误码率上限的数学表达式。并对分组 Turbo码在短波阻塞信道下的性能进行了数值模拟,结果表明:分组 Turbo码用于跳频系统时,在短波慢瑞利衰落的信道下,当信噪比为 20dB,信号阻塞比为 30dB时,可使系统的比特误码率由 10-3降为 10-5。     

Turbo码的性能分析及其应用

纠错编码技术作为改善数字通信可靠性的一种有效手段,在数字通信的各个领域中获得极为广泛的应用,其主要分为卷积码、分组码。Turbo码是并行级联递归系统卷积码。他在接近Shannon限的低信噪比下能获得较低的误码率。因为其优越的性能,现在已经被许多通信系统所采用。就近年来的研究热点纠错编码Turbo码进行分析,旨在阐明Turbo码的基本原理和各参数对Turbo码纠错性能的影响以及在无线通信系统中的应用。     

BCH-Turbo编码的设计与仿真实现

本文针对Turbo码在低信噪比下迭代次数多、译码时延长问题,在分析了Turbo码的编译码原理和算法基础上,提出一种可以有效降低平均迭代次数、减少译码时延的基于BCH迭代停止准则的Turbo码迭代译码的设计方案。本方案采用BCH码作为Turbo迭代译码的停止准则。并对每一个分量译码器结果都进行判断。可提前停止迭代。通过Monte Carlo仿真表明在AWGN信道下,误码率有所降低。Turbo码译码的平均迭代次数与交叉熵准则相比有明显下降。本文还分析了BCH码编码效率和分组长度的选择对系统性能的影响。     

BCH-Turbo码的设计与仿真实现

本文针对Turbo码在低信噪比下迭代次数多、译码时延长问题,在分析了Turbo码的编译码原理和算法基础上,提出一种可以有效降低平均迭代次数、减少译码时延的基于BCH迭代停止准则的Turbo码迭代译码的设计方案.本方案采用BCH码作为Turbo迭代译码的停止准则,并对每一个分量译码器结果都进行判断,可提前停止迭代.通过Monte Carlo仿真表明在AWGN信道下,误码率有所降低,Turbo码译码的平均迭代次数与交叉熵准则相比有明显下降.本文还分析了BCH码编码效率和分组长度的选择对系统性能的影响.     

基于大气激光通信仿真系统的纠错码性能比较

针对大气激光信道对光信号衰减极大的特性,提出了一种用Simulink构建的Turbo码系统仿真模型,分别与未采用信道编码和采用卷积编码方案的仿真系统进行了误码率(BER)性能对比,结果显示出了Turbo码在实现低误码率的大气激光信息传输中的优越性,为Turbo码在大气激光通信系统中的应用提供了理论基础.     

短波信道下的Turbo码性能研究

基于Watterson短波信道模型,构建了Turbo码在短波信道下的设计和仿真方法。在高信噪比区域中,推导出了不同信道条件下Turbo码的性能界公式;在低信噪比区域中,用Matlab仿真了短波信道下不同的信道条件及Turbo码的主要设计参数对其性能的影响,并给出了Turbo码在短波信道下的设计参数,为实际工程中的应用提供参考。     

Unequal error protection for convolutional codes

In this correspondence, unequal error-correcting capabilities of convolutional codes are studied. For errors in the information symbols and code symbols, the free input- and output-distances, respectively, serve as "unequal" counterparts to the free distance. When communication takes place close to or above the channel capacity the error bursts tend to be long and the free distance is not any longer useful as the measure of the error correcting capability. Thus, the active burst distance for a given output and the active burst distance for a given input are introduced as "unequal" counterparts to the active burst distance and improved estimates of the unequal error-correcting capabilities of convolutional codes are obtained and illustrated by examples. Finally, it is shown how to obtain unequal error protection for both information and code symbols using woven convolutional codes.     

Performance of Möbius Interleavers for Turbo Codes

In this paper, we study the minimum free distance and error performance of turbo encoders with Möbius interleavers. In order to be capable of estimating the minimum free distance of these interleavers using binary-fixed point (BFP) algorithm, new deterministic interleavers called “truncated Möbius interleavers” are defined and constructed. It is shown how the shifted cycles of these interleavers can be related to the cycle structure of the primary Möbius transformation and its coefficients. By adjusting some parameters, an upper bound on the number of total tested BFPs for the proposed truncated Möbius interleavers is found. One distinctive property of Möbius interleavers is that their inverse can also be represented and computed with Möbius functions. Simulations are conducted to compare the error performance of the proposed truncated Möbius interleavers with quadratic permutation polynomial (QPP) interleavers whose inverses are also representable by a quadratic equation (Ryu and Takeshita in IEEE Trans Inf Theory 52(3):1254–1260, 2006). It is finally shown that the truncated Möbius interleavers can interleave sequences of information bits faster than QPP interleavers.     

Robustly good trellis codes

The relationship between the distance properties of trellis codes and the computational effort and error performance of sequential decoding is studied and optimum distance profile (ODP) and optimum free distance (OFD) trellis codes are constructed for 8-PSK and 16 QAM modulation. A comparison of the performance of both the ODP and the OFD trellis codes reveals that neither class of codes results in the best trade-off between error performance and computational effort when sequential decoding is used. A new algorithm is then proposed to construct robustly good trellis codes for use with sequential decoding. New trellis codes with asymptotic coding gains up to 6.66 dB are obtained using this algorithm, and the new codes achieve nearly the same free distances as the OFD codes and nearly the same distance profiles as the ODP codes     

Group trellis codes over multidimensional unbalanced PSK and theiroptimality

New geometrically uniform trellis codes over multidimensional unbalanced 4-, 8-, and 16-PSK constellations, obtained with the group code approach, are presented. They improve by up to 1.25 dB the asymptotic performance of the best known trellis codes over multidimensional balanced PSK. To check their “optimality”, an upper bound on the free distance of group trellis codes is derived. Some of the new codes achieve the largest obtainable free distance, and several others are close to the bound. Exploiting the symmetry properties of the codes, curves of tight upper bounds to the error probability are also presented     

Variable-complexity trellis decoding of binary convolutional codes

Considers trellis decoding of convolutional codes with selectable effort, as measured by decoder complexity. Decoding is described for single parent codes with a variety of complexities, with performance “near” that of the optimal fixed receiver complexity coding system. Effective free distance is examined. Criteria are proposed for ranking parent codes, and some codes found to be best according to the criteria are tabulated, Several codes with effective free distance better than the best code of comparable complexity were found. Asymptotic (high SNR) performance analysis and error propagation are discussed. Simulation results are also provided     

近地层紫外自由光通信传输距离及影响因素研究

在建立紫外自由光通信系统通信传输距离方程的基础上,针对紫外大气传输衰减、光学系统性能、探测器性能、误码率和信噪比等因素对通信传输距离的影响进行了具体分析,并对系统的通信传输距离进行了仿真计算.结果表明,在目前的技术水平下,系统的理论通信传输距离一般不超过4km,这与目前实际系统的通信传输距离符合较好.这对近地层紫外自由...     

基于投影和主成分分析的偏心检测

在生产实践中,管类工件的内部结构之中常常存在微小的偏心误差。偏心误差对工件的工作性能影响很大,因此,能否准确、快速地检测出偏心误差在生产实践中意义重大。本文介绍了一种基于投影数据和主成分分析的偏心检测方法。截取工件中任意两个截面,利用Radon变化求得它们在一定投影角度下的投影。分别计算投影的第一主成分,并以第一主成分之间的欧氏距离表征偏心误差。如果欧氏距离不等于零,则证明工件存在偏心误差。通过仿真实验证明该方法能检测出0.1%的微小偏心,并且抗噪性能较好。     

Some block- and trellis-coded modulations for the Rayleigh fadingchannel

The error performance of a modulation code over a channel depends on several distance parameters and the path multiplicity of the code. For the AWGN channel, the error performance of a modulation code depends mainly on its minimum squared Euclidean distance and path multiplicity. For the Rayleigh fading channel, however, the error performance of a modulation code depends strongly on its minimum symbol distance, minimum product distance, and path multiplicity. It depends on the minimum squared Euclidean distance in a lesser degree. This paper is concerned with the construction of block and trellis MPSK modulation codes for the Rayleigh fading channel. In each construction, the distance parameters are chosen to achieve good error performance with reduced decoding complexity     

Short Constraint Length Rate 1/2 "Quick-Look" Codes

Quick-look nonsystematic convolutional codes have the property that the information sequence may be recovered from the encoded sequence in straightforward fashion and with a minimum of error amplification. In this concise paper we investigate their relevant characteristics for constraint lengths less than eight and ratefrac{1}{2}and obtain a number of interesting and practically useful results. In particular, for the best of these codes, we derive their free distance and error amplification, their decoded bit error probability when used over the binary symmetric channel in conjunction with Viterbi decoding, and show how they can be employed to measure the channel bit error rate.     

Dependence of d/sub free/ in MPCCC systems

This letter first investigates the distribution of the free distance, parameter d/sub free/ for multiple parallel concatenated schemes based on random interleavers. The distribution is obtained by computer search for information weight IW=2 error events, which are the most likely events to produce d/sub free/, at least for turbo codes. The dependence upon interleaver length and code memory is also studied. The design of the S-interleaver for turbo codes is shown to depend upon a combination of IW=2 error events (which are dependent on S) and IW=2+2 "crossed" error events (which are independent of S). The limiting value of S (for which the two effects are equal) is calculated for turbo codes and a novel algorithm to increase this limit (and hence, d/sub free/) is presented. The S-random interleaver design is extended to schemes with two interleavers, for which the use of paired S-random interleavers is proposed.