一种采用非均匀量化的近似Log-MAP算法

为了简化Log-MAP算法、减小其硬件查表实现时所占用的外存储单元,采用了非均匀量化的方法分别对Log-MAP算法中的校正函数进行两电平和五电平近似,从而得到相应的量化函数。并将该量化函数用于LTE Turbo译码器,在AWGN信道上进行软迭代译码仿真。仿真结果表明,两电平和五电平非均匀量化的近似Log-MAP算法将Max-Log-MAP算法的译码性能提高了0.2～0.3 dB,与原Log-MAP算法性能接近,但却能大大减少查表时需要检索的数据量。     

综合射频系统中Turbo码的应用研究

综合射频系统具有可靠性高,抗干扰能力强、占用空间小等特点,需要采用纠错性能强的信道编码技术,因此选择了接近Shannon理论极限的Turbo码作为综合射频系统的通信信号信道编码。同时,为了降低Turbo码的译码复杂度,提出了一种基于现有算法的改进的Max-Log-MAP算法,并对不同的译码算法进行纠错能力的仿真比较,结果表明改进的Max-Log-MAP算法的复杂度略高于Max-Log-MAP算法,而性能更接近Log-MAP算法,易于工程实现。     

高性能的Max-Log-MAP线性分段算法研究

针对Max-Log-MAP算法存在译码性能比Log-MAP算法差0.5dB,而Log-MAP算法复杂度大的问题。论文提出了用线性分段(piecewise-linear term:PLT)的最大值运算来替代Log-MAP算法中雅克比公式,并通过研究比例因子对译码性能的影响,获得了最佳的优化Turbo译码性能的方法。研究结果证明,用分段项数r等于3,比例因子s为0.7时,获得的Turbo译码性能略优于Log-MAP算法,而算法的计算复杂度比Max-Log-MAP算法仅增加一次乘法、一次加法和求最大值运算。     

一种低复杂度的Log-MAP译码器结构

根据实际中Turbo译码器硬件实现的重要性,提出了一种适合于并行计算的改进Log-MAP译码算法,即在其译码计算中间参数的过程中,将具有n个输入变量的最大近似算法max*运算简化为取最大值的max运算和相关函数的计算,减少了存储量,有效实现了低复杂度的Turbo译码器的硬件结构。将此改进的算法应用于CCSDS标准和Wi MAX标准中,仿真结果表明,所提出的简化的近似算法与传统的Log-MAP算法对比,有效降低了译码复杂度和时延,而且纠错性能接近Log-MAP算法,便于实际工程应用。     

LTE系统中Turbo编译码仿真与性能分析

介绍了LTE Turbo编译码方法,基于硬件实现对编码和交织器的计算进行了简化,提高了编码效率,利用Matlab仿真分析性能,分别采用Log-MAP算法和Max-Log-MAP算法进行译码,实现时结合项目需求综合考虑采用了误码率性能较好的Log-MAP算法。     

Turbo码的一种高效改进型MAP译码算法

该文给出了一种改进型最大后验概率(MAP)译码算法用于实现并行级联卷积码(Turbo码)的最优译码。与基于对数域的Log-MAP算法相比较,该文给出的算法不引入对数域,但能够完全消除标准MAP算法在迭代过程中必须进行的大量指数和对数运算。计算机仿真结果表明,这种具有最优纠错性能的改进型MAP算法能够显著减少运行时间,其译码效率甚至优于牺牲了较多纠错性能的最快速的对数域MAP译码算法(Max-Log-MAP)。     

之型码和级联之型码

本文介绍了一种新型的纠错码，称之为“之型码”。之型码可以形成非常简捷的软输入/软输出译码规则，我们在Max-Log-MAP(MLM)译码方法的基础上提出了一种译码规则，这一译码规则的计算复杂度为每次迭代计算单位信息比特大约需要20次加法运算操作。在仿真实验中，我们用最优译码器和更简捷的次最优译码器进行译码时，其性能在误比特率为10^-5处分别距香农理论极限仅0.9dB和1.4dBH。此外，上述码字与2维turbo码相比具有更低的误码基底值（error floor）。     

基于FPGA的Turbo码译码器的设计

介绍了一种基于现场可编程门阵列（FPGA）的Turbo码译码器的完整的设计方案和设计结果,采用Max-Log-MAP译码算法,用Verilog语言编程,提出了正序运算和逆序运算同时进行,以及采用数组型存储器存储中间运算结果的方案,使译码速度得到提高。文中给出了Turbo码译码原理、Max-Log-MAP算法分析、基于FPGA的设计方案及实现框图、算法时序图及速度分析、仿真波形图及性能分析,结果表明,该方案正确可行,译码/纠错正确无误,且译码速度快。     

