Multi-user detection scheme for SCMA systems based on iteration removal

A multi-user detection scheme based on iteration removal (RM-MPA) was proposed to solve the problem of high complexity of decoding algorithm for sparse code multiple access (SCMA) systems.Firstly,a simple and novel method to compare the decoding advantages between users was proposed.Then n users in front of them with higher decoding advantages directly decoded and removed after each iteration,the users removed no longer participate in the subsequent iteration,so the complexity of subsequent iterations decreased gradually.Moreover,two iteration removed strategies based on decoding advantages of users and orthogonal user grouped were proposed respectively.Simulation results show that the RM-MPA with removed strategies based on orthogonal user grouped,which can reduce the decoding complexity with well decoding performance,and the decoding delay is also decreased.     

分组相关快衰落信道下自适应Turbo码译码算法研究

分析了分组相关快衰落信道的特性，推导出该信道下Turbo码译码算法；研究了迭代次数对Turbo编码系统的影响，在小信噪比弥散度条件下，提出基于平均信噪比的最佳迭代译码次数自适应选择方案，可以兼顾译码性能和译码速度，得到较低的平均误比特率和较高的平均译码速度。仿真结果说明，本文提出的Turbo码译码算法，降低了对信道估计精度要求的同时，得到精确信道估计时的性能；对于目标误比特率为10^-4时，采用自适应Turbo译码算法，与固定迭代4次相比，平均误比特率降低了40％，提高了系统性能；而与固定迭代8次相比，迭代次数降低了约1／4，提高了译码速度。     

低复杂度的TBCC自适应循环VA译码算法

咬尾是一种将卷积码转换为块码的技术,它消除了归零状态所造成的码率损失,同时避免了截尾带来的性能降低,在短块编码中具有明显优势。针对咬尾卷积码(TBCC)现有译码算法复杂度过大和收敛性问题,提出一种低复杂度的TBCC自适应循环维特比(VA)译码算法。该算法根据信道变化自适应调整译码迭代次数,使咬尾路径收敛到最佳。通过仿真对比不同译码算法的块错误率和译码迭代次数,结果表明TBCC性能明显好于传统卷积码;相比于同类循环VA算法,在不降低性能的前提下,改进算法简化了停止规则,减少译码迭代次数和复杂度,在低信噪比时,改进算法比传统绕维特比译码算法(WAVA)平均迭代次数减少约4次。      

Complexity‐Reduced Algorithms for LDPC Decoder for DVB‐S2 Systems

This paper proposes two kinds of complexity‐reduced algorithms for a low density parity check(LDPC) decoder. First, sequential decoding using a partial group is proposed. It has the same hardware complexity and requires a fewer number of iterations with little performance loss. The amount of performance loss can be determined by the designer, based on a tradeoff with the desired reduction in complexity. Second, an early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Once the edges are detected, no further iteration is required; thus early detection reduces the computational complexity.     

Reducing power consumption of turbo-code decoder using adaptiveiteration with variable supply voltage

Turbo-code becomes popular for the next generation wireless communication systems because of its remarkable coding performance. One of the problems for decoding turbo-code in the receiver is the complexity and the high power consumption since multiple iterations of Soft Output Viterbi Algorithm (SOVA) or Maximum a posteriori (MAP) decoding have to be carried out to decode a data frame. To reduce the complexity of the turbo-code decoder, adaptive iteration based on cyclic redundancy checking (CRC) and output convergence approaches has been proposed to reduce the average number of iterations required for decoding a data frame. This results in a system that has variable workload since the amount of computation required for decoding each data frame is different. In this work, we propose a dynamic voltage scaling approach to further reduce the power consumption. Different from other variable workload systems, the workload here is not known at the time when the data is being decoded. Thus, optimum voltage assignment is not feasible. We propose several heuristic algorithms to assign supply voltage for different decoding iterations. Simulation results show that significant reduction of power consumption is achieved comparing with the system using fixed supply voltage     

动态选择消息更新的SCMA多用户检测算法

稀疏码多址接入（SCMA）是上行链路（UP）无线空口技术之一,消息传递算法（MPA）是SCMA多用户检测的主要方法。MPA算法迭代更新所有码字消息,所有消息概率收敛后迭代结束。因此,MPA算法复杂度较高。针对这一问题,本文利用各消息概率收敛速度不同的特点,提出了一种动态选择消息更新的SCMA多用户检测算法。在每次迭代中找出收敛最快的码字消息,由于这些消息已接近收敛值,剩余迭代将不再更新这些消息,从而减少了复杂度。从仿真结果看,选择合适的比重因子,本文算法误比特率（BER）性能与MPA算法基本相同,算法复杂度明显降低。      

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

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

