Truncated Turbo Decoding with Reduced Computational Complexity

The concept of concatenated codes and turbo decoding is well known and leads to a remarkably good performance in many applications. The resulting signal processing for this concept shows high complexity relative to conventional Viterbi decoding. This paper, therefore, considers an alternative concept of turbo decoding to reduce the computational complexity. In thiscase, those sections of the sequence to be decoded, where changes of bit decisions (compared to the previous iteration step) are very unlikely,are excluded from the soft-output viterbi algorithm (SOVA). This decoding is much easier to process and the loss of bit error rate (BER) performance isquite small or even negligible in comparison to conventional turbo decoding.     

A novel decoding algorithm based on the hierarchical reliable strategy for SCG-LDPC codes in optical communications

An effective hierarchical reliable belief propagation （HRBP） decoding algorithm is proposed according to the struc- tural characteristics of systematically constructed Gallager low-density parity-check （SCG-LDPC） codes. The novel decoding algorithm combines the layered iteration with the reliability judgment, and can greatly reduce the number of the variable nodes involved in the subsequent iteration process and accelerate the convergence rate. The result of simulation for SCG-LDPC（3969,3720） code shows that the novel HRBP decoding algorithm can greatly reduce the computing amount at the condition of ensuring the performance compared with the traditional belief propagation （BP） algorithm. The bit error rate （BER） of the HRBP algorithm is considerable at the threshold value of 15, but in the sub- sequent iteration process, the number of the variable nodes for the HRBP algorithm can be reduced by about 70% at the high signal-to-noise ratio （SNR） compared with the BP algorithm. When the threshold value is further increased, the HRBP algorithm will gradually degenerate into the layered-BP algorithm, but at the BER of 10-7 and the maximal iteration number of 30, the net coding gain （NCG） of the HRBP algorithm is 0.2 dB more than that of the BP algo- rithm, and the average iteration times can be reduced by about 40% at the high SNR. Therefore, the novel HRBP de- coding algorithm is more suitable for optical communication systems.     

Sequential message-passing decoding of LDPC codes by partitioning check nodes

In this paper, we analyze the sequential message- passing decoding algorithm of low-density parity-check (LDPC) codes by partitioning check nodes. This decoding algorithm shows better bit error rate (BER) performance than the conventional message-passing decoding algorithm, especially for the small number of iterations. Analytical results indicate that as the number of partitioned subsets of check nodes increases, the BER performance is improved. We also derive the recursive equations for mean values of messages at check and variable nodes by using density evolution with a Gaussian approximation. From these equations, the mean values are obtained at each iteration of the sequential decoding algorithm and the corresponding BER values are calculated. They show that the sequential decoding algorithm converges faster than the conventional one. Finally, the analytical results are confirmed by the simulation results.     

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

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

光传输系统中一种新颖的SCG-LDPC码译码算法分析

依据SCG-LDPC码的结构特点提出了一种高效的分层可靠置信传播(HRBP)译码算法,该算法结合分层迭代与可靠度判决测量有效降低后续迭代过程中的变量节点数,同时加快了收敛速度。针对适用于光传输系统的SCG-LDPC(3 969,3 720)码进行仿真,仿真结果表明HRBP算法与传统的BP算法相比,在保证性能的同时大大降低了运算量,在阈值为15时,HRBP译码算法误码率性能与BP译码算法相当,但是后续迭代的变量节点数在高信噪比下相比BP译码算法减少约69%,当阈值进一步增大时,HRBP算法将逐步退化为分层置信传播(Layered-BP)译码算法。     

A novel RS BTC coding scheme for optical communications

A novel Reed Solomon(RS) block turbo code(BTC) coding scheme of RS(63,58)×RS(63,58) for optical communications is proposed.The simulation results show that the net coding gain(NCG) of this scheme at the sixth iteration is more than that of other coding schemes at the third iteration for the bit error rate(BER) of 10-12.Furthermore,the novel RS BTC has shorter component code and rapider encoding and decoding speed.Therefore,the novel RS BTC coding scheme can be better used in high-speed long-haul optical communication systems,and the novel RS BTC can be regarded as a candidate code of the super forward error correction(super-FEC) code.Moreover,the encoding/decoding design and implementation of the novel RS BTC are also presented.     

一种新的终止LDPC迭代译码算法

在传统的卫星广播系统中,信道纠错通常采用BCH码级联LDPC码的方案以达到良好的误码率性能,例如DVB-S2系统。作为内码的LDPC码通常采用迭代译码,且迭代次数较高才能实现比较好的系统性能。借助BCH级联LDPC的结构,文中提出了将BCH检错嵌套进LDPC每一次迭代译码过程中的新的迭代译码结构。仿真结果表明,新算法以较低的BCH码检错运算复杂度换取了LDPC码迭代次数的明显下降,从而极大降低了迭代译码总体复杂度和译码时延,且整体纠错性能与原始LDPC译码后BCH纠错的算法相比基本保持不变。     

之型码和级联之型码

