带判决反馈的盲最大似然序列估计

本文提出了一种新型的带有判决反馈的减小状态最大似然序列估计ＲＳＳＤＦＰＳＰ,新算法带有两个信道估值器并且可以工作在盲环境下．使用最大似然序列估计（ＭＬＳＥ）来处理信道冲激响应的前导干扰及主径,反馈滤波器处理后尾干扰,并且用ＰｅｒＳｕｒｖｉｖｉｎｇＰｒｏｃｅｓｉｎｇ（ＰＳＰ）算法来得到ＭＬＳＥ部分的信道冲激响应,信道估值器２得到后尾干扰．计算机模拟表明,这种ＲＳＳＤＦＰＳＰ方案在减小ＭＬＳＥ的计算复杂度的同时能最大限度地得到ＭＬＳＥ的性能,是ＭＬＳＥ在计算复杂度与性能之间的较好折中．     

空时网格码的联合迭代最大似然估计和译码

该文提出了一种适合空时网格码的联合迭代最大似然估计和译码的方法,利用较少的导频,能够获得比传统非迭代最大似然译码更好的系统性能,仿真结果显示经过4次迭代,其性能与接收机已知理想信道信息下的最大似然译码比较只有不到1dB的损失,最后根据仿真结果给出一个导频数目和迭代次数的合理选择。     

RS码软判决译码算法研究的最新进展

本文在简要介绍RS码的基本概念及其译码算法的基础上，着重介绍了近几年来RS码软判决译码算法的最新进展，其中包括最大似然译码、代数软判决译码、基于Turbo编译码的软判决译码以及基于和积算法(SPA)的软判决译码算法等。     

Rayleigh衰落信道中分组码最大似然译码的性能

摆脱了传统代数译码方法,对分组码进行基于广义阵列码（ＧＡＣ）结构的网格译码（Ｔｒｅｌｌｉｓ ｄｅｃｏｄｉｎｇ）,研究了Ｒａｙｌｅｉｇｈ衰落信道中分组码与这种软判决最大似然译码方法相结合的性能。模拟结果显示。分组码采用网格译码,可为移动衰落信道带来显著的性能改善。     

MPSK信号的最大似然SNR估计方法

该文利用最大似然准则分别推导了对于MPSK信号的数据辅助SNR估计方法、判决指向SNR估计方法和一种新的盲信噪比估计方法。文章对这些算法的性能进行了分析和计算机仿真,并与其它一些SNR估计算法进行了比较。分析和仿真的结果显示数据辅助的SNR方法性能优越,很好地符合了信噪比估计性能下限(CRLB)。判决指向算法性能依赖于判决的准确程度,在高信噪比时性能较好;而在低信噪比条件时,特别是小于OdB以后其估计有较大偏差。新的盲SNR估计算法对于BPSK信号具有估计范围广、精度高和复杂度小的特点,但是当M增加时性能会明显下降。     

卫星通信中IJF-OQPSK调制最大似然接收机的研究

卫星通信中,硬限幅无符号间干扰和抖动-交错正交相移键控（IJF-OQPSK）信号由于其近似恒定的包络和优异的频谱性能等优势,使其特别适用于带有非线性功率放大器的卫星通信中。通过Matlab仿真验证,本文提出了一种适用于卫星通信的基于最大似然序列检测的IJF-OQPSK调制方案。     

基于TMS320C54xx的RS码软判决译码的实现

介绍了一种基于改进型Chase算法的RS(Reed-Solomon)码软判决译码方法,阐述了该方法在信道编码应用中的核心思想,比较了各种Chase算法的优劣,并对RS(14,10)码的自适应软判决译码算法在DSP中的实现方法进行了研究,提出了用翻转表法实现试探序列的快速产生方法.实验证明该译码算法效率高,纠错能力强,适合实时性要求高的数据通信场合.     

一种新的盲多用户检测最大似然方法

