基于FPGA的多速率LDPC编码器和译码器设计与实现

低密度奇偶校验码(LDPC)因其性能逼近 Shannon 限而被广泛应用于通信系统。 为满足时变或有干扰的信道上可靠传输的通信要求,本文设计并实现了一种码长固定、码率灵活可变的 LDPC 码。利用近似下三角形式结构的校验矩阵直接编码,通过减少信息位和增加校验位, 实现不同码率的灵活切换。译码基于简化和积译码算法得到的归一化最小和算法,并采用部分并行译码形式,在保证译码效率同时,兼顾 FPGA 资源消耗。硬件实现采用 FPGA 实现码长 12960 比特,码率 2/3,1/3 和 1/6 的 LDPC 码。     

适用于ATM网络的信噪比可分级变码率视频编解码方案

提出一种适用于ＡＴＭ网络的两层信噪比分级变码率视频编解码方案。编码的基本层是一个ＭＰＥＧ－２ＭＰＭＬ定码率编码器，增强层对基本层的量化误差进行细量化和变码率编码。     

WiMax系统中卷积Turbo码技术的研究

卷积Turbo码是很灵活的码字，帧长和码率的变化范围很大，这也是选它做为WiMax（world Intemperability for Microwave Access）标准中的信道编码方案之一的主要原因，它采用递归系统卷积码作为子码，相对于经典Turbo码，它具有编码效率高，相同复杂度译码器下纠错性能好以及译码时延小等优点。详细介绍了卷积Turbo码的编译码器结构，提出译码方案，并且给出仿真性能曲线。     

不规则Qc-LDPC编码在卫星导航系统中的应用研究

LDPC码作为一种接近香农极限的信道编码,近年来被广泛应用于卫星导航及通信领域。现代GPS系统L1C信号的电文已使用码率为1/2的不规则LDPC编码,提升系统的纠错性能。准循环Qc-LDPC编码是一种结构化LDPC码,具有构造简单,译码复杂度低,纠错性能优良等优点。本文对不同长度、不同码率的Qc-LDPC码的两种迭代译码算法的性能进行了仿真研究,研究结果可用于指导不同卫星导航系统导航电文的编译码设计,比如美国的GPS系统、欧洲的Galileo系统和中国的Compass系统。     

面向CCSDS标准的Turbo码的研究与仿真实现

Turbo码是一种性能优异且高效的信道编码方式,被空间数据系统咨询委员会(CCSDS)推荐为深空通信中可采用的信道编码方案之一。分析了Turbo码的编码和译码的基本原理,基于CCSDS给出的深空通信标准,设计并实现了Turbo码的编码和译码过程。通过Matlab软件仿真测试,初步探究了译码迭代次数、码率、译码算法等因素对误码率性能的影响,并对仿真结果进行了分析。     

卫星通信协议中卷积码序列译码的计算机模拟

主要研究卫星通信协议IESS 309协议中的系统卷积码的编码及其序列译码的计算机模拟。用C语言实现了码率为1／2的36位的系统卷积码的编码，然后模拟高斯噪声信道生成一个Fano度量表，最后用Fano算法实现该卷积码的软判决序列译码，并进行了性能分析，为以后的工程应用打下一个良好的基础。     

中长帧非规则LDPC码译码器的FPGA实现

LDPC(低密度奇偶校验码)是一种优秀的线性分组码,是目前距香农限最近的一类纠错编码。与Turbo码相比,LDPC码能得到更高的译码速度和更好的误码率性能,从而被认为是下一代通信系统和磁盘存储系统中备选的纠错编码。简要介绍了适于硬件实现的LDPC码译码算法,并基于软判决译码规则,使用Verilog硬件描述语言,在X ilinx V irtex2 6000 FPGA上实现了码率为1/2、帧长504bit的非规则LDPC码译码器。     

一种快速编码的半随机LDPC码构造研究

低密度奇偶校验码(LDPC码)具有逼近Shannon限的优异纠错性能,在信道编码领域的应用越来越广泛,但是LDPC码的编码复杂性一直是制约其普遍应用的突出问题。奇偶校验矩阵的结构则直接决定着LDPC码的编码复杂度和译码性能。提出一种准双对角线结构的半随机LDPC码奇偶校验矩阵的构造方法,它具有IEEE 802.16e标准LDPC码的优异纠错性能和低编码复杂度,同时在码率、码长、基础校验矩阵和扩展因子等设计方面更具灵活性,能更好地适应工程实践的需要。采用这种构造方法,以(16 384,8 192)LDPC码为例进行快速迭代编码,能够获得优异的译码性能,可以用于实现高速率低复杂度的LDPC译码器设计。     

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

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

