A novel construction scheme of QC-LDPC codes based on the RU algorithm for optical transmission systems

A novel lower-complexity construction scheme of quasi-cyclic low-density parity-check (QC-LDPC) codes for optical transmission systems is proposed based on the structure of the parity-check matrix for the Richardson-Urbanke (RU) algorithm. Furthermore, a novel irregular QC-LDPC(4 288, 4 020) code with high code-rate of 0.937 is constructed by this novel construction scheme. The simulation analyses show that the net coding gain (NCG) of the novel irregular QC-LDPC(4 288,4 020) code is respectively 2.08 dB, 1.25 dB and 0.29 dB more than those of the classic RS(255, 239) code, the LDPC(32 640, 30 592) code and the irregular QC-LDPC(3 843, 3 603) code at the bit error rate (BER) of 10-6. The irregular QC-LDPC(4 288, 4 020) code has the lower encoding/decoding complexity compared with the LDPC(32 640, 30 592) code and the irregular QC-LDPC(3 843, 3 603) code. The proposed novel QC-LDPC(4 288, 4 020) code can be more suitable for the increasing development requirements of high-speed optical transmission systems.     

Turbo码的一种全新的SOVA译码算法

SOVA算法因其译码时延低于MAP算法已成为Turbo码的实用译码算法。本文提出了一种放弃软判决值更新处理的全新的SOVA算法。该算法的独到之处在于,综合利用对栅格图的正向和反向搜索,从而实现了通过全局路径比较来产生软输出值。仿真结果表明,与传统SOVA算法相比这种全新的SOVA算法在不会明显增加译码计算量的前提下,显著地改善了译码性能。同时,其误码率性能在高信噪比时略优于Max-Log-MAP算法,并且已经逼近MAP算法。     

A novel BTC decoding algorithm based on the genetic algorithm in optical communication systems

Combining the advantages of both the genetic algorithm （GA） and the chase decoding algorithm, a novel improved decoding algorithm of the block turbo code （BTC） with lower computation complexity and more rapid decoding speed is proposed in order to meet the developing demands of optical communication systems. Compared with the traditional chase decoding algorithm, the computation complexity can be reduced and the decoding speed can be accelerated by applying the novel algorithm. The simulation results show that the net coding gain （NCG） of the novel BTC decoding algorithm is 1.1 dB more than that of the traditional chase decoding algorithm at the bit error rate （BER） of 10^-6. Therefore, the novel decoding algorithm has better decoding correction-error performance and is suitable for the BTC in optical communication systems.     

基于PD-CNN的Polar码译码算法

针对传统Polar码译码算法在相关噪声信道下性能严重下降的问题,提出了一种基于前置预判-卷积神经网络（Prior Decision-Convolutional Neural Networks,PD-CNN）的译码算法。通过前置预判深度优化CNN,使其准确地估计信道噪声并使残余噪声尽可能遵循高斯分布,再根据残余噪声分布统计更新出可靠的似然比信息。分析了不同译码算法对不同码率Polar码在不同噪声相关强度下的译码性能,并与本文所提出的译码算法进行对比。仿真结果表明:在相关噪声信道下,当误码率为10-5时,本文所提出的译码算法与标准置信度传播算法相比可获得约2.5 Bd的增益。此外,在高信噪比时,与置信度传播-卷积神经网络算法相比,本文提出的译码算法具有相同的性能,但复杂度更低,译码延迟最大可减少42%。      

A new construction method of LDPC codes for optical transmission systems

Based on the construction method of systematically constructed Gallager (SCG)(4,k) code,a new improved construction method of low density parity check (LDPC) code is proposed.Compared with the construc...     

A new decoding algorithm for geometrically uniform trellis codes

A new decoding algorithm for geometrically uniform trellis codes is presented. The group structure of the codes is exploited in order to improve the decoding process. Analytical bounds to the algorithm performance and to its computational complexity are derived. The algorithm complexity does not depend on the number of states of the trellis describing the code. Extensive simulations yield results on the algorithm performance and complexity, and permit a comparison with the Viterbi algorithm and the sequential Fano algorithm     

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.     

一种基于球形译码的分层空时译码算法

