基于置信度震荡的LDPC码译码算法研究

在采用基于对数似然比的置信度传递译码算法LLR-BP(Log-Likelihood Ratio Belief Propagation)对低密度奇偶校验码LDPC code(Low-density Parity-check code)译码时,变量节点对数似然比外信息ex-LLR(Extrinsic Log-Likelihood Ratio)的震荡会引起比特节点发生错误.文中分析了ex-LLR值和后验概率值(APP)产生震荡的原因及两者的关系,提出了减弱其对整个译码过程影响的两种改进译码算法.仿真结果表明,改进的译码算法在基本不增加译码复杂度的情况下,能够降低译码错误平层,进一步改善传统的LLR-BP译码算法的性能.     

一种M-FSK信号的能量度量Viterbi软译码算法性能分析

Viterbi译码算法广泛应用于无线数字通信系统,一般采用比特对数似然信息(LLR)作为译码器的输入。针对M-FSK信号,该文提出一种采用信号解调得到的M维能量信息,直接作为译码器分支度量值,并给出了相应的Viterbi译码算法。在加性高斯白噪声(AWGN)和瑞利(Rayleigh)衰落信道下对所提算法的BER性能进行了理论推导,得到了闭合表达式。通过仿真验证了理论推导的正确性,与常规Viterbi算法相比,所提算法避免了比特LLR和分支度量值的计算,降低了算法复杂度和减少了信息损失,提高了M-FSK信号软解调Viterbi译码算法的BER性能,是一种更适用于工程实现的M-FSK信号的Viterbi译码算法。     

基于电力线通信的LDPC码分层译码算法研究

针对电力线信道多径延迟效应和脉冲噪声影响问题,建立了基于电力线的LDPC-OFDM系统模型.并基于该模型,对低密度奇偶校验码(LDPC)的译码算法进行深入研究.基于最小和置信传播(Belief Propagation,BP)译码算法原理,改进分层和积译码算法,提出一种基于修正因子的分层最小和对数似然比译码算法.仿真结果表明,该算法译码复杂度低,迭代收敛速度快,能够有效降低电力线LDPC-OFDM系统的误码率(BER),提高传输效率.     

引入行重参数的改进不规则LDPC码译码算法

低密度奇偶校验(LDPC)码是一种逼近香农极限 的线性分组码,而好的非规则LDPC 码其性能优于同码率的规则码。在非规则LDPC码的对数似然比置信传播(LLR-BP)译码算 法中,由于行重大小的不同,校验节点对伪后验判决贡献的外部信息不同,为此提出一种基 于行重的改进LLR-BP译码算法,该算法引入行权重系数,用以调整不同行重外部信息的作 用,提高了系统的译码性能。仿真结果表明:在低信噪比时,改进的LLR-BP译码算法对译 码性能与标准的LLR-BP译码算法的性能几乎相同;在中高信噪比时,改进的LLR-BP译码 算法的误码性能优于LLR-BP译码算法,在码长为64,误码率是10－5时,改进LLR- BP译码算法较之传统LLR-BP译码算法的编码增益提高了0.15 dB。     

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

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

基于对数域的多进制LDPC码改进译码算法

为了进一步降低多进制LDPC码译码的复杂度,分析了扩展最小和算法(EMS)存在的不足,提出了一种基于对数域的多进制LDPC码的改进译码算法.该算法一方面根据每次迭代中变量节点的概率分布对的平均方差自适应选择FHT的阶数;另一方面算法中校验节点的更新运算由乘法转化为基于对数域上的加法运算,从而更易于硬件实现.仿真结果表明,与EMS算法相比,该算法性能与收敛速率均有明显改进.     

LDPC码的高效译码算法研究

LDPC码即低密度奇偶校验码(Low Density Parity Check Code,LDPC),它是一类具有稀疏校验矩阵的线性分组码,不仅有逼近Shannon限的良好性能,而且译码复杂度较低,结构灵活,是近年信道编码领域的研究热点,目前已广泛应用于深空通信、光纤通信、卫星数字视频和音频广播等领域。Mackay-Neal算法是基于LDPC码的BP译码简化算法,但仍存在大量乘法运算。为了降低译码算法的运算量,基于Mackay-Neal算法提出一种改进的对数和积译码算法。最后通过计算量复杂度分析结果表明,改进后的对数和积译码算法更简单,运算量大大降低,易于硬件的实现。     

卷积码差分跳频系统抗部分频带干扰的性能

基于对无编码差分跳频系统抗部分频带干扰性能的研究,将卷积码引入差分跳频系统,研究了在有精确干扰状态信息的情况下,采用无迭代译码和迭代译码时相对于无编码系统的性能改善.同时,在无法得到精确干扰状态信息的情况下,提出了一种迭代干扰状态估计及译码算法.理论分析结果表明:在有精确干扰状态信息的情况下,采用卷积纠错编码和无迭代译码,对可用频率数为8的差分跳频系统,当比特误码率(BER)为10~(-6)时,性能改善约为2.5dB;而采用迭代译码,当BER为10~(-10)时,相对于无迭代译码,性能可进一步改善6dB.仿真结果则验证了迭代估计及译码算法的正确性,采用该算法可使编码系统在无精确干扰状态信息的情况下,仍能保持良好的抗干扰能力.     