GF(2p)LDPC编码的相位调制OFDM系统在瑞利衰落信道的性能

OFDM是一项能有效对抗高速无线通信中多径衰落的关键技术，为了进一步提高OFDM系统的误码性能，许多信道编码技术已被应用于OFDM系统中，二元域LDPC码以其近香农限的误码性能和较低的译码复杂度成为研究的热点。在AWGN信道下，多元域LDPC码比等效码长的二元域LDPC码有更好的纠错性能。本文提出了一种将多元域LDPC码经过MPSK调制后用于OFDM系统的新方法。仿真结果表明，在多径衰落信道下，通过合理选择多元LDPC码域的阶数和调制的方法，多元域LDPC编码的高阶调制OFDM系统比等效码长的二元域LDPC编码OFDM系统具有更好的性能，并且由于采用了多元域LDPC的快速BP译码，译码复杂度只是稍有增加。     

BER performance of turbo-coded PPM CDMA systems on optical fiber

We obtain upper bounds on the bit error rate (BER) for turbo-coded optical code-division multiple-access (CDMA) systems using pulse position modulation (PPM). We use transfer function bounding techniques to obtain these bounds, so our results correspond to the average bound over all interleavers of a given length. We consider parallel concatenated coding (PCC) schemes that use recursive convolutional codes as constituent codes. We consider systems using an avalanche photodiode (APD), and treat APD noise, thermal noise, and multi-user interference using a Gaussian approximation. We compare the performance of turbo-coded systems with that of BCH-coded systems with soft-decision decoding, and that of concatenated coding systems with outer Reed-Solomon (RS) code and inner convolutional code. We show that turbo-coded systems have better performance than BCH-coded systems. We also show that concatenated systems have better performance than turbo-coded systems when the block length is small and the received laser power is somewhat large     

Performance of chip coding in FFH SSMA systems

This paper proposes chip coding using convolutional codes for fast frequency-hopping spread-spectrum multiple-access (FFH-SSMA) systems. Its performance is evaluated and compared with that of repetition coding which is most commonly used in FFH systems. In our proposal, an information symbol is encoded by a convolutional code of rate 1/n and n chips are transmitted through a frequency hopper. We consider three models when perfect side information (PSI) is available, no side information (NSI) is available, and the ratio threshold test (RTT) is used. The probability density functions (PDFs) of the received signal are derived for asynchronous hopping systems. The performances of convolutional coding with threshold decoding and Viterbi decoding are presented under the constraint of fixed total bandwidth and information bit rate. In comparison with repetition codes, it is found that convolutional codes drastically enhance the system performance. It is identified that Viterbi decoding with RTT offers the most significant performance improvement     

基于QC-LDPC的水下激光通信编码技术

针对水下蓝绿激光远距离可靠通信的需求,文中提出了PPM与QC-LDPC相结合的调制编码通信方法.通过对不同码长、码率与PPM调制阶数的组合方案进行仿真,找出在不同SNR条件下的最优QC-LDPC编码与PPM调制的组合方案.文中介绍了经典PPM信号的原理与QC-LDPC码的基本结构,并通过MATLAB软件模拟实现PPM信...     

Performance of convolutional codes in a direct-detection opticalPPM channel

Several strategies for combining convolutional codes (CCs) and pulse position modulation (PPM) in a direct-detection optical channel are considered, including binary and 2ⁿ-ary PPM with rate-1/ n CCs, 2^m-ary PPM with a dual-m CC, and interleaved 2^L-ary PPM with a rate-1/n CC. In the latter case, J.L. Massey's (1981) concept of coding of L separate component channels constituting a 2^L-ary PPM erasure channel is carried out for both the ideal photon counting and the avalanche photodetection (APD) cases, providing a comparative evaluation of the various strategies in terms of bit error probability and achievable coding gain for different code structures and decoding schemes     

Probabilistic construction of large constraint length trellis codesfor sequential decoding