基于3GPP协议的一种Turbo译码实现方案

Turbo码具有卓越的纠错性能,性能接近香农限,而且编译码的复杂度不高,因而在无线通讯中有非常广泛的应用。本文介绍一种面向3GPP协议基于Max-Log-MAP算法的Turbo译码器设计方法,及其具体实施要点、测试方法和测试结果、实施效益等。     

LTE系统中Turbo译码的改进算法

LTE系统对可靠通信提出了更高的要求,这在一定程度上依赖于信道编码的性能。针对LTE系统中的Turbo译码算法进行了研究,在Max-Log-MAP和Log-MAP算法的基础上提出了一种改进算法。理论分析和仿真结果表明,这种改进算法的性能有进一步提升,并且更加易于硬件实现,具有较低的复杂度。     

Modification of branch metric calculation to improve iterative SOVA decoding of turbo codes

It is known that the performance of a SOVA (soft output Viterbi algorithm) turbo decoder can be improved, as the extrinsic information that is produced at its output is over-optimistic. A new parameter associated with the branch metrics calculation in the standard Viterbi algorithm is introduced that affects the turbo code performance. Different parameter values show a simulation improvement in the AWGN channel as well as in an uncorrelated Rayleigh fading channel. By choosing the best value of this parameter, a coding gain improvement of 0.25 dB at BER of 10/sup -5/ is achieved compared to existing schemes.     

Turbo decoder SNR estimation with RAKE reception

The joint performance of a turbo decoder and RAKE receiver using the MAP algorithm depends on the accuracy of the channel reliability factor. In a high data rate/low processing gain environment, inherent interference that results from non-idealities of the RAKE receiver complicate the estimation of the channel reliability factor. The combined performance of a turbo decoder and RAKE receiver is analyzed in a timedispersive and time-varying channel with distinct multipath components. Approaches are examined for estimating the channel reliability factor using the limited information that is known by the RAKE receiver. The sensitivity of performance to SNR mismatches is computed. The impact of the processing gain and the number of multipath components on BER performance is analyzed along with the effect of the channel time coherence. By accounting for the non-ideal RAKE interference effects, improvements in the channel reliability factor calculation result in BER performance improvements on the order of 0.5-2 dB.     

Viterbi-based algorithm for side-match vector quantization overnoisy channels

Side-match vector quantization is a finite-state technique for image coding. This research shows that the side-match vector quantization is an error-propagating code and it is similar to a catastrophic convolutional code. Here, we propose a Viterbi-based algorithm to solve this problem. Various noise detection algorithms are integrated into the Viterbi algorithm (to yield the Viterbi-based algorithm) for a much better performance. According to the simulation of a binary symmetric channel with random bit-error rate (BER) 0.1%-0.01%, the Viterbi-based algorithm provides 2.8-9.6 dB and 2.3-8.4 dB gain compared with the conventional side-match vector quantization decoder and the Viterbi decoder, respectively. In addition, the proposed algorithm requires much fewer computations than the Viterbi algorithm     

Memory-Reduced Maximum A Posteriori Probability Decoding for High-Throughput Parallel Turbo Decoders

Wireless communication standards make use of parallel turbo decoder for higher data rate at the cost of large hardware resources. This paper presents a memory-reduced back-trace technique, which is based on a new method of estimating backward-recursion factors, for the maximum a posteriori probability (MAP) decoding. Mathematical reformulations of branch-metric equations are performed to reduce the memory requirement of branch metrics for each trellis stage. Subsequently, an architecture of MAP decoder and its scheduling based on the proposed back trace as well as branch-metric reformulation are presented in this work. Comparative analysis of bit-error-rate (BER) performances in additive white Gaussian noise channel environment for MAP as well as parallel turbo decoders are carried out. It has shown that a MAP decoder with a code rate of 1/2 and a parallel turbo decoder with a code rate of 1/3 have achieved coding gains of 1.28 dB at a BER of 10\(^{-5}\) and of 0.4 dB at a BER of 10\(^{-4}\), respectively. In order to meet high-data-rate benchmarks of recently deployed wireless communication standards, very large scale integration implementations of parallel turbo decoder with 8–64 MAP decoders have been reported. Thereby, savings of hardware resources by such parallel turbo decoders based on the suggested memory-reduced techniques are accounted in terms of complementary metal oxide semiconductor transistor count. It has shown that the parallel turbo decoder with 32 and 64 MAP decoders has shown hardware savings of 34 and 44 % respectively.     

