共查询到20条相似文献,搜索用时 93 毫秒
1.
带判决反馈的盲最大似然序列估计 总被引:1,自引:1,他引:0
本文提出了一种新型的带有判决反馈的减小状态最大似然序列估计RSSDFPSP,新算法带有两个信道估值器并且可以工作在盲环境下.使用最大似然序列估计(MLSE)来处理信道冲激响应的前导干扰及主径,反馈滤波器处理后尾干扰,并且用PerSurvivingProcesing(PSP)算法来得到MLSE部分的信道冲激响应,信道估值器2得到后尾干扰.计算机模拟表明,这种RSSDFPSP方案在减小MLSE的计算复杂度的同时能最大限度地得到MLSE的性能,是MLSE在计算复杂度与性能之间的较好折中. 相似文献
2.
3.
4.
本文在简要介绍RS码的基本概念及其译码算法的基础上,着重介绍了近几年来RS码软判决译码算法的最新进展,其中包括最大似然译码、代数软判决译码、基于Turbo编译码的软判决译码以及基于和积算法(SPA)的软判决译码算法等。 相似文献
5.
6.
MPSK信号的最大似然SNR估计方法 总被引:5,自引:1,他引:4
该文利用最大似然准则分别推导了对于MPSK信号的数据辅助SNR估计方法、判决指向SNR估计方法和一种新的盲信噪比估计方法。文章对这些算法的性能进行了分析和计算机仿真,并与其它一些SNR估计算法进行了比较。分析和仿真的结果显示数据辅助的SNR方法性能优越,很好地符合了信噪比估计性能下限(CRLB)。判决指向算法性能依赖于判决的准确程度,在高信噪比时性能较好;而在低信噪比条件时,特别是小于OdB以后其估计有较大偏差。新的盲SNR估计算法对于BPSK信号具有估计范围广、精度高和复杂度小的特点,但是当M增加时性能会明显下降。 相似文献
7.
8.
介绍了一种基于改进型Chase算法的RS(Reed-Solomon)码软判决译码方法,阐述了该方法在信道编码应用中的核心思想,比较了各种Chase算法的优劣,并对RS(14,10)码的自适应软判决译码算法在DSP中的实现方法进行了研究,提出了用翻转表法实现试探序列的快速产生方法.实验证明该译码算法效率高,纠错能力强,适合实时性要求高的数据通信场合. 相似文献
9.
10.
11.
12.
本文提出一种在形式上类似于卷积码的序列译码的一般线性分组码的软判决伪序列译码算法,利用广义限译码原理及二元有向树的性质与分枝限搜索技术,降低了译码复杂性,其设备复杂度小于Chase译码器,模拟结果表明,该算法的误码输出性能接近维持比较最大似然译码,好于ChaseⅡ算法,且译码速度与ChaseⅡ算法接近。 相似文献
13.
Reliability-Based Soft-Decision Decoding With Multiple Biases 总被引:2,自引:0,他引:2
Jin W. Fossorier M. P. C. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2007,53(1):105-120
In this paper, a new reliability-based soft-decision decoding algorithm is presented. This algorithm repeatedly uses biased reliability values to construct the most-reliable-basis (MRB). As a result, this new method makes use of multiple information sets in a stochastic way. Compared to previously proposed competitive approaches, this new method produces a more efficient MRB reprocessing type algorithm to achieve near maximum-likelihood decoding (MLD) performance with a proper choice of the bias value. It can be combined with any MRB reprocessing type algorithm and in each case, a tight performance analysis can be derived 相似文献
14.
15.
一类循环码的神经网络软判决译码算法 总被引:2,自引:0,他引:2
本文分析了一类循环码的结构特性,提出了这类循环码的神经网络软判决译码算法。新算法的复杂度比现有一般的神经网络译码算法要低得多,而其译码性能接近大似然译码。 相似文献
16.
17.
针对极化码译码串行输出造成较大译码时延的问题,该文提出一种基于预译码的最大似然简化连续消除译码算法。首先对译码树节点存储的似然值进行符号提取并分组处理,得到符号向量组;然后比较符号向量组与该节点的某些信息位的取值情况,发现向量组中储存的正负符号分布规律与该节点的中间信息位的取值具有一一对应的关系;在此基础上对组合码中间的1~2 bit进行预译码;最后结合最大似然译码方法估计组合码中的剩余信息位,从而得到最终的译码结果。仿真结果表明:在不影响误码性能的情况下,所提算法与已有的算法相比可有效降低译码时延。
相似文献18.
Jiangli Zhu Xinmiao Zhang Zhongfeng Wang 《Very Large Scale Integration (VLSI) Systems, IEEE Transactions on》2009,17(11):1602-1615
Recently developed algebraic soft-decision (ASD) decoding of Reed-Solomon (RS) codes have attracted much interest due to the fact that they can achieve significant coding gain with polynomial complexity. One major step of ASD decoding is the interpolation. Available interpolation algorithms can only add interpolation points or increase interpolation multiplicities. However, backward interpolation, which eliminates interpolation points or reduces interpolation multiplicities, is indispensable to enable the reusing of interpolation results in the following two scenarios: 1) interpolation needs to be carried out on multiple test vectors, which share common entries and 2) iterative ASD decoding where interpolation points have decreasing multiplicities. Examples for these cases are the low-complexity chase (LCC) decoding and bit-level generalized minimum distance (BGMD) decoding. With lower complexity, these algorithms can achieve similar or higher coding gain than other practical ASD algorithms. In this paper, we propose novel backward interpolation schemes and corresponding efficient implementation architectures for LCC and BGMD decoding through constructing equivalent GrOumlbner bases. The proposed architectures share computational units with forward interpolation architectures. Hence, the area overhead for incorporating the backward interpolation is very small. Substantial area saving or speedup can be achieved by using the backward interpolation. When the proposed architecture is applied to the LCC decoding of a (255, 239) RS code with eta = 3, the area is reduced to 39% of those required by prior architectures. In terms of speed/area ratio, the proposed architecture is 48% more efficient than the best available architecture. For the BGMD decoding of the same code, the proposed architecture can achieve around 20% higher efficiency. 相似文献
19.
《Communications, IEEE Transactions on》2006,54(6):1143-1143
Efficient soft-decision decoding of Reed–Solomon codes is made possible by the Koetter–Vardy (KV) algorithm which consists of a front-end to the interpolation-based Guruswami–Sudan list decoding algorithm. This paper approaches the soft-decision KV algorithm from the point of view of a communications systems designer who wants to know what benefits the algorithm can give, and how the extra complexity introduced by soft decoding can be managed at the systems level. We show how to reduce the computational complexity and memory requirements of the soft-decision front-end. Applications to wireless communications over Rayleigh fading channels and magnetic recording channels are proposed. For a high-rate (RS 9225,239) Reed–Solomon code, 2–3 dB of soft-decision gain is possible over a Rayleigh fading channel using 16-quadrature amplitude modulation. For shorter codes and at lower rates, the gain can be as large as 9 dB. To lower the complexity of decoding on the systems level, the redecoding architecture is explored which uses only the appropriate amount of complexity to decode each packet. An error-detection criterion based on the properties of the KV decoder is proposed for the redecoding architecture. Queuing analysis verifies the practicality of the redecoding architecture by showing that only a modestly sized RAM buffer is required. 相似文献
20.
An efficient algorithm for soft-decision decoding of the (24, 12) extended Golay code is described. Results obtained for white Gaussian noise are presented which show that performance is only a few tenths of a decibel away from that of an ideal correlator. 相似文献