并行级联LDPC码译码迭代终止准则研究

提出了两种低复杂度的终止准则,以用于降低PCGC（并行级联Gallager码,parallel concatenated gallagercode）的译码器运算量.这两种准则通过观察边信息方差的改变情况,来判断是否终止译码器迭代.计算机仿真结果证明,这些终止准则可有效地降低译码器运算量,且不影响译码器误比特率性能.     

一种低译码复杂度的Turbo架构LDPC码

针对低密度奇偶校验(LDPC)码较大的译码复杂度和RAM占用,该文提出了一种低译码复杂度的Turbo架构LDPC码并行交织级联Gallager码 (Parallel Interleaved Concatenated Gallager Code,PICGC)。该文给出了PICGC的设计方法和编译码算法,并分析比较了PICGC译码器与LDPC译码器所需的RAM存储量,推导出RAM节省比的上界。理论分析和仿真结果表明,PICGC以纠错性能略微降低为代价,有效地降低译码复杂度和RAM存储量,且译码时延并未增加,是一种有效且易于实现的信道编码方案。     

基于重复累积码的BICM系统译码算法

重复累积码(RA)由于其编译码复杂度低、性能接近香农限的优点,目前得到学术界的广泛关注。文中研究了RA码及其译码算法,并将其应用于比特交织编码调制(BICM)系统。针对低信噪比下基于RA码的编码调制系统误码率较高的问题,提出了一种改进算法,该算法通过在解调器和译码器之间引入迭代处理,利用译码器输出的外信息改善解映射结果,从而降低了系统误码率。仿真结果表明,在加性高斯白噪声(AWGN)信道、瑞利(Rayleigh)衰落信道下,BICM系统使用迭代的译码算法与原算法相比,误码性能有较明显提高。     

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

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

采用预判决信息的LDPC码编码调制方案性能研究

低密度奇偶校验(LDPC)码是Turbo码以外另一种性能接近香农限的好码.本文将LDPC码与比特交织编码调制(BICM)相结合,首先给出了在不使用传统解调器与译码器之间迭代的情况下8PSK调制方案在AWGN信道和Rayleigh衰落信道中的性能(简称为无迭代方案).然后提出了一种新的接收端解决方案:首先对接收符号进行预判决,判决信息被用来调整解调器,从而在一定程度上弥补了不使用解调器与译码器之间迭代所造成的性能损失,并且相对于无迭代方案接收端复杂度几乎没有变化,但性能却有所提高.这说明原有比特度量产生方法并不是最佳的,该文使用预判决信息的方案给出了一个改善的思路.通过仿真结果可以得到结论:使用本文所提出的方案在AWGN信道和Rayleigh衰落信道中都可以在不增加复杂度的情况下提高性能.     

RS码与LDPC码的联合迭代译码

针对RS码与LDPC码的串行级联结构,提出了一种基于自适应置信传播(ABP)的联合迭代译码方法.译码时,LDPC码置信传播译码器输出的软信息作为RS码ABP译码器的输入;经过一定迭代译码后,RS码译码器输出的软信息又作为LDPC译码器的输入.软输入软输出的RS译码器与LDPC译码器之间经过多次信息传递,译码性能有很大提高.码长中等的LDPC码采用这种级联方案,可以有效克服短环的影响,消除错误平层.仿真结果显示:AWGN信道下这种基于ABP的RS码与LDPC码的联合迭代译码方案可以获得约0.8 dB的增益.     

纠正同步错误的反转级联水印码的迭代译码

为提高插入删节信道下反转级联水印码（Reverse Concatenated Watermark Code）的译码性能,本文设计了一种反转级联水印码的硬判决迭代译码方案。该方案在反转级联水印码内译码器中引入外译码器输出的硬判决估计序列,交织后的硬判决序列和水印序列的异或作为内译码器的更新后的参考序列,从而减小了码字序列对水印码的影响,改善了水印译码器的参考信息。前后向估计方法利用该参考序列和更新后的有效替代错误概率计算输出概率,进一步用于计算前向度量值和后向度量值,提高了内译码器输出的每个比特的似然信息的可靠度,改善了整体性能。仿真结果表明,当反转级联水印码方案采用硬判决迭代译码算法时,整体性能得到有效提高。      

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

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

迭代译码的级联Reed-Solomon乘积码与卷积码