SVD iterative decision feedback demodulation and detection of coded space-time unitary differential modulation

A new suboptimal demodulator based on iterative decision feedback demodulation (DFD), and a singular value decomposition (SVD) for estimation of unitary matrices, is introduced. Noncoherent communication over the Rayleigh flat-fading channel with multiple transmit and receive antennas, where no channel state information (CSI) is available at the receiver is investigated. With four transmit antennas, codes achieving bit-error rate (BER) lower than 10/sup -4/ at bit energy over the noise spectral density ratio (E/sub b//N/sub o/) of -0.25 dB up to 3.5 dB, with coding rates of 1.6875 to 5.06 bits per channel use were found. The performance is compared to the mutual information upper bound of the capacity attaining isotropically random (IR) unitary transmit matrices. The codes achieve BER lower than 10/sup -4/ at E/sub b//N/sub o/ of 3.2 dB to 5.8 dB from this bound. System performance including the iterative DFD algorithm is compared to the one using Euclidean distance, as a reliability measure for demodulation . The DFD system presents a performance gain of up to 1.5 dB. Uncoded systems doing iterative DFD demodulation and idealized pilot sequence assisted modulation (PSAM) detection are compared. Iterative DFD introduces a gain of more than 1.2 dB. The coded system comprises a serial concatenation of turbo code and a unitary matrix differential modulation code. The receiver employs the high-performance coupled iterative decoding of the turbo code and the modulation code. Information-theoretic arguments are harnessed to form guidelines for code design and to evaluate performance of the iterative decoder.     

Projective-plane iteratively decodable block codes for WDM high-speed long-haul transmission systems

Low-density parity-check (LDPC) codes are excellent candidates for optical network applications due to their inherent low complexity of both encoders and decoders. A cyclic or quasi-cyclic form of finite geometry LDPC codes simplifies the encoding procedure. In addition, the complexity of an iterative decoder for such codes, namely the min-sum algorithm, is lower than the complexity of a turbo or Reed-Solomon decoder. In fact, simple hard-decoding algorithms such as the bit-flipping algorithm perform very well on codes from projective planes. In this paper, the authors consider LDPC codes from affine planes, projective planes, oval designs, and unitals. The bit-error-rate (BER) performance of these codes is significantly better than that of any other known foward-error correction techniques for optical communications. A coding gain of 9-10 dB at a BER of 10/sup -9/, depending on the code rate, demonstrated here is the best result reported so far. In order to assess the performance of the proposed coding schemes, a very realistic simulation model is used that takes into account in a natural way all major impairments in long-haul optical transmission such as amplified spontaneous emission noise, pulse distortion due to fiber nonlinearities, chromatic dispersion, crosstalk effects, and intersymbol interference. This approach gives a much better estimate of the code's performance than the commonly used additive white Gaussian noise channel model.     

Fast turbo codes with space‐time block codes in fast fading channels

In this paper, space‐time block coding has been used in conjunction with Turbo codes to provide good diversity and coding gains. A new method of dividing turbo encoder and decoder into several parallel encoding and decoding blocks is considered. These blocks work simultaneously and yield a faster coding scheme in comparison to classical Turbo codes. The system concatenates fast Turbo coding as an outer code with Alamouti's G2 space‐time block coding scheme as an inner code, achieving benefits associated with both techniques including acceptable diversity and coding gain as well as short coding delay. In this paper, fast fading Rayleigh and Rician channels are considered for discussion. For Rayleigh fading channels, a fixed frame size and channel memory length of 5000 and 10, respectively, the coding gain is 7.5 dB and bit error rate (BER) of 10^?4 is achieved at 7 dB. For the same frame size and channel memory length, Rician fading channel yields the same BER at about 4.5 dB. Copyright © 2013 John Wiley & Sons, Ltd.     

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.     

Combined turbo coding and unitary space-time modulation

Space-time coding is well understood for high data rate communications over wireless channels with perfect channel state information. On the other hand, channel coding for multiple transmit antennas when channel state information is unknown has only received limited attention. A new signaling scheme, named unitary space-time modulation, has been proposed for the latter case. In this paper, we consider the use of turbo coding together with unitary space-time modulation. We demonstrate that turbo coded space-time modulation systems are well suited to wireless communication systems when there is no channel state information, in the sense that the turbo coding improves the bit error rate (BER) performance of the system considerably. In particular, we observe that the turbo-coded system provides 10-15 dB coding gain at a BER of 10/sup -5/ compared to the unitary space-time modulation for various transmit and receive antenna diversity cases.