两种改进的LDPC译码算法

低密度校验码是一种基于稀疏校验矩阵的线性码,LDPC的性能接近Shannon限,并具有简单有效的迭代译码算法[1,2]。针对LDPC原始的置信传播迭代译码算法,文中分别从概率似然以及对数似然的角度对该算法进行改进,改进后的这两种译码算法译码更简单,且其运算量大大降低。     

光通信中基于分组Turbo码的一种改进Chase译码算法

为了适应光通信发展的要求,依据分组Turbo码(BTC)传统Chase译码算法的分析,提出了一种基于不对等可靠位数的改进新译码算法。使用该算法在每次迭代时将产生一个可靠度参数对外部信息进行修正,从而提高BTC的译码性能。仿真结果表明:在误码率(BER)为10-5且迭代4次的情况下,新BTC译码算法与传统Chase译码算法相比,其净编码增益(NCG)提高了0.9dB,并且在最差情况下给系统增加的译码复杂度都不大。     

The Minimum Decoding Delay of Maximum Rate Complex Orthogonal Space–Time Block Codes

The growing demand for efficient wireless transmissions over fading channels motivated the development of space-time block codes. Space-time block codes built from generalized complex orthogonal designs are particularly attractive because the orthogonality permits a simple decoupled maximum-likelihood decoding algorithm while achieving full transmit diversity. The two main research problems for these complex orthogonal space-time block codes (COSTBCs) have been to determine for any number of antennas the maximum rate and the minimum decoding delay for a maximum rate code. The maximum rate for COSTBCs was determined by Liang in 2003. This paper addresses the second fundamental problem by providing a tight lower bound on the decoding delay for maximum rate codes. It is shown that for a maximum rate COSTBC for 2m - 1 or 2m antennas, a tight lower bound on decoding delay is r = (_m-1 ^2m) . This lower bound on decoding delay is achievable when the number of antennas is congruent to 0, 1, or 3 modulo 4. This paper also derives a tight lower bound on the number of variables required to construct a maximum rate COSTBC for any given number of antennas. Furthermore, it is shown that if a maximum rate COSTBC has a decoding delay of r where r < r les 2r, then r=2r. This is used to provide evidence that when the number of antennas is congruent to 2 modulo 4, the best achievable decoding delay is 2(_m-1 ^2m_).     

一种低复杂度双二元卷积Turbo码译码算法

双二元卷积Turbo码（ DB CTC)的非二进制编码使得译码复杂度增加,限制了其在某些实际通信工程中的使用。在最大后验概率（ MAP)译码算法的基础上,提出了一种优化算法,将译码的存储量和计算量降为原来的1/4。仿真结果表明：在不同编码长度和码率的情况下,优化算法与原算法性能相当;在误码率为10-5的条件下,两者的Eb/N0差异同样不大于0.1 dB。     

Decorrelating Detectors for a Dual Rate Synchronous DS/CDMA System

This paper addresses the use of decorrelating detectors for a dual rate DS/CDMA system that serves both low bit rate and high bit rate users. We assume that in an interval of duration T ₀, a low rate user transmits one bit while a high rate user transmits M bits. Applying a standard decorrelator to the interval of duration T ₀ yields an M bit processing delay for high rate users and a computational complexity that grows with M. In this paper, we propose a decorrelator that generates bit decisions for each high rate user in every subinterval of duration T_0/M. To decode a low rate user, a soft decoding rule applies maximal ratio combining on M separate decorrelated outputs of each low rate user. The soft decoding dual rate decorrelator eliminates the bit processing delay for high rate users and also reduces the computational complexity of a standard decorrelator. Further, it is shown that the asymptotic efficiency of the standard decorrelator is greater than or equal to the proposed decorrelator. By evaluation, it is observed that when the signature sequences have good correlation properties, the proposed soft decoding decorrelator is found to perform nearly as well as the standard decorrelator. However, when the signature sequences have high cross-correlation, then the proposed decorrelator suffers in terms of bit error rate while retaining the near-far resistance property.     

The Final Case of the Decoding Delay Problem for Maximum Rate Complex Orthogonal Designs

Complex orthogonal space-time block codes (COSTBCs) based on generalized complex orthogonal designs (CODs) have been successfully implemented in wireless systems with multiple transmit antennas and single or multiple receive antennas. It has been shown that for a maximum rate COD with 2m-1 or 2m columns, a lower bound on decoding delay is (_m-1 ^2m) and this delay is achievable when the number of columns is congruent to 0, 1 , or 3 modulo 4. In this paper, the final case is addressed, and it is shown that when the number of columns is congruent to 2 modulo 4, the lower bound on decoding delay cannot be achieved. In this case, the shortest decoding delay a maximum rate COD can achieve is twice the lower bound. New techniques for analyzing CODs are introduced with connections to binary vector spaces.     

