卷积LDPC码在瑞利信道下的性能分析

本文研究了卷积LDPC码在瑞利衰落信道下的译码性能,给出了瑞利信道下,卷积LDPC码的译码算法,在同等条件下对比了卷积LDPC码在高斯信道和瑞利衰落信道下的译码性能。     

基于LDPC码的BICM系统性能分析和改进

将低密度奇偶校验码(LDPC)与比特交织编码调制(BICM)技术相结合,分别给出了不同码长LDPC码在16QAM调制方式下AWGN信道中的性能,并针对不同星座点对比特保护能力的差异,提出了一种有效的内置交织编码算法,即首先对LDPC编码后的码字进行相应的内置交织变换,然后将LDPC码中的信息位调制到星座点中保护能力强的比特位上,在译码端进行相应的矩阵变换译码,计算机仿真结果表明,新方案在信噪比较低时优于传统的16QAM调制方案。     

基于低密度校验码的OFDM编码调制译码算法

低密度校验码(LDPC)具有编码增益高、译码速度快、性能接近Shannon限的优点。LDPC码应用于OFDM，能有效地提高多径环境下OFDM的BER性能。本文首先简单介绍LDPC码及其概率域上的译码算法，在此基础上对译码算法作融合，阐述概率似然比的译码算法。为了把LDPC应用于OFDM系统上，提出了多电平调制下的LDPC译码的算法。仿真结果表明，在AWGN和Rayleigh信道下，此算法正确有效。     

突发信道下多进制LDPC码的性能研究

给出一种新的Q LDPC码(多进制LDPC码)译码简化算法,比较了在突发噪声信道以及衰落信道下,高码率(码率不低于8/9),短帧(帧长小于5 000 b)情况下Q LDPC码与RS码的纠错性能,并分析了其译码复杂度。仿真结果表明,改进后的Q LDPC码具有很好的抗突发和抗衰落性能,在突发噪声长度高达144 b的情况下,在误帧率为10-4的水平下,Q LDPC码的编码增益超出RS码2.7 dB,而在瑞利衰落信道下,则要比RS码多出9 dB的编码增益。这对于Q LDPC码应用具有重要的实际意义。     

LDPC码及其在Rayleigh信道上的性能

本文介绍低密度奇偶校验码（LDPC）的基本原理。包括它的基本特性、编码方式、译码算法原理。详细介绍了LOG域的和积译码算法在平坦瑞利衰落信道上的具体步骤，并仿真出1／2码率、不同信息序列长度的规则LDPC码在平坦瑞利衰落信道上的性能。     

高频谱效率LDPC编码调制系统

低密度校验(low-density parity-check,LDPC)码近年来成为纠错码领域的研究热点。基于LDPC码以及比特交织编码调制(bit-interleaved coded modulation,BICM)的概念,针对无线带宽受限信道,提出了一种具有较高编码增益和频谱效率的联合编码调制方案。高斯信道和瑞利衰落信道下的仿真均显示了该方案的良好性能。     

短波数据链中基于BICM算法的应用研究

采用(2,1,7)卷积码构建了一种实用性较强的BICM(比特交织编码调制)算法。首先对该算法进行了数值仿真,证明了在瑞利信道条件下BICM-ID(BICM的硬判决反馈迭代译码)算法的性能优于TCM(网格编码调制)的性能;然后将BICM-ID应用于SW(短波)数据链中,针对BICM-ID和SW数据链的特点,分析了交织长度、符号映射方式及迭代次数对BICM-ID性能的影响;最后利用DSP(数字信号处理器)实现了BICM-ID算法,给出了不同码率和不同数据量情况下的译码时间,结果表明,译码时间均满足数据链实时性要求。     

基于电力线信道的改进LDPC码译码算法研究