该文提出用Reed Solomon(RS)乘积码作为外码,卷积码作为内码的级联码方案并且内外码间用Congruential向量生成的交织图案对RS码符号进行重排列。对此级联码采用的迭代译码基于成员码的软译码算法。当迭代次数达到最大后,通过计算RS码的校正子,提出一种纠正残余错误的方法,进一步提高了系统的误比特性能。仿真结果表明,在AWGN信道中与迭代译码的级联RS/卷积码相比,当误比特率为1e-5时,新系统的编码增益大约有0.4 dB。     

无短环不规则QC_LDPC码的快速编码及联合译码

基于不规则部分并行结构设计了一种高吞吐量,低复杂度,码长码率可变且去除四环的低密度奇偶校验LDPC码及其译码结构实现方案,该编码结构可针对不同码长的不规则部分并行结构LDPC码进行扩展,译码器采用缩放最小和定点(Sum-Min)算法实现译码,中间信息节点存储器地址采用格雷码编码,降低动态功耗;采用Xilinx公司的Virtex-5XC5Vt X150T-ff1156FPGA芯片设计了一款码长1 270,码率1 2的不规则部分并行LDPC码的编码器和译码器。综合结果表明:该编码器信息吞吐量为2.52 Gb/s,译码器在10次迭代的情况下信息吞吐率达到44 Mb/s。     

Turbo decoder

We propose an adaptive channel SNR estimation algorithm required for the iterative MAP decoding of turbo decoders. The proposed algorithm uses the extrinsic values generated within the iterative MAP decoder to update the channel SNR estimate toward its optimum value per each decoder iteration or per each turbo code frame     

A coding and Modulation scheme for HDTV services in DMB-T

In this paper a channel coding and modulation scheme for providing HDTV broadcasting services is presented, which adopts BICM structure as inner code in connection with 64QAM constellation and OFDM transmission. A new mapping method is designed to maximize the minimum Euclidean distance between signal points divided by feedback bits, thus an iterative algorithm between demodulator and decoder can be performed to acquire performance improvement. Analysis, simulation and laboratory test results have proved that the proposed system has good SNR performance in both AWGN and multipath channels.     

Iterative joint source–channel decoding of H.264 compressed video

This paper proposes an Iterative Joint Source–Channel Decoding (IJSCD) scheme for error resilient transmission of H.264 compressed video over noisy channels by using the available H.264 compression, e.g., Context-based Adaptive Binary Arithmetic Coding (CABAC), and channel coding, i.e., rate-1/2 Recursive Systematic Convolutional (RSC) code, in transmission. At the receiver, the turbo decoding concept is explored to develop a joint source–channel decoding structure using a soft-in soft-out channel decoder in conjunction with the source decoding functions, e.g., CABAC-based H.264 semantic verification, in an iterative manner. Illustrative designs of the proposed IJSCD scheme for an Additive White Gaussian Noise (AWGN) channel, including the derivations of key parameters for soft information are discussed. The performance of the proposed IJSCD scheme is shown for several video sequences. In the examples, for the same desired Peak Signal-to-Noise Ratio (PSNR), the proposed IJSCD scheme offers a savings of up to 2.1 dB in required channel Signal-to-Noise Ratio (SNR) as compared to a system using the same RSC code alone. The complexity of the proposed scheme is also evaluated. As the number of iterations is controllable, a tradeoff can be made between performance improvement and the overall complexity.     

An Interleave-Division-Multiplexing MISO System With Partial CSI at Transmitter

We treat the performance analysis and optimization of an interleave-division-multiplexing (IDM) multiple-input-single-output (MISO) system with partial channel state information (CSI) at the transmitters and an iterative (turbo) receiver. We propose a general methodology to analyze and evaluate the performance of such an IDM-MISO system. In particular, an SNR tracking method is proposed to calculate the output SNR of the soft-input soft-output IDM detector. The extrinsic mutual information transfer chart technique is employed to analyze the performance of the entire system. More specifically, the repetition decoder and the low-density parity check decoder are considered for the uncoded IDM system and the coded IDM system, respectively. Furthermore, based on the above analytical framework, we present the optimal transmit strategy for the IDM-MISO system with an imperfect CSI at the transmitter. Extensive simulations are performed to demonstrate the performance of the proposed IDM schemes under the MISO channels with different correlation statistics. Our results show that the proposed IDM-MISO scheme can outperform the existing space-time block code schemes in the low-rate transmission scenario     

Algebraic analog decoding of linear binary codes

Bit-by-bit soft-decision decoding of binary cyclic codes is considered. A significant reduction in decoder complexity can be achieved by requiring only that the decoder correct all analog error patterns which fall within a Euclidean sphere whose radius is equal to half the minimum Euclidean distance of the code. Such a "maximum-radius" scheme is asymptotically optimum for the additive white Gaussian noise (AWGN) channel. An iterative extension of the basic algebraic analog decoding scheme is discussed, and performance curves are given for the (17,9), (21,11), and (73,45) codes on the AWGN channel.     