Generalised rate N/(N+1) codes

A generalised construction of rate M(N+1) run-length limited codes is presented. The (d, k, l, r) constraints are (0, N/4+1, N/8: N/8). Encoding and decoding based on the use of multiple pivot bits are described. The encoding and decoding are systematic enough to allow the writing of software to generate efficient logic equations for different N. The logic equations can be further minimised using an automatic synthesis tool     

Bounds on a probability for the heavy tailed distribution and the probability of deficient decoding in sequential decoding

Although sequential decoding of convolutional codes gives a very small decoding error probability, the overall reliability is limited by the probability P_G of deficient decoding, the term introduced by Jelinek to refer to decoding failures caused mainly by buffer overflow. The number of computational efforts in sequential decoding has the Pareto distribution and it is this "heavy tailed" distribution that characterizes P_G. The heavy tailed distribution appears in many fields and buffer overflow is a typical example of the behaviors in which the heavy tailed distribution plays an important role. In this paper, we give a new bound on a probability in the tail of the heavy tailed distribution and, using the bound, prove the long-standing conjecture on P_G, that is, P_G ap constanttimes1/(sigma^rhoN^rho-1) for a large speed factor sigma of the decoder and for a large receive buffer size N whenever the coding rate R and rho satisfy E(rho)=rhoR for 0 les rho les 1     

基于迭代处理的PCMA混合信号解调/译码算法

针对成对载波多址信号的分离,在实现信道参数估计且完成干扰抵消的基础上,该文利用信道编码信息提出一种联合线性最小均方误差(Minimum Mean-Square Error, MMSE)均衡和软译码的迭代解调/译码算法。该算法在均衡过程中利用译码后反馈的先验统计量来改善解调性能,重点研究了均衡与译码间的信息交互以及参数估计误差对解调性能的影响。仿真结果表明,对子码为(64,57,4)扩展BCH码的Turbo乘积码(Turbo Product Codes, TPC),采用QPSK调制且误比特率为10-3时,经过2次迭代能获得近4 dB的信噪比增益;采用8PSK调制且Es/N0大于20 dB时,经过2次迭代能将误比特率至少提升2个数量级。     

Performance comparison of proposed 3-d coherent spatial-phase-time coding/decoding with super structured fiber Bragg grating-based optical CDMA systems

In this paper, performance comparison in terms of bit error rate (BER) of proposed WDM compatible optical CDMA system incorporating 3-D spectral-phase-time encoding/decoding to a 7 chip-super-structured fiber Bragg grating (SSFBG)-based optical code division multiple access (OCDMA) system is investigated. Coding and decoding using binary [0, π] phase chips is demonstrated for six users at 5 Gb/s, and a single coded signal is separated with acceptable bit-error rate ≤10^?9. In our proposed optical CDMA system encoding and decoding is done by converting hadamard codes (used for conventional CDMA system) to phase codes. It is then compared with two optical pulse retiming and reshaping systems incorporating super structured fiber Bragg gratings (SSFBGs) as pulse shaping elements. Simulation results show that with all input bands having same sample rate, size data rates our proposed codes with even larger number of channels perform better in terms of eye opening & BER.     

Linear-time encodable/decodable codes with near-optimal rate

We present an explicit construction of linear-time encodable and decodable codes of rate r which can correct a fraction (1-r-/spl epsiv/)/2 of errors over an alphabet of constant size depending only on /spl epsiv/, for every 00. The error-correction performance of these codes is optimal as seen by the Singleton bound (these are "near-MDS" codes). Such near-MDS linear-time codes were known for the decoding from erasures; our construction generalizes this to handle errors as well. Concatenating these codes with good, constant-sized binary codes gives a construction of linear-time binary codes which meet the Zyablov bound, and also the more general Blokh-Zyablov bound (by resorting to multilevel concatenation). Our work also yields linear-time encodable/decodable codes which match Forney's error exponent for concatenated codes for communication over the binary symmetric channel. The encoding/decoding complexity was quadratic in Forney's result, and Forney's bound has remained the best constructive error exponent for almost 40 years now. In summary, our results match the performance of the previously known explicit constructions of codes that had polynomial time encoding and decoding, but in addition have linear-time encoding and decoding algorithms.     

用普通基比特串行乘法电路实现(204, 188)RS码译码

用普通基比特串行乘法电路实现数字视频广播(DVB)中(204,188)RS码译码,使电路大大简化,并保持译码速率与视频信号比特和码速率一致,电路整齐规则,便于FPGA实现或专用集成电路设计,具有推广实用价值。