为了进一步降低分层空时接收机的球形译码复杂度,提出了一种分组球形译码算法.接收对信号矢量的分量进行分组,每个分组内部采用球形译码算法进行检测,而各个分组之间通过判决反馈的方式进行干扰抵消.由于在各个分组内部进行球形译码,大大降低了最坏情况下的计算量,从而简化了接收机复杂度.计算机仿真结果表明,新算法能够明显的降低接收机译码过程的计算量.     

一种改进的无线光通信LDPC码译码算法

针对无线光通信中低密度奇偶校验码(LDPC)置信传播(BP)译码算法复杂度高及置信度振荡造成译码错误等缺点,基于对数BP算法提出了一种改进的译码算法。改进的译码算法在校验节点运算时,判断输入到校验节点消息的最小值与某个门限的大小,根据比较结果,分别用消息最小值或若干个最小值进行运算,在损失很少性能的情况下降低了运算复杂度;同时在比特节点采用振荡抵消处理运算,提高了算法的性能增益。最后在对数正态分布湍流信道模型下,分别对比特充分交织和交织深度为16的情况进行了仿真实验。仿真结果表明,改进的译码算法与BP算法相比,大幅度降低了计算复杂度,而且译码性能有一定的优势,收敛速度损失很少;而相对于最小和算法,改进的算法虽然译码复杂度有所增加,但误码率性能有明显的优势,并且收敛速度也优于最小和算法。因此,改进的译码算法是无线光通信中LDPC码译码算法复杂度和性能之间一个较好的折中处理方案。     

A new adaptive two-stage maximum-likelihood decoding algorithm for linear block codes

In this paper, we propose a new two-stage (TS) structure for computationally efficient maximum-likelihood decoding (MLD) of linear block codes. With this structure, near optimal MLD performance can be achieved at low complexity through TS processing. The first stage of processing estimates a minimum sufficient set (MSS) of candidate codewords that contains the optimal codeword, while the second stage performs optimal or suboptimal decoding search within the estimated MSS of small size. Based on the new structure, we propose a decoding algorithm that systematically trades off between the decoding complexity and the bounded block error rate performance. A low-complexity complementary decoding algorithm is developed to estimate the MSS, followed by an ordered algebraic decoding (OAD) algorithm to achieve flexible system design. Since the size of the MSS changes with the signal-to-noise ratio, the overall decoding complexity adaptively scales with the quality of the communication link. Theoretical analysis is provided to evaluate the potential complexity reduction enabled by the proposed decoding structure.     

A modified Min Sum decoding algorithm based on LMMSE for LDPC codes

A new modified Min Sum decoding algorithm based on parameter estimation theory for Low Density Parity Check (LDPC) codes is presented in this paper. First, Linear Minimum Mean Square Error (LMMSE) estimate criterion is used to model the magnitude of check-to-variable message and calculate estimated parameters, furthermore the golden section search algorithm is used to speed up getting the boundary, with which the parameters can be determined. Then, the parameters are modified further on the basis of the relationship between the iteration number and the estimated parameters. Finally, the same estimated parameters are used for different signal to noise ratio (SNR) to ensure the decoding performance and reduce the hardware complexity. The simulation results show that a gain of 0.3–0.5 dB can be achieved in comparison with other kinds of modified Min Sum algorithms, which is very close to that of BP algorithm. What's more, the algorithm has the following characteristics: low computation complexity, small decoding delay, easiness of calculation for estimated parameters, and simplicity in hardware implementation.     

一种基于改进线性规划的LDPC码混合译码算法

与基于消息迭代的置信传播译码相比,线性规划(linear programming,LP)译码分析有限长LDPC码性能更为有效。然而,传统LP译码算法运算量非常大,不利于系统实现。本文结合LDPC码校验矩阵的特点,去掉传统LP译码中不必要的约束,得到一种低复杂度LP内点译码算法。为了降低译码延时,将LP内点译码算法与置信传播译码算法结合,提出LDPC码混合译码算法。仿真结果表明,混合译码算法的误码性能优于传统LP译码和BP译码算法,而译码延时低于传统LP译码。     

A decoding algorithm for finite-geometry LDPC codes

