A novel adaptively iterative list decoding(ILD) approach using for Reed-Solomon(RS) codes was investigated. The proposed scheme is exploited to reduce the complexity of RS Chase algorithm(CA) via an iterative decoding...A novel adaptively iterative list decoding(ILD) approach using for Reed-Solomon(RS) codes was investigated. The proposed scheme is exploited to reduce the complexity of RS Chase algorithm(CA) via an iterative decoding attempt mode. In each decoding attempt process, a test pattern is generated by flipping the bits of the least reliable positions(LRPs) within the received hard-decision(HD) vector. The ILD algorithm continues until a test pattern is successfully decoded by the underlying Berlekamp-Massey algorithm(BMA) of RS codes. Flipping within the same bits, the ILD algorithm provides the same test pattern set as the conventional RS CA, thus there is no degradation in error-rate performance. Without decoding all test patterns, the ILD algorithm can simplify the decoding complexity by its early termination. Simulation results show that the average complexity of the ILD algorithm is much lower than that of the conventional RS CA(and is similar to that of BMA decoding) at high signal-to-noise ratio(SNR) region with no less to the RS CA decoding error-rate performance.展开更多
双二元卷积Turbo码(DB CTC)的非二进制编码使得译码复杂度增加,限制了其在某些实际通信工程中的使用。在最大后验概率(MAP)译码算法的基础上,提出了一种优化算法,将译码的存储量和计算量降为原来的1/4。仿真结果表明:在不同编码长度和...双二元卷积Turbo码(DB CTC)的非二进制编码使得译码复杂度增加,限制了其在某些实际通信工程中的使用。在最大后验概率(MAP)译码算法的基础上,提出了一种优化算法,将译码的存储量和计算量降为原来的1/4。仿真结果表明:在不同编码长度和码率的情况下,优化算法与原算法性能相当;在误码率为10-5的条件下,两者的Eb/N0差异同样不大于0.1 d B。展开更多
Due to the high complexity of the pairwise decoding algorithm and the poor performance of zero forcing（ ZF） /minimum mean square error（ MMSE） decoding algorithm, two low-complexity suboptimal decoding algorithms, ...Due to the high complexity of the pairwise decoding algorithm and the poor performance of zero forcing（ ZF） /minimum mean square error（ MMSE） decoding algorithm, two low-complexity suboptimal decoding algorithms, called pairwisequasi-ZF and pairwise-quasi-MMSE decoders, are proposed. First,two transmit signals are detected by the quasi-ZF or the quasiMMSE algorithm at the receiver. Then, the two detected signals as the decoding results are substituted into the two pairwise decoding algorithm expressions to detect the other two transmit signals. The bit error rate（ BER） performance of the proposed algorithms is compared with that of the current known decoding algorithms.Also, the number of calculations of ZF, MMSE, quasi-ZF and quasi-MMSE algorithms is compared with each other. Simulation results showthat the BER performance of the proposed algorithms is substantially improved in comparison to the quasi-ZF and quasiMMSE algorithms. The BER performance of the pairwise-quasiZF（ pairwise-quasi-MMSE） decoder is equivalent to the pairwiseZF（ pairwise-MMSE） decoder, while the computational complexity is significantly reduced.展开更多
由于传统的LDPC码位翻转解码算法在计算复杂度方面无法得到提高等缺点,为降低传统非二进制低密度奇偶校验码解码算法的复杂度和误码率,提出一种改进的基于NB-LDPC解码算法。对现有的并行符号翻转解码算法(parallel symbol flipping deco...由于传统的LDPC码位翻转解码算法在计算复杂度方面无法得到提高等缺点,为降低传统非二进制低密度奇偶校验码解码算法的复杂度和误码率,提出一种改进的基于NB-LDPC解码算法。对现有的并行符号翻转解码算法(parallel symbol flipping decoding algorithm,PSFD)进行优化改进,采用多次投票方法,使每个不满意的校验节点对相应的变量节点进行多次投票,并结合误差估计方法。考虑到额外的复杂性,两级投票是提出优化算法的最佳选择。大量实验结果表明,相比原有的LDPC码位翻转解码算法,该优化算法避免使用码相关的投票阈值,在BER等于10-5时,误码率低约0.4dB,在中低数值的SNR上,具有最优参数的优化算法比原有算法收敛得更快。展开更多
This paper introduces a family of error correcting codes called zigzag codes. A zigzag code is described by a highly structured zigzag graph. Due to the structural properties of the graph, very low complexity soft ...This paper introduces a family of error correcting codes called zigzag codes. A zigzag code is described by a highly structured zigzag graph. Due to the structural properties of the graph, very low complexity soft in, soft out decoding rules can be implemented. We present a decoding rule, based on the Max Log APP(MLA) formulation, which requires a total of only 20 addition equivalent operations per information bit per iteration. Simulation of a rate 1/2 concatenated zigzag code with four constituent encoders with interleaver length 65536 yields a bit error rate (BER) and of 10 5 at 0.9 dB and 1.4 dB away from the Shannon limit by optimal (APP) and low cost sub optimal (MLA) decoders, respectively.展开更多
基金supported by the National Natural Science Foundation of China (61671080,61601047)
文摘A novel adaptively iterative list decoding(ILD) approach using for Reed-Solomon(RS) codes was investigated. The proposed scheme is exploited to reduce the complexity of RS Chase algorithm(CA) via an iterative decoding attempt mode. In each decoding attempt process, a test pattern is generated by flipping the bits of the least reliable positions(LRPs) within the received hard-decision(HD) vector. The ILD algorithm continues until a test pattern is successfully decoded by the underlying Berlekamp-Massey algorithm(BMA) of RS codes. Flipping within the same bits, the ILD algorithm provides the same test pattern set as the conventional RS CA, thus there is no degradation in error-rate performance. Without decoding all test patterns, the ILD algorithm can simplify the decoding complexity by its early termination. Simulation results show that the average complexity of the ILD algorithm is much lower than that of the conventional RS CA(and is similar to that of BMA decoding) at high signal-to-noise ratio(SNR) region with no less to the RS CA decoding error-rate performance.
文摘双二元卷积Turbo码(DB CTC)的非二进制编码使得译码复杂度增加,限制了其在某些实际通信工程中的使用。在最大后验概率(MAP)译码算法的基础上,提出了一种优化算法,将译码的存储量和计算量降为原来的1/4。仿真结果表明:在不同编码长度和码率的情况下,优化算法与原算法性能相当;在误码率为10-5的条件下,两者的Eb/N0差异同样不大于0.1 d B。
基金The National Natural Science Foundation of China(No.6157110861201248)+1 种基金the Open Research Fund of National Mobile Communications Research Laboratory of China(No.2011D18)China Postdoctoral Science Foundation(No.2012M511175)
文摘Due to the high complexity of the pairwise decoding algorithm and the poor performance of zero forcing（ ZF） /minimum mean square error（ MMSE） decoding algorithm, two low-complexity suboptimal decoding algorithms, called pairwisequasi-ZF and pairwise-quasi-MMSE decoders, are proposed. First,two transmit signals are detected by the quasi-ZF or the quasiMMSE algorithm at the receiver. Then, the two detected signals as the decoding results are substituted into the two pairwise decoding algorithm expressions to detect the other two transmit signals. The bit error rate（ BER） performance of the proposed algorithms is compared with that of the current known decoding algorithms.Also, the number of calculations of ZF, MMSE, quasi-ZF and quasi-MMSE algorithms is compared with each other. Simulation results showthat the BER performance of the proposed algorithms is substantially improved in comparison to the quasi-ZF and quasiMMSE algorithms. The BER performance of the pairwise-quasiZF（ pairwise-quasi-MMSE） decoder is equivalent to the pairwiseZF（ pairwise-MMSE） decoder, while the computational complexity is significantly reduced.
文摘由于传统的LDPC码位翻转解码算法在计算复杂度方面无法得到提高等缺点,为降低传统非二进制低密度奇偶校验码解码算法的复杂度和误码率,提出一种改进的基于NB-LDPC解码算法。对现有的并行符号翻转解码算法(parallel symbol flipping decoding algorithm,PSFD)进行优化改进,采用多次投票方法,使每个不满意的校验节点对相应的变量节点进行多次投票,并结合误差估计方法。考虑到额外的复杂性,两级投票是提出优化算法的最佳选择。大量实验结果表明,相比原有的LDPC码位翻转解码算法,该优化算法避免使用码相关的投票阈值,在BER等于10-5时,误码率低约0.4dB,在中低数值的SNR上,具有最优参数的优化算法比原有算法收敛得更快。
文摘This paper introduces a family of error correcting codes called zigzag codes. A zigzag code is described by a highly structured zigzag graph. Due to the structural properties of the graph, very low complexity soft in, soft out decoding rules can be implemented. We present a decoding rule, based on the Max Log APP(MLA) formulation, which requires a total of only 20 addition equivalent operations per information bit per iteration. Simulation of a rate 1/2 concatenated zigzag code with four constituent encoders with interleaver length 65536 yields a bit error rate (BER) and of 10 5 at 0.9 dB and 1.4 dB away from the Shannon limit by optimal (APP) and low cost sub optimal (MLA) decoders, respectively.