脉冲噪声是电力线通信中存在的最大障碍,造成信号的误码率(BER)高,必须考虑采用复杂的信道编码技术.低密度奇偶检验码(LDPC)是无线通信系统中最接近香农极限的纠错码,译码算法是针对无线信道的干扰而设计的.针对电力线信道存在的脉冲噪声,用A脉冲类噪声电力线信道模型,提出了一种改进的LDPC码译码算法.通过对改进的算法进行仿真,表明改进的LDPC算法大大提高了系统编码增益,可用于电力线宽带通信系统.     

瑞利信道下基于Turbo-BICM-ID的DFT-S-OFDM性能研究

为了提升DFT-S-OFDM系统在瑞利信道下的传输性能,采用位交织编码调制迭代译码方案(BICM-ID)、旋转映射(R-QAM)和Turbo码等技术,设计了基于Turbo-BICM-ID的DFT-S-OFDM系统。给出了系统原理框图,对编码调制系统的解调译码迭代算法进行了推导,对系统进行了Matlab仿真验证。仿真结果表明,与传统的卷积码设计方案相比,该设计方案在误码率为10-5时,可以获得5.7 d B的增益改善,同时可以获得更低的错误平层,有效地改善了DFT-S-OFDM系统在瑞利信道下的性能。     

LDPC编译码算法分析

低密度奇偶校验(LDPC)码是一种线性分组码,其纠错能力可以接近香农极限。针对LDPC码的编译码问题,分析了校验矩阵的构造方法。给出了LDPC码的编码算法以及算法的实现结构。分析了基于软判决的置信传播(BP)译码算法,并给出了可以进一步降低计算复杂度的简化译码方法。通过仿真对比了不同的译码算法在高斯信道下的译码性能。     

Reduced-Complexity Decoding of LDPC Codes

Reduced-Complexity Decoding of LDPC Codes Various log-likelihood-ratio-based belief-propagation (LLR- BP) decoding algorithms and their reduced-complexity derivatives for low-density parity-check (LDPC) codes are presented. Numerically accurate representations of the check-node update computation used in LLR-BP decoding are described. Furthermore, approximate representation of the decoding computations are shown to achieve a reduction in complexity, by simplifying the check-node update or symbol-node update, or both. In particular, two main approaches for simplified check-node updates are presented that are based on the so-called min-sum approximation coupled with either a normalization term or an additive offset term. Density evolution is used to analyze the performance of these decoding algorithms, to determine the optimum values of the key parameters, and to evaluate finite quantization effects. Simulation results show that these reduced-complexity decoding algorithms for LDPC codes achieve a performance very close to that of the BP algorithm. The unified treatment of decoding techniques for LDPC codes presented here provides flexibility in selecting the appropriate scheme from a performance, latency, computational complexity, and memory-requirement perspective.     

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

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

一种低码率的LDPC码在LTE-A中的性能研究

本文通过分析LTE-Advanced系统中准循环LDPC码校验矩阵的构造方法,在不改变母码矩阵的基础上,采用一种灵活的扩展方法,构造了一种低码率的LDPC码。采用一种很实用的编码算法和差分译码算法,在MATLAB仿真平台下,比较了这种LDPC码和Turbo码的性能。结果表明：在短码情况下,这种LDPC码在低信噪比下性能略低于Turbo码,但随着信噪比的增加,LDPC码性能优于Turbo码;在长码情况下,LDPC码的性能明显优于Turbo码。为LTE-Advanced系统的信道编解码器的硬件设计提供了一套有效的编译码算法方案,具有较好的实用价值。     

Correcting capabilities of binary irregular LDPC code under low-complexity iterative decoding algorithm

This paper deals with the irregular binary low-density parity-check (LDPC) codes and two iterative low-complexity decoding algorithms. The first one is the majority error-correcting decoding algorithm, and the second one is iterative erasure-correcting decoding algorithm. The lower bounds on correcting capabilities (the guaranteed corrected error and erasure fraction respectively) of irregular LDPC code under decoding (error and erasure correcting respectively) algorithms with low-complexity were represented. These lower bounds were obtained as a result of analysis of Tanner graph representation of irregular LDPC code. The numerical results, obtained at the end of the paper for proposed lower-bounds achieved similar results for the previously known best lower-bounds for regular LDPC codes and were represented for the first time for the irregular LDPC codes.     

