LDPC码译码算法及调度方案的分析

低密度奇偶校验(LDPC)码基于置信度传播(Belief Propagaton,BP)迭代译码算法时具有良好的防误码性能,在码长较长时甚至超过Turb码,成为性能最接近香农极限的好码。在低密度奇偶校验(LDPC)码的基本译码算法的基础上,实现了基于传统BP译码算法的多种改进译码算法及译码调度方案,并对多种译码算法进行了性能仿真分析和对比。     

基于现场可编程门阵列的新型纠错码实现方案

低密度奇偶校验码(LDPC)是一种具有稀疏校验矩阵的线性分组纠错码,它具有逼近香农限的性能,其译码采用迭代译码算法.提出了利用现场可编程门阵列FPGA技术实现数字信号处理可以很好地解决并行性、可配置性和速度问题.给出了一种基于LDPC译码器的FPGA硬件实现方案,其算法的关键是变量节点和校验节点间的信息传递.     

一种改进的LDPC码译码算法

基于标准的置信度传播译码算法，提出了一种改进的低密度校验（LDPC）码译码算法。该算法通过对变量节点中最不可靠节点初始软信息的修正，进行二次的迭代检测译码，使得性能优于标准的置信度传播算法。仿真结果表明，该算法能有效减少LDPC码的译码错误，同时克服因子图中短环的影响。     

分组乘积Turbo码动态迭代译码算法分析与优化

分组乘积Turbo码 (简称TPC码)是一类将分组码进行串行级联,并采用分组交织器构成的级联码,是一种构造十分简单的纠错码,它是香农信息理论提出后第一个在非零码率时可以实现无误码传输的纠错编码.采用迭代译码方法,可发挥该码的良好性能,并特别适合于高速硬件译码.良好的纠错性能使得TPC码正在被广泛的应用.本文首先对TPC码的编码结构和译码算法进行介绍,其后对TPC码的动态迭代译码进行分析与仿真,最后对其算法提出了优化方法.     

基于FPGA的Turbo译码器设计

Turbo码良好的纠错性能为众多研究者所公认,其相关理论和实现技术一直是该领域的研究热点。本文主要围绕如何用FPGA实现Turbo码译码器,介绍了Turbo码迭代译码的硬件实现算法以及流水线译码概念,并利用Altera的Flex10k10芯片实现了该译码器。性能测试实验表明,该基于FPGA实现的译码器最高速率可达到8Mbps,性能相比于理论译码器性能下降控制在0.5dB以内,具有广阔的应用前景。     

基于扩展格雷码的高速数据传输加固设计

星载雷达系统由于其工作环境和高速信号传输特性,在数据传输过程中无可避免的会因为各种干扰而出现误码.为了加固高速信号抵抗传输过程中的误码干扰,采用能纠错3位的完备码格雷码,经添加一位奇偶校验位扩展得到的扩展格雷码设计了编译码电路.根据扩展格雷码的生成矩阵和校验矩阵,以及一种硬判决译码算法,基于FPGA实现了扩展格雷码的并行信息编译码器以及串行信息编译码器.行为仿真结果表明该扩展格雷码编码器能正常实现连续编码,同时在模拟星载雷达系统因为干扰而出现的误码时,该译码器能自我纠正编码分组内3个以内的任意误码组合,达到了数据传输加固的目的.     

LDPC码差分译码算法

对于LDPC码的译码算法——和积算法,提出了一种新的LDPC规则码的差分译码算法,其主要思想是,把概率信息的差分值作为LDPC码Tanner图上的传送信息,而对于校验节点和消息节点的更新都是在特定的加法域中进行。对整个过程从数学上做了推导论证。将差分算法与LLRBP算法做了比较。与传统的基于对数似然比的译码方法相比,新算法的计算复杂度有明显降低,而译码性能则损失不大。     

准循环LDPC码在电力线通信中的仿真应用

文章将电力线信道建模为加性白色A类噪声信道,在该信道模型中采用改进BP译码算法,研究准循环LDPC码的抗脉冲噪声性能,给出了在不同迭代次数下的仿真结果(表现出不同的译码性能)。仿真试验证明:采用改进的BP译码算法,当信噪比在4.6 dB时,比特误码率达10-5,可以满足实际应用的需要。本研究为准循环LDPC码在PLC中的应用提供了理论与实验依据。     

一种多元LDPC-CPM优化方法及性能仿真分析

为了解决二元低密度奇偶校验(LDPC)码与高阶连续相位调制(CPM)级联的系统在卫星通信、深空通信方面传输性能不足的问题，提出了一种多元LDPC-CPM优化方法。首先采用多元LDPC码与高阶CPM串行级联形成多元LDPC-CPM系统获取更好的传输误码性能。其次考虑到多元LDPC码的传统译码算法复杂度过高，难以硬件实现的问题，设计了一种改进型的Mixed-Log-FFT-BP算法，通过去除加法与查表运算中对数似然比的求解，降低译码复杂度。最后针对多元LDPC-CPM系统涉及参数过多问题，提出一种性能逐步收敛的参数优化方法。仿真结果表明，与优化前的系统相比，优化后的系统在中高信噪比下，误码性能有1～1.2 dB的提升，且系统复杂度较低。     