线性受限最大似然盲多用户检测是盲多用户检测中的一类重要方法,现有的限制方法不能保证目标用户的最优解落在限制的搜索空间中,因此在理论上不能达到最优解。提出了一种新的限制方法,能保证目标用户的最优解落在限制的搜索空间中,因此保证算法收敛到目标用户。与现有方法相比,这里给出的算法结构简单,降低了运算复杂度。仿真试验表明其具有较低的误码率和较高的系统容量。     

改善判决反馈均衡器性能的一种新方法

判决反馈均衡器是一种算法复杂度较低、性能也较好、并在实际中得到广泛应用的均衡器。它的一个内在的缺陷是错误判决结果反馈所引起的性能损失。利用判决反馈均衡器中前向滤波器输出中的信息,提出了一种改善判决反馈均衡器性能的方法,并给出改进后判决反馈均衡器的结构和实现方法。仿真结果证明了该方法的有效性。     

一种快速软判决译码的研究

本文给出一种分组码快速软判决译码—可变门限Chase算法(VTC).采用人工智能搜索技术—A^*算法,快速生成试探序列集合,并利用已经试探译码的信息,对试探序列集合进行分类,生成试探序列的等价类及其代表,并用最优门限对候选码字进行最佳测试,可实现快速软判决译码.模拟计算表明,与已有的软判决译码算法相比,该算法的译码速度更快而译码性能完全相同.     

分组码的软判决伪序列译码

本文提出一种在形式上类似于卷积码的序列译码的一般线性分组码的软判决伪序列译码算法，利用广义限译码原理及二元有向树的性质与分枝限搜索技术，降低了译码复杂性，其设备复杂度小于Ｃｈａｓｅ译码器，模拟结果表明，该算法的误码输出性能接近维持比较最大似然译码，好于ＣｈａｓｅⅡ算法，且译码速度与ＣｈａｓｅⅡ算法接近。     

Reliability-Based Soft-Decision Decoding With Multiple Biases

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     

联合判决估计在软判决Viterbi译码中的应用

该文利用相邻判决数据间的相互关系,提出了一种Viterbi截尾译码的改进算法,并将其应用到Turbo码的SOVA译码中。仿真表明,可以很好地降低复杂性和功耗。对Viterbi译码,可使留选存储的规模和功耗减少约20％,回溯单元的规模和功耗减少约30％。对Turbo码的SOVA译码,可使可靠值存储和输出单元的规模和功耗降低约15％,或迭代次数减少一半。     

一类循环码的神经网络软判决译码算法

本文分析了一类循环码的结构特性，提出了这类循环码的神经网络软判决译码算法。新算法的复杂度比现有一般的神经网络译码算法要低得多，而其译码性能接近大似然译码。     

一种新的空时格形码软判决自适应解码算法

本文提出一种针对空时格形码的软判决自适应双向解码算法.通过执行双向解码,该解码算法充分利用了TDMA下行链路相邻时隙的前导序列,并给出高质量的软判决解码输出;同时,所提出的两步最小均方算法以较低的运算开销实现了对时变信道的自适应跟踪.文章最后给出计算机仿真结果.     

基于预译码的极化码最大似然简化连续消除译码算法

针对极化码译码串行输出造成较大译码时延的问题,该文提出一种基于预译码的最大似然简化连续消除译码算法。首先对译码树节点存储的似然值进行符号提取并分组处理,得到符号向量组;然后比较符号向量组与该节点的某些信息位的取值情况,发现向量组中储存的正负符号分布规律与该节点的中间信息位的取值具有一一对应的关系;在此基础上对组合码中间的1～2 bit进行预译码;最后结合最大似然译码方法估计组合码中的剩余信息位,从而得到最终的译码结果。仿真结果表明：在不影响误码性能的情况下,所提算法与已有的算法相比可有效降低译码时延。

     

Backward Interpolation Architecture for Algebraic Soft-Decision Reed–Solomon Decoding

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.     

Applications of Algebraic Soft-Decision Decoding of Reed–Solomon Codes

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.     

An Efficient Algorithm for Soft-Decision Decoding of the (24, 12) Extended Golay Code

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.