On decoding of low-density parity-check codes over the binary erasure channel

This paper investigates decoding of low-density parity-check (LDPC) codes over the binary erasure channel (BEC). We study the iterative and maximum-likelihood (ML) decoding of LDPC codes on this channel. We derive bounds on the ML decoding of LDPC codes on the BEC. We then present an improved decoding algorithm. The proposed algorithm has almost the same complexity as the standard iterative decoding. However, it has better performance. Simulations show that we can decrease the error rate by several orders of magnitude using the proposed algorithm. We also provide some graph-theoretic properties of different decoding algorithms of LDPC codes over the BEC which we think are useful to better understand the LDPC decoding methods, in particular, for finite-length codes.     

不同译码下LDPC码的图像应用

文中介绍了LDPC码的构造及其译码原理,该码在中短码长时具有很强的纠错能力,将其与图像传榆相结合,能够达到很好的图像传输质量。仿真实现了在AWGN信道下规则LDPC码的图像传输系统,用四种译码算法对LDPC码的性能做了仿真,并将其在图像传输中的效果做了比较。仿真结果发现,LDPC码采用不同的译码算法输出图像的效果是不一样的。     

FPGA implementation of low complexity LDPC iterative decoder

Low-density parity-check (LDPC) codes, proposed by Gallager, emerged as a class of codes which can yield very good performance on the additive white Gaussian noise channel as well as on the binary symmetric channel. LDPC codes have gained lots of importance due to their capacity achieving property and excellent performance in the noisy channel. Belief propagation (BP) algorithm and its approximations, most notably min-sum, are popular iterative decoding algorithms used for LDPC and turbo codes. The trade-off between the hardware complexity and the decoding throughput is a critical factor in the implementation of the practical decoder. This article presents introduction to LDPC codes and its various decoding algorithms followed by realisation of LDPC decoder by using simplified message passing algorithm and partially parallel decoder architecture. Simplified message passing algorithm has been proposed for trade-off between low decoding complexity and decoder performance. It greatly reduces the routing and check node complexity of the decoder. Partially parallel decoder architecture possesses high speed and reduced complexity. The improved design of the decoder possesses a maximum symbol throughput of 92.95 Mbps and a maximum of 18 decoding iterations. The article presents implementation of 9216 bits, rate-1/2, (3, 6) LDPC decoder on Xilinx XC3D3400A device from Spartan-3A DSP family.     

低复杂度的LDPC码联合编译码构造方法研究

LDPC码因为其具有接近香农限的译码性能和适合高速译码的并行结构,已经成为纠错编码领域的研究热点。LDPC码校验矩阵的构造是基于稀疏的随机图,所以该类码字编码和译码的硬件实现比较复杂。以单位阵的循环移位阵为基本单元,构造LDPC码的校验矩阵,降低了LDPC码在和积算法下的译码复杂度。同时考虑到LDPC码的编码复杂度,给出了一种可以简化编码的结构。针对该方案构造的LDPC码,提出了消除其二分图上的短圈的方法。通过大量的仿真和计算分析,本文比较了这种LDPC码和随机构造的LDPC码在误码率性能,圈长分布以及最小码间距估计上的差异。     

Linear programming decoding: The ultimate decoding technique for low density parity check codes

Linear programming (LP) decoding is an alternative to iterative algorithms for decoding low density parity check (LDPC) codes. Although the practical performance of LP decoding is comparable to message-passing decoding, a significant advantage is its relative amenability to nonasymptotic analysis. Moreover, there turn out to be a number of important theoretical connections between the LP decoding and standard forms of iterative decoding. These connections allow theoretical insight from the LP decoding perspective to be transferred to iterative decoding algorithms. These advantages encouraged many researchers to work in this recent decoding technique for LDPC codes. In this paper, LP decoding for LDPC code is extensively reviewed and is discussed in different segmented areas.     

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

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