SNR mismatch and online estimation in turbo decoding

Iterative decoding of turbo codes, as well as other concatenated coding schemes of similar nature, requires knowledge of the signal-to-noise ratio (SNR) of the channel so that proper blending of the a posteriori information of the separate decoders is achieved. We study the sensitivity of decoder performance to misestimation of the SNR, and propose a simple online scheme that estimates the unknown SNR from each code block, prior to decoding. We show that this scheme is sufficiently adequate in accuracy to not appreciably degrade the performance     

迭代结构的信源信道联合解码及其简化算法

信源信道联合解码算法中的迭代信道解码需要进行比特似然值和概率值转换,以及联乘、累加运算,增加了信道解码的计算复杂度,该文针对这一问题,直接利用信道解码的比特硬判决值和参数的先验概率,估计比特的外信息,用于迭代信道解码。基于高斯-马尔可夫信源参数的仿真实验表明,该简化算法大大降低了迭代信道解码算法的计算复杂度。与独立解码算法相比,简化的联合解码算法明显改善了接收参数的信噪比,同时不会明显降低原迭代结构解码算法的性能。     

瑞利衰落信道下基于LDPC码USTM的MIMO系统

研究了一种联合低密度校验(LDPC,Low-Density Parity-Check)码和酉空时调制(USTM,Unitary Space-Time Modulation)技术在不相关瑞利平坦衰落(Rayleigh flat fading)下的多输入多输出信道(MIMO,Multiple-Input Multiple-Output)系统的性能.在无信道状态信息下,采用可并行操作的和积译码算法(SPA,Sum-Product Algorithm)的LDPCC-USTM级联系统具有优异的性能,并分析了不同LDPC码集下对系统性能的影响.仿真结果表明LDPCC-USTM级联系统比与未级联的相比有近23dB的编码增益,与基于Turbo码的USTM[6]系统相比有5dB多的编码增益,且基于非规则的LDPC码的级联系统比基于规则码有近1dB的编码增益.     

Bandwidth-efficient turbo trellis-coded modulation using puncturedcomponent codes

We present a bandwidth-efficient channel coding scheme that has an overall structure similar to binary turbo codes, but employs trellis-coded modulation (TCM) codes (including multidimensional codes) as component codes. The combination of turbo codes with powerful bandwidth-efficient component codes leads to a straightforward encoder structure, and allows iterative decoding in analogy to the binary turbo decoder. However, certain special conditions may need to be met at the encoder, and the iterative decoder needs to be adapted to the decoding of the component TCM codes. The scheme has been investigated for 8-PSK, 16-QAM, and 64-QAM modulation schemes with varying overall bandwidth efficiencies. A simple code choice based on the minimal distance of the punctured component code has also been performed. The interset distances of the partitioning tree can be used to fix the number of coded and uncoded bits. We derive the symbol-by-symbol MAP component decoder operating in the log domain, and apply methods of reducing decoder complexity. Simulation results are presented and compare the scheme with traditional TCM as well as turbo codes with Gray mapping. The results show that the novel scheme is very powerful, yet of modest complexity since simple component codes are used     

Iterative turbo decoder analysis based on density evolution

We track the density of extrinsic information in iterative turbo decoders by actual density evolution, and also approximate it by symmetric Gaussian density functions. The approximate model is verified by experimental measurements. We view the evolution of these density functions through an iterative decoder as a nonlinear dynamical system with feedback. Iterative decoding of turbo codes and of serially concatenated codes is analyzed by examining whether a signal-to-noise ratio (SNR) for the extrinsic information keeps growing with iterations. We define a “noise figure” for the iterative decoder, such that the turbo decoder will converge to the correct codeword if the noise figure is bounded by a number below zero dB. By decomposing the code's noise figure into individual curves of output SNR versus input SNR corresponding to the individual constituent codes, we gain many new insights into the performance of the iterative decoder for different constituents. Many mysteries of turbo codes are explained based on this analysis. For example, we show why certain codes converge better with iterative decoding than more powerful codes which are only suitable for maximum likelihood decoding. The roles of systematic bits and of recursive convolutional codes as constituents of turbo codes are crystallized. The analysis is generalized to serial concatenations of mixtures of complementary outer and inner constituent codes. Design examples are given to optimize mixture codes to achieve low iterative decoding thresholds on the signal-to-noise ratio of the channel