In this paper, we develop a new low-complexity algorithm to decode low-density parity-check (LDPC) codes. The developments are oriented specifically toward low-cost, yet effective, decoding of (high-rate) finite-geometry (FG) LDPC codes. The decoding procedure updates iteratively the hard-decision received vector in search of a valid codeword in the vector space. Only one bit is changed in each iteration, and the bit-selection criterion combines the number of failed checks and the reliability of the received bits. Prior knowledge of the signal amplitude and noise power is not required. An optional mechanism to avoid infinite loops in the search is also proposed. Our studies show that the algorithm achieves an appealing tradeoff between performance and complexity for FG-LDPC codes.     

Turbo码的Taylor-Log_MAP译码算法

以Turbo码基本理论和算法为基础,依据无线信息传输的实际要求和Taylor级数的基本原理,提出了一种Turbo码的Taylor-Log-MAP高效译码算法。该算法对基本的Log-MAP算法中K运算利用Taylor级数进行展开,针对实际的信道需求对展开式进行截断,实现了Turbo码的最佳译码。与传统的对数域最大后验概率译码算法相比,该算法基本保持了优良的译码性能,同时避免了复杂的对数运算,减小了运算量。仿真结果表明,与现有的RS码性能相比,使用Turbo码可以获取5 dB的信噪比增益。     

基于整数运算的LDPC码最小和译码算法

对低密度奇偶校验码(LDPC)在高斯信道下的译码算法进行了深入研究,提出了一种基于整数运算的最小和译码算法.在该算法中所有变量都用固定长度的整数表示,因此非常便于硬件实现,其性能在信噪比大于3dB时,与高精度浮点数的和积译码算法相当;同时对最小和算法提出了一个修正因子,加上修正因子,其译码性能有进一步的提高,特别是在低信噪比下改善较大;另外还发现在高信噪比下,该算法具有更低的错误平层.     

一种基于Chase的RS码代数软判决译码算法

为了提高RS码的纠错性能,本文提出了一种基于Chase的代数软判决译码算法,称为Chase-ASD.该算法充分利用了接收比特的可信度信息,但运算复杂度较高.针对该算法运算复杂度高的问题,本文进一步给出了简化的Chase-ASD算法.仿真结果表明,提出的Chase-ASD和简化的Chase-ASD算法均可比原ASD算法提供更多的译码增益.     

光纤通信中级联码的码型

论述了光纤通信中级联码的码型选择,从净电编码增益、编码效率、相对色散代价以及实现的复杂程度等方面讨论了几种级联码,并认为RS(255,239)-BCH(2184,2040,12)级联方案在编码效率、色散代价以及实现的复杂程度方面具有较大的优越性。     

卷积码的因子图解码算法研究

因子图是一种双向图，它描述了一种用本地函数来表达全局函数的算法。因子图连同积和算法是通信中强有力的工具。现提出了一种新的解码算法，即将因予图与积和算法应用在通信系统的解码中，并通过仿真，寻找到了一个更新次数所处于的最佳范围。     

A new algorithm for "hard" iterative decoding of concatenated codes

A new hard iterative decoding algorithm to decode the serial concatenation of two block codes separated by an interleaver is presented. The new scheme is based on the use of erasures as a sort of extrinsic information to be exchanged between the two decoders. Extensive simulations highlight the coding gain of the new algorithm with respect to standard hard iterative decoding.     

M2FEC: An effective FEC based multi-path transmission scheme for interactive multimedia communication

The oncoming prosperity of interactive multimedia application triggers significant challenges to current best-effort Internet due to such application’s stringent delay, loss and bandwidth requirements, and Internet’s unpredictable dynamics. Multi-path transmission and error-resilient coding are two promising approaches to alleviate these problems. This paper attempts to introduce error-resilient coding into multi-path transmission to better trade off between multi-path bandwidth resource consumption and reliable media quality. We propose a model for multi-paths interactive multimedia transmission and develop M2FEC—a FEC based transmission scheme which maximizes the overall quality at the client under various constraints based on the proposed model. Numerical simulation and PlanetLab experiments demonstrate the effectiveness and practicability of M2FEC in theory and in empiricism, respectively.