Turbo码译码器的DSP实现

Turbo码以其优越的性能在通信系统中越来越受到人们的重视.由于Turbo码译码算法的复杂性,译码器通常需占用大量的存储空间和较长的运算时间,难以满足实际系统的要求.本文在深入研究Max-Log-MAP译码算法的基础上,对该算法进行了合理优化,提出了一种基于DSP的高效的软件实现方法.基于此方法实现的Turbo码译码器具有较低的误码率和较小的译码时延,在语音通信和数据通信中具有广泛的应用前景.     

Low-density parity-check codes for 40-gb/s optical transmission systems

In this paper, we compare performance of three classes of forward error correction schemes for 40-Gb/s optical transmission systems. The first class is based on the concatenation of Reed-Solomon codes and this is employed in the state-of-the-art fiber-optics communication systems. The second class is the turbo product codes with Bose-Chaudhuri-Hocquenghen component codes. The application of these codes in optical communication systems was extensively studied by Sab and Lemarie, and Mizuochi The third class is the low-density parity-check (LDPC) codes that have attracted much attention over the past decade. We present enhanced decoding algorithms for Turbo product codes and LDPC codes that use probability density function of output sequences instead of calculating initial likelihood ratios assuming (inaccurate) Gaussian or chi-square approximation. The analysis in this paper shows that the LDPC codes perform better than the other codes in the waterfall region at bit error rates as low as 10/sup -9/. We also presented error floors results obtained by analyzing decoding failures of hard-decision iterative decoders.     

Transformed HCT for parallel Huffman decoding

This paper proposes a novel and generic Huffman code table (HCT) transform and a simple parallel Huffman decoding method. Codes of the original HCT are left‐aligned, reordered in value, and partitioned into sub‐bands. Two kinds of modification to the codes are introduced in order to reduce the number of sub‐bands. The Huffman decoder can be implemented with a minimized size of single LUT, and the parallel decoding can be completed easily, at a constant rate of up to one code per cycle. An example of MP3 decoder and AAC decoder has been designed to demonstrate the efficiency of the proposed method. Copyright © 2014 John Wiley & Sons, Ltd.     

基于MAX-Log-MAP算法和DSP芯片的Turbo译码器

Turbo码又称为并行级联卷积码,其重要的特性就是实现了伪随机编码的思想,但要实现译码低误码率却要以降低整个编译码系统的效率和增加延时为代价。因此,本文通过分析Turbo码迭代译码原理和MAX-Log-MAP算法,根据性能要求和可行性考虑,以DSP芯片ADSP-TS101和MAX-Log-MAP译码算法来实现Turbo译码器的设计,实验结果表明,该系统误码率较低、延时性能符合要求,工作稳定。     

Adaptation of turbo coding and equalization in turbo equalization for time-varying and frequency-selective channels

A number of authors have sought to combine equalization and decoding in an iterative system in order to reduce the effects of frequency and temporal dispersiveness of time-varying frequency-selective channels. In the recent literature, several architectures based on these iterative systems have been proposed. One can note architectures which combine a maximum a posteriori (MAP) equalizer and decoder, architectures formed by an interference canceller and MAP decoder, architectures implementing a decision feedback equalizer and a MAP decoder, etc. Most of these architectures require accurate channel estimation to adapt the equalizer filters or to execute the MAP equalizers. This article presents a turbo equalizer architecture for time-varying frequency-selective channels without channel estimators. The proposed turbo equalizer consists of an interference canceller in direct-adaptation mode and a turbo decoder. In order to reduce noise correlation, the addition of a transverse filter to the interference-canceller architecture is proposed. The reliability factor for variable time-varying frequency-selective channels is also redefined in order to improve the performance of the turbo decoder. The architecture of the proposed turbo equalizer reduces considerably the effects of frequency and temporal dispersiveness of time-varying frequency-selective channels depending on the normalized Doppler frequency range.     

Iterative channel estimation and decoding of turbo-coded OFDM symbols in selective Rayleigh channel

This work deals with the detection of turbo-coded symbols in orthogonal frequency-division multiplexed (OFDM) systems. OFDM symbol detection requires channel estimation, which is often carried out using known pilots. In this paper, an iterative detector composed of a turbo decoder and a channel estimator is proposed. These modules perform jointly and exchange soft information through an iterative process. The decoder consists of the maximum a posteriori Bahl-Cocke-Jelinek-Raviv (MAP-BCJR) algorithm, and the channel estimator is based on the minimum mean-square error (MMSE) criterion. The proposed approach allows for the use of all available information, increases the quality of channel estimation, and improves the system performance. This paper also proposes a new expression of the channel reliability factor used by the MAP-BCJR decoding algorithm. This metric depends on signal-to-noise ratio and the channel estimation error variance. The effect of the channel reliability factor and of the channel estimation error are investigated.