本文介绍了一种新型的纠错码，称之为“之型码”。之型码可以形成非常简捷的软输入/软输出译码规则，我们在Max-Log-MAP(MLM)译码方法的基础上提出了一种译码规则，这一译码规则的计算复杂度为每次迭代计算单位信息比特大约需要20次加法运算操作。在仿真实验中，我们用最优译码器和更简捷的次最优译码器进行译码时，其性能在误比特率为10^-5处分别距香农理论极限仅0.9dB和1.4dBH。此外，上述码字与2维turbo码相比具有更低的误码基底值（error floor）。     

Hierarchical SIR and rate control on the forward link for CDMA datausers under delay and error constraints

We study the signal-to-interference ratio (SIR) and rate control for code division multiple access (CDMA) data users on the forward link under average or peak power constraints. The quality of service (QoS) for data users is specified by delay and error rate constraints as well as a family of utility functions representing the throughput and fairness among the data users. It is found that the optimal SIR and rate control algorithm has a hierarchical structure which can be easily implemented in a distributed manner. The SIR targets can be adjusted independently by the mobiles using information specific to the individual users. The data rates can be adjusted jointly by the base station based on limited feedback from the mobiles. We also propose a two-level iteration algorithm for both the mobile and the base station to efficiently compute the SIR and data rates. Our results show that a flexible tradeoff between total system throughput (sum of rates achieved) and fairness (similarity in data rates) can be achieved by choosing appropriate utility functions used in this scheme     

串行级联卷积码在AWGN信道上的性能分析

文中对串行级联卷积编码（Serial Concatenated Convolutional Code,SCCC）的原理和结构进行了详细的分析,并对其在低信噪比条件下通过AWGN信道时的纠错能力进行了仿真研究。仿真结果表明,在相同信噪比的情况下,交织器的交织长度和接收端译码算法的迭代次数都对系统误码率有很大影响,并给出了合适的交织长度和迭代次数,从而以较小的代价获得更好的译码性能。     

Reducing average number of turbo decoding iterations

The average number of decoding iterations in a turbo decoder is reduced by incorporating CRC error detection into the decoding iteration process. Turbo decoding iterations are stopped when CRC decoding determines that there is no error in the decoded data sequence. Computer simulations assuming a turbo-coded W-CDMA mobile radio reverse link under frequency selective Rayleigh fading demonstrate that when the maximum number of iterations is 8, the average number of decoding iterations can be reduced to 1/4 at BER=10^-6     

应用于无人机测控传输系统的多元LDPC码

针对无人机巡查区域地理环境复杂、信道特性多变、突发衰减严重的问题,设计了一种基于多元低密度奇偶校验( Q-LDPC)码的无人机测控传输系统。为减小置信传播( BP)类译码算法中振荡变量节点引入的错误传播,采用加权因子校正迭代前后的变量信息,从而减小短环对遥测、遥控等中短码字译码性能的影响,提高无人机测控传输系统可靠性。基于突发衰减信道建立系统仿真模型,仿真结果表明,所提方案通过将连续的突发比特错误转换为数量较小的符号错误,能够有效抵御快速衰落,降低误码率,为无人机对地观测提供安全保障。     

BER analysis of convolution coded QDPSK, in digital mobile radio

The bit error rate (BER) performance of convolutional coded quaternary differential phase-shift keying (QDPSK) with Viterbi decoding is theoretically investigated in Rayleigh fading environments. The probability density functions of the path and branch metric values of Viterbi decoding are derived. The BERs after decoding due to additive white Gaussian noise and cochannel interference are theoretically analyzed. Rate 1/2 codes and their symbol punctured high-rate codes are considered, and the symbol positions for deletion to minimize the BER after decoding are presented for the codes with a constraint length K=3-7. It is shown that Viterbi decoding considerably reduces the desired signal-to-interference power ratio as well as the signal energy per information bit-to-noise power spectrum density ratio necessary to achieve a certain BER. The spectrum efficiency of the cellular mobile radio system, achievable by the use of the symbol punctured codes, is also evaluated     

一种自适应线性分散码方案的性能研究

针对线性分散码复杂度较高的问题,提出一种自适应线性分散码(ALDC),并将其应用于协作通信网络.该码可以根据当前信道状态,自适应地选择不同的调制阶数和分散矩阵,以在不同信噪比下获得最优的误码率性能,同时降低译码复杂度.分析了该码在协作系统中的编码与译码,并在误比特率性能上与传统空时分组码和LDC进行了仿真对比.结果表明,ALDC的误码率性能要优于传统的正交空时分组码和LDC,且译码复杂度较低.     

Transmitter Power Control with Adaptive Safety Margins Based on Duration Outage