LDPC编码调制系统中基于反馈LLR均值的迭代解调/译码算法

该文针对LDPC码编码的BICM系统,提出一种对LDPC码译码器输出外附信息的计算方法进行改进的迭代解调/译码算法。与传统的解调/译码算法不同在于,该算法对每次BP迭代中译码器输出的各编码比特的外附LLR分别求均值后,再将其作为先验信息反馈给软解调器开始下次的迭代解调/译码。采用该方法可有效地减轻LDPC码在BP迭代过程中某些比特LLR值的振荡现象,从而使得传递给软解调器的外附信息更准确。仿真结果表明,和传统的两种迭代解调/译码算法相比,该算法能进一步提高LDPC编码BICM迭代系统的译码性能,而复杂度并无明显增加。     

Computationally efficient decoding of LDPC codes

A computationally efficient algorithm for the decoding of low-density parity check codes is introduced. Instead of updating all bit and check nodes at each decoding iteration, the developed algorithm only updates unreliable check and bit nodes. A simple reliability criteria is developed to determine the active bit and check nodes per decoding iteration. Based on the developed technique, significant computation reductions are achieved with very little or no loss in the BER performance of the LDPC codes. The proposed method can be implemented with a slight modification to the sum-product algorithm with negligible additional hardware complexity.     

Effect of precoding on the convergence of turbo equalization forpartial response channels

The effect of the precoder on the convergence of turbo equalization for precoded partial response channels is studied. The idea is to consider the turbo decoding algorithm as a one-parameter dynamical system and to study the effect of the precoder on the fixed points of the system. It is showed that precoding results in a loss in fidelity during the first iteration and that this loss depends on the precoder. Further, the rate at which the extrinsic information increases with iterations is also dependent on the precoder. The net result of these two effects is used to explain several existing results in the literature about the performance of different precoders. A design criteria based on the convergence is then proposed, and the impact of precoding on the design of the outer code is then studied. Finally, the design of precoders in the presence of an error correcting code, such as a Reed-Solomon code, is studied     

大规模MIMO系统低复杂度混合迭代信号检测

在大规模MIMO系统上行链路信号检测算法中,最小均方误差(MMSE)算法能获得接近最优的线性检测性能.但是,传统的MMSE检测算法涉及高维矩阵求逆运算,由于复杂度过高而使其在实际应用中难以快速有效地实现.基于最速下降(steepest descent,SD)算法和高斯一赛德尔(Gauss-Seidel,GS)迭代的方法提出了一种低复杂度的混合迭代算法,利用SD算法为复杂度相对较低的GS迭代算法提供有效的搜索方向,以加快算法收敛的速度.同时,给出了一种用于信道译码的比特似然比(LLR)近似计算方法.仿真结果表明,通过几次迭代,给出的算法能够快速收敛并接近MMSE检测性能,并将算法复杂度降低一个数量级,保持在O(K2).     

基于子迭代次数的LDPC码改进动态调度算法

为了降低低密度奇偶校验(Low Density Parity Check,LDPC)码的译码算法复杂度,提高译码性能,结合基于残余值的动态译码NW-RBP算法和最小和算法,提出了一种基于子迭代次数的改进NW-RBP算法,将此算法称为NW-RBPF算法。该算法在进行残余值计算时利用最小和进行计算,并且根据子迭代过程中每行迭代更新的次数,由仿真得出的收敛因子计算对残余值的补偿值。仿真结果表明,该算法的译码性能相比NW-RBP算法提高了0.05 dB,收敛速度提高了1.5倍,并且其贪婪性降低,是一种适用于LDPC码,且译码性能良好、实现复杂度较低的译码算法。     

光通信系统中一种改进的LLR-BP译码算法

光通信系统中低密度奇偶校验(Low-density Parity-check,LDPC)码采用对数似然比置信传播(Log-likelihood Ratio Belief Propagation,LLR-BP)算法进行译码时,在高信噪比区域迭代译码过程中会出现变量节点外部信息振荡不收敛而导致译码纠错性能的降低.为满足光通信系统的要求,提出了一种削弱外部消息振荡的改进LLR-BP译码算法.该算法通过引入加权系数平衡前后两次迭代之间变量节点传递的外部信息,明显减缓了外部信息的振荡现象.仿真结果表明:与传统LLR-BP译码算法相比,该改进LLR-BP算法具有更佳的误码性能,同时降低变量节点外部信息振荡现象并加快了译码的收敛速度.     

Variable non-uniform quantized belief propagation algorithm for LDPC decoding

