共查询到19条相似文献,搜索用时 156 毫秒
1.
为了提高RS码的纠错性能,本文将基于盒匹配译码算法(BMA)的多重偏置与自适应置信传播算法(ABP)进行级联,提出了一种利用多重偏置基于可信度迭代的RS码软判译码算法,称为ABP-BIAS-BMA,并将其与传统的基于自适应置信传播的级联算法ABP-BMA及自适应置信传播算法ABP进行了译码性能仿真比较.仿真结果表明,提出的ABP-BIAS-BMA算法比ABP-BMA及ABP的译码性能要好,特别在相同信噪比情况下算法整体平均迭代次数较小. 相似文献
2.
3.
提出一种采用LDPC乘积码和BICM-ID相结合的编码调制技术.该方案编码采用LDPC乘积码,译码可以采取三个迭代过程:在解调器和译码器之间迭代,LDPC乘积码的分量码之间迭代,以及分量码内部迭代.因此采取合理的迭代译码策略,可以提高的译码效率.仿真结果显示,该方案在AWGN信道和Rayleigh信道条件下,与数字电视地面多媒体广播DTMB采用的编码调制方案相比具有更好的误比特性能. 相似文献
4.
5.
6.
7.
8.
Turbo乘积码是一类易于硬件实现高速迭代译码的分组码。对Turbo乘积码软输入软输出迭代译码算法进行了分析。将Turbo乘积码与QAM调制结合起来,提出了一种简化的、便于硬件实现的联合解调译码方案。仿真结果表明这种简化方案对译码性能影响很小。 相似文献
9.
10.
11.
To improve error-correcting performance, an iterative concatenated soft decoding algorithm for Reed-Solomon (RS) codes is presented in this article. This algorithm brings both complexity as well as advantages in performance over presently popular sott decoding algorithms. The proposed algorithm consists of two powerful soft decoding techniques, adaptive belief propagation (ABP) and box and match algorithm (BMA), which are serially concatenated by the accumulated log-likelihood ratio (ALLR).Simulation results show that, compared with ABP and ABP-BMA algorithms, the proposed algorithm can bring more decoding gains and a better tradeoffbetween the decoding performance and complexity. 相似文献
12.
13.
14.
Decoding Algorithms for Nonbinary LDPC Codes Over GF(q) 总被引:1,自引:0,他引:1
15.
Mao-Ching Chiu 《Communications, IEEE Transactions on》2009,57(1):12-16
A class of low-density parity-check (LDPC) codes with a simple 2-state trellis structure is presented. For LDPC decoding, the conventional belief propagation (BP) algorithm consists of numerous sub-decoders of single-parity check codes and exchanges information between sub-decoders in an iterative manner. If the single-parity check codes can be constructed and grouped in a proper way, the decoder can be decomposed into few identical 2-state trellis decoders. Therefore, instead of numerous sub-decoders of single-parity check codes, an iterative decoding algorithm based on few sub-decoders over 2-state trellis is proposed. The proposed decoding algorithm improves the efficiency of message passing between sub-decoders and hence provides a fast convergent rate as compared to the standard BP algorithm. Simulation results show that the proposed scheme provides a better performance and a fast convergent rate as compared to those of standard BP algorithm. The result also shows that the proposed algorithm has a similar performance as that of asynchronous replica shuffled BP algorithm and has a slightly inferior performance than that of synchronous replica shuffled BP algorithm. However, complexity analysis shows that our proposed algorithm has complexity that is lower than that of the replica shuffled BP algorithm. 相似文献
16.
LDPC码相关技术研究 总被引:6,自引:5,他引:1
徐华 《微电子学与计算机》2005,22(3):178-180,184
文章首先简要介绍了LDPC码适于新一代移动通信应用的良好特性,接着阐述了码的结构和二分图分析方法,对LDPC码的几种基本编码技术进行了讨论,最后论述了LDPC码的MP译码算法基本思想,并对MP算法集合中的特例信度传播算法(BP)进行了评述. 相似文献
17.
The adaptive belief propagation (ABP) algorithm was recently proposed by Jiang and Narayanan for the soft decoding of Reed-Solomon (RS) codes. In this paper, simplified versions of this algorithm are investigated for the turbo decoding of product codes. The complexity of the turbo-oriented adaptive belief propagation (TAB) algorithm is significantly reduced by moving the matrix adaptation step outside of the belief propagation iteration loop. A reduced-complexity version of the TAB algorithm that offers a trade-off between performance and complexity is also proposed. Simulation results for the turbo decoding of product codes show that belief propagation based on adaptive parity check matrices is a practical alternative to the currently very popular Chase-Pyndiah algorithm. 相似文献
18.
A concatenated code model is proposed for high-order low-density parity-check (LDPC) coded modulations. A corresponding concatenated-code
belief propagation (CCBP) decoding algorithm is derived for our proposed concatenated code. Moreover, the design of LDPC codes
under the CCBP decoding is developed using extrinsic information transfer (EXIT) charts. Compared with other algorithms, the
CCBP method provides an excellent parallel decoding process, and the EXIT-based design method offers highly accurate LDPC
code ensembles. Simulation results show that the performance of the proposed CCBP algorithm is superior to that of the conventional
belief propagation decoding within a wide range of modulation orders, and the EXIT-based method can design capacity-approaching
LDPC codes for high-order modulations. 相似文献