Transmitter power control in cellular networks is principally used to maintaina stable voice quality and to improve bandwidth utilization. There are twomain types of quality based power control algorithms that have been extensivelystudiedin the literature and implemented in practice. One is the Signal toInterferenceRatio (SIR) based algorithms, and the other is the Bit Error Rate(BER) basedalgorithms. Several practical issues however, were left open in the algorithms that havebeen proposed in the literature. The most critical issue in the SIR-basedalgorithms is how to determine the SIR target parameter; and the most critical one in theBER-basedalgorithms is how to derive good BER estimators in light of the rareoccurrences of erroneous bits. Another issue that is shared by both algorithm types is thefunctional relation between the BER and the SIR. This relationship is required as one mayserve as a control valve and the other as a control objective. Determining the SIR target control parameter (in SIR or BER based algorithms) involves more than just a static transformation between the BER and the SIR.Sincethe actual SIR values is a stochastic process in nature, its variation andtimecorrelation must be accounted for. This paper addresses the problems described above by evaluating a durationoutage probability of the underlying time process of the SIR values. Weshow that this probability can reasonably be approximated by a simple expressionthat relates between the duration outage probability and the SIR targetcontrolparameter. The distributed algorithm that is implied by this method is adurationoutage based power control that uses an estimator for the most likelyevent (incontrast to BER-based algorithms).     

LDPC码的一种高效加权比特翻转译码算法

针对低密度奇偶校验(LDPC)码中加权比特翻转(WBF)译码算法在迭代过程中绝大多数情况都是进行单比特翻转,导致译码效率低并且可能会发生比特翻转"死循环"的现象,提出一种更为高效的加权比特翻转(EWBF)算法.该算法对翻转阈值进行了改进,使得每次迭代能够翻转多个比特,提高译码效率,并且能够避免译码过程出现的翻转"死循环"现象.仿真结果表明,所提译码算法与WBF算法、改进的WBF(MWBF)算法和IMWBF(Improved MWBF)算法相比,平均迭代次数分别降低51.6%~56.2%、49.6%~54.2%和48.1%~51.3%;而在译码性能方面,算法性能接近甚至优于IMWBF算法,当最大迭代次数设定为30次时,相比于IMWBF算法,在误码率为10-4时可获得0.92 dB的增益.     

Simple stopping criterion for turbo decoding

A simple and effective criterion for stopping the iteration process in turbo decoding with negligible degradation of the error performance is presented. The new, improved hard-decision-aided (IHDA) extends the existing hard-decision-aided (HDA). Unlike the HDA, it requires no extra data storage, while achieving similar performance in terms of the BER and average number of iterations     

SCMA场景下的极化码编解码方案改进研究

极化码是目前唯一一种被证明可达到信道容量的编码方式,稀疏码分多址接入(Sparse Code Division Multiple Access,SCMA)可以提高频谱资源的利用率和接入系统的用户接入数量。为了提升SCMA与极化码的联合系统的误码率性能和译码时延,使联合系统的应用越来越广泛,提出了2种降低译码复杂度的方式:简化的左信息更新方式和剪枝译码算法。简化的左信息更新方式对于N=256,N=1024的极化码分别能降低37.6%和44.6%的存储资源占用数;剪枝译码算法在码率为0.5时能降低50%左右的计算复杂度。基于简化的SCAN算法改进了联合检测译码算法,在接收机采用外循环迭代的结构,引入了阻尼机制,选取最优的阻尼方式和最优阻尼值。仿真分析了所提联合检测译码算法与原有联合检测译码算法的误码率性能差异,外迭代接收机性能与内外双循环迭代的接收机性能相同,采用阻尼机制联合接收机的性能比无阻尼接收机的性能高0.8 dB左右,SJIDD的误帧率性能比保留宽度为32的SCLJDD的性能低0.7 dB左右,但能使接收机处理时延降至原来的1/4~1/8。     

光通信系统中一种新颖FEC码的仿真分析

基于分组Turbo码（BTC）提出光通信系统中一种新颖前向纠错（FEC）码型,即RS（63,60）×RS（63,60）码。仿真表明,在误码率为10-12时,迭代8次的该BTC与ITU-T G.975.1中迭代3次的RS（255,239）＋CSOC（k0/n0=6/7,J=8）相比,其净编码增益要相应增加0.34dB。分析表明该BTC具有分量码短、编/译码速度快的特点,不仅减小了软/硬件实现的复杂度,而且减小了编/译码带来的时延。因而该新BTC能较好地适用于光通信系统。     

基于模型驱动辅助MPA的SCMA多用户检测算法

稀疏码分多址接入(Sparse Code Multiple Access,SCMA)作为有应用前景的空口技术,在高吞吐量以及大规模连接中极具优势。针对SCMA通信系统中接收端消息传递算法(Message Passing Algorithm,MPA)计算复杂度较高的问题,提出了基于模型驱动辅助MPA法(Model driven Assisted MPA,MD MPA)的SCMA多用户检测算法。MD MPA在MPA算法迭代过程中节点更新后的信息矩阵和输出的概率矩阵之后添加权重参数,并通过神经网络训练更新参数。经训练所得权重参数可加快算法收敛速度,降低误码率,获得更佳的译码效果。仿真结果表明,MD MPA相较于MPA算法,误码率降低了20%,复杂度降低了33%。