Non-uniform quantization for messages in Low-Density Parity-Check（LDPC）decoding can reduce implementation complexity and mitigate performance loss.But the distribution of messages varies in the iterative decoding.This letter proposes a variable non-uniform quantized Belief Propagation（BP）algorithm.The BP decoding is analyzed by density evolution with Gaussian approximation.Since the probability density of messages can be well approximated by Gaussian distribution,by the unbiased estimation of variance,the distribution of messages can be tracked during the iteration.Thus the non-uniform quantization scheme can be optimized to minimize the distortion.Simulation results show that the variable non-uniform quantization scheme can achieve better error rate performance and faster decoding convergence than the conventional non-uniform quantization and uniform quantization schemes.     

基于Newton迭代算法的低复杂度信号检测算法

为了解决太赫兹通信系统超大规模MIMO检测计算复杂度高、收敛速度慢等问题,提出了基于Newton迭代算法的低复杂度信号检测算法.通过在Newton迭代算法中改进初始矩阵、加入步长因子,降低计算复杂度、提高收敛速度;通过加入调节因子,保证算法的稳定性、可靠性和场景适用性.仿真结果表明,相比传统算法,所提算法具有更低的计算...     

Further Exploring the Strength of Prediction in the Factorization of Soft-Decision Reed–Solomon Decoding

Reed-Solomon (RS) codes are among the most widely utilized error-correcting codes in digital communication and storage systems. Among the decoding algorithms of RS codes, the recently developed Koetter-Vardy (KV) soft-decision decoding algorithm can achieve substantial coding gain, while has a polynomial complexity. One of the major steps of the KV algorithm is the factorization. Each iteration of the factorization mainly consists of root computations over finite fields and polynomial updating. To speed up the factorization step, a fast factorization architecture has been proposed to circumvent the exhaustive-search-based root computation from the second iteration level by using a root-order prediction scheme. Based on this scheme, a partial parallel factorization architecture was proposed to combine the polynomial updating in adjacent iteration levels. However, in both of these architectures, the root computation in the first iteration level is still carried out by exhaustive search, which accounts for a significant part of the overall factorization latency. In this paper, a novel iterative prediction scheme is proposed for the root computation in the first iteration level. The proposed scheme can substantially reduce the latency of the factorization, while only incurs negligible area overhead. Applying this scheme to a (255, 239) RS code, speedups of 36% and 46% can be achieved over the fast factorization and partial parallel factorization architectures, respectively.     

一种LDPC码混合迭代译码算法研究

根据LDPC码RRWBF算法和UMP BP-Based算法,提出一种混合迭代译码算法。该算法充分利用硬判决算法具有复杂度低和软判决算法性能好的优点,实现了在误码率性能没有下降的前提下,译码复杂度明显降低的效果,进而使传播时延得到减小。仿真结果表明,经过精心设计的不同迭代次数的MIA算法与性能相当的UMP BP-Based算法相比,译码复杂度降低28.5%。     

高速数据传输中的LDPC码译码算法研究

在对LDPC码(低密度奇偶校验码)不同译码算法的原理进行深入研究的基础上,提出了一种改进型的最小和译码算法。通过分析不同译码算法的计算复杂度,验证不同算法的译码性能,表明改进最小和译码算法降低了运算复杂度,减少了平均迭代次数,改善了算法的收敛特性,是一种低运算量高性能的译码算法,有利于提高吞吐量,在高速数据传输上具有很大应用价值。     

Iteration-free fractal image coding based on efficient domain pooldesign

The domain pool design is one of the dominant issues which affect the coding performance of fractal image compression. In this paper, we employ the LBG algorithm and propose a block averaging method to design the efficient domain pools based on a proposed iteration-free fractal image codec. The redundancies between the generated domain blocks are reduced by the proposed methods. Therefore, we can obtain the domain pools that are more efficient than those in the conventional fractal coding schemes and thus the coding performance is improved. On the other hand, the iteration process in the conventional fractal coding scheme not only requires a large size of memory and a high computation complexity but also prolongs the decoding process. The proposed iteration-free fractal codec can overcome the problems above. In computer simulation, both the LBG-based and block-averaging methods for the domain pool design in the proposed iteration free scheme achieve excellent performances. For example, based on the proposed block-averaging method, the decoded Lena image has at least a 0.5 dB higher PSNR (under the same bit rate) and an eight-time faster decoding speed than the conventional fractal coding schemes that require iterations.     

基于外信息收敛的Turbo码译码优化算法

目前Turbo码译码算法运算较复杂,无法满足LTE及LTE-Advanced的高速吞吐要求,因此,研究LTE环境下的Turbo码译码算法具有理论意义与工程价值。从降低译码延时考虑,评估各种迭代停止准则对性能及译码效率的影响,在分析外信息统计特性收敛的基础上,设计基于外信息收敛的双门限停止准则。仿真结果表明,改进的迭代停止准则在不影响译码性能的前提下,能较好地提高译码速率。