Probabilistic algorithms are given for constructing good large constraint length trellis codes for use with sequential decoding that can achieve the channel cutoff rate bound at a bit error rate (BER) of 10^-5-10^-6. The algorithms are motivated by the random coding principle that an arbitrary selection of code symbols will produce a good code with high probability. One algorithm begins by choosing a relatively small set of codes randomly. The error performance of each of these codes is evaluated using sequential decoding and the code with the best performance among the chosen set is retained. Another algorithm treats the code construction as a combinatorial optimization problem and uses simulated annealing to direct the code search. Trellis codes for 8 PSK and 16 QAM constellations with constraint lengths v up to 20 are obtained. Simulation results with sequential decoding show that these codes reach the channel cutoff rate bound at a BER of 10^-5-10^-6 and achieve 5.0-6.35 dB real coding gains over uncoded systems with the same spectral efficiency and up to 2.0 dB real coding gains over 64 state trellis codes using Viterbi decoding     

新型度分布的LT码在自由空间光通信中应用

由于自由空间光通信(FSO)受到大气湍流效应的影响,运用信道编码技术来保证FSO系统的稳定性。研究LT码原理,并将其引入FSO系统。分析LT码度分布需要满足的条件,引用泊松鲁棒孤子度分布来减小LT码译码开销、降低编译码复杂度,并应用于FSO系统来提高FSO系统性能。采用MATLAB进行仿真,比较泊松鲁棒孤子度分布与鲁棒孤子度分布的性能,并模拟在不同湍流信道中的FSO系统误码率。结果表明,泊松鲁棒孤子度分布具有较小的平均度值,能够减小LT的译码开销、降低编译码复杂度;且应用泊松鲁棒孤子度分布的LT码能够降低FSO系统中的误码率,保证FSO系统稳定。     

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

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

无线光通信中PPM的差错编码调制研究

文章推导了基于线性分组码的脉冲位置调制(PPM)通信系统纠错后的差错概率上限,分析了差错编码的纠错能力和PPM位分辨率的参数设置对差错性能的影响,并进行了仿真.结果表明,在纠错个数能被位分辨率整除时,PPM系统达到较高编码调制性能,同时指出适合PPM系统的纠错编码一般为高阶码.     

一种基于增强奇偶校验码级联极化码的新型编译码方法

极化码作为一种纠错码,具有较好的编译码性能,已成为5G短码控制信道的标准编码方案。但在码长较短时,其性能不够优异。提出一种基于增强奇偶校验码级联极化码的新型编译码方法,在原有的奇偶校验位后设立增强校验位,对校验方程中信道可靠度较低的信息位进行双重校验,辅助奇偶校验码在译码过程中对路径进行修剪,以此提高路径选择的可靠性。仿真结果表明,在相同信道、相同码率码长下,本文提出的新型编译码方法比循环冗余校验(cyclic redundancy check,CRC)码级联极化码、奇偶校验(parity check,PC)码级联极化码误码性能更优异。在高斯信道下,当码长为128、码率为1/2、误码率为10-3时,本文提出的基于增强PC码级联的极化码比PC码级联的极化码获得了约0.3dB增益,与CRC辅助的极化码相比获得了约0.4 dB增益。     

Turbo-coded optical direct-detection CDMA system with PPMmodulation

The performance of an optical code division multiple access (CDMA) system with turbo coding is analyzed and simulated. Turbo codes are parallel concatenated convolutional codes (PCCCs) in which the information bits are first encoded by a recursive systematic convolutional code, and then, after passing through an interleaver, are encoded by a second systematic convolutional encoder. Turbo coding is superimposed on an intensity-modulated optical channel with pulse-position modulation (PPM) and direct detection of the received optical signal, and the performance is evaluated in terms of an upper bound on bit error probability. From the simulation results, it is seen that turbo coding offers considerable coding gain over other methods, with reasonable encoding/decoding complexity. Also, it is demonstrated that, for a fixed code rate, the performance of the optical CDMA system can be substantially improved by increasing the interleaver length and the number of iterations. Serially concatenated convolutional codes (SCCCs) are also considered, and are shown to perform comparably to PCCC in general and better than PCCCs for the case of large signal photocounts. The results in this paper can be applied, for example, to indoor optical wireless LANs