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

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

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

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

线性分组码的神经网络译码

介绍了神经网络与线性分组码之间的关系，并在文献[1]的基础上证明了软判决译码与求解能量函数最大值之间的等价性，然后以(7，4，3)汉明码为例介绍了神经网络在循环码硬判决、软判决译码中的应用。     

RS码译码算法对比研究

RS码所具有的高效译码性能使其被广泛应用于数据通信和存储系统的差错控制中。本文主要对目前常用的RS码的硬判决译码算法和K—V代数软判决译码算法进行对比研究。通过对两种算法原理的理论分析,给出了RS码在硬判决与软判决的算法下的计算机仿真。结果表明两种算法均能得到良好的译码效果,而软判决译码算法较硬判决方式能更有效地带来系统增益。而软判决译码算法可以通过适当提高复杂度来改善系统的性能。     

级联系统中的软输出及软判决

在数字通信系统中 ,经常会遇到将两个Viterbi译码级联起来的情况。对于一个将两个Viterbi译码级联起来的系统 ,我们希望内部的Viterbi译码能够软输出 ,从而使外部的Viterbi译码能够软判决 ,这样可以大大提高系统性能。本文正是基于此目的 ,研究了Viterbi算法的软输出及其软判决问题 ,并在已有算法的基础上提出了一种新的软判决引导的方法。     

软判决译码综述

本文首先介绍了纠错码中软判决译码算法提出的背景,概述了线性分组码的主要几类软判决译码算法的基本概念和发展过程,它们的优缺点和发展趋势。最后介绍了卷积码软判决译码算法发展概况。     

一种改进的最大似然软判决译码

本文提出了一个基于Dijkstra's算法(DA)的线性分组码最大似然软判决译码(SDA),与已有的译码方法相比,SDA译码具有新的特点(1)采用新的度量函数,使计算更简单;(2)采用更有效的搜索算法——DA算法,实现最大似然软判决译码;(3)建立错误图样的广义门限,进一步加快译码速度.模拟表明,与其它软判决译码算法相比,该译码算法在保持最优译码性能的同时,能明显地提高译码速度.同时指出采用非最佳信号形式会导致性能损失近3dB.     

Golay码译码算法的研究及改进

本文针对卫星通信协议中（24,12）格雷码的编译码原理进行了介绍。详细介绍了硬判决译码和软判决译码算法原理,并针对软判决译码算法提出了两种改进方法,通过matlab仿真,结果显示可以达到通信协议中误码率的要求。     

用可变的软距离门限改进Chase2算法

本文计算了用Ｃｈａｓｅ２算法不可捕获的错误图样的软重量的下降，由此证明了当接收序列到某个码字的软判决距离满足王新梅提出的广义门限时，该算法与最大似然译码有相同的译码结果。又进一步得随接收序列可信度变化的可变门限，可以用来加快软判决译码的速度而不损失译码性能。     

软判决Fano译码算法的FPGA实现

Fano译码算法一般采用软件实现,受制于计算机的结构,译码速度较慢。为大幅度提高译码速度,研究软判决Fano译码算法的全硬件实现方案,即采用AHDL（Ahera硬件描述语言）设计软判决Fano译码译码器,使用FPGA（现场可编程门阵列）予以实现。介绍了总体结构,重点描述构建Fano软判决译码器关键部件——状态机的设计。实测数据表明,在相同时钟频率条件下,软判决Fano译码算法的全硬件实现比软件方案至少快20倍。     

Iterative algebraic soft-decision list decoding of Reed-Solomon codes

In this paper, we present an iterative soft-decision decoding algorithm for Reed-Solomon (RS) codes offering both complexity and performance advantages over previously known decoding algorithms. Our algorithm is a list decoding algorithm which combines two powerful soft-decision decoding techniques which were previously regarded in the literature as competitive, namely, the Koetter-Vardy algebraic soft-decision decoding algorithm and belief-propagation based on adaptive parity-check matrices, recently proposed by Jiang and Narayanan. Building on the Jiang-Narayanan algorithm, we present a belief-propagation-based algorithm with a significant reduction in computational complexity. We introduce the concept of using a belief-propagation-based decoder to enhance the soft-input information prior to decoding with an algebraic soft-decision decoder. Our algorithm can also be viewed as an interpolation multiplicity assignment scheme for algebraic soft-decision decoding of RS codes.     

Soft-decision list decoding of hermitian codes

This paper proposes the first complete soft-decision list decoding algorithm for Hermitian codes based on the Koetter- Vardy's Reed-Solomon code decoding algorithm. For Hermitian codes, interpolation processes trivariate polynomials which are defined over the pole basis of a Hermitian curve. In this paper, the interpolated zero condition of a trivariate polynomial with respect to a multiplicity matrix M is redefined followed by a proof of the validity of the soft-decision scheme. This paper also introduces a new stopping criterion for the algorithm that tranforms the reliability matrix ? to the multiplicity matrix M. Geometric characterisation of the trivariate monomial decoding region is investigated, resulting in an asymptotic optimal performance bound for the soft-decision decoder. By defining the weighted degree upper bound of the interpolated polynomial, two complexity reducing modifications are introduced for the soft-decision scheme: elimination of unnecessary interpolated polynomials and pre-calculation of the coefficients that relate the pole basis monomials to the zero basis functions of a Hermitian curve. Our simulation results and analyses show that soft-decision list decoding of Hermitian code can outperform Koetter-Vardy decoding of Reed-Solomon code which is defined in a larger finite field, but with less decoding complexity.     

Architecture and Implementation of an Interpolation Processor for Soft-Decision Reed–Solomon Decoding

Reed-Solomon codes are powerful error-correcting codes that can be found in many digital communications standards. Recently, there has been an interest in soft-decision decoding of Reed-Solomon codes, incorporating reliability information from the channel into the decoding process. The Koetter-Vardy algorithm is a soft-decision decoding algorithm for Reed-Solomon codes which can provide several dB of gain over traditional hard-decision decoders. The algorithm consists of a soft-decision front end to the interpolation-based Guruswami-Sudan list decoder. The main computational task in the algorithm is a weighted interpolation of a bivariate polynomial. We propose a parallel architecture for the hardware implementation of bivariate interpolation for soft-decision decoding. The key feature is the embedding of both a binary tree and a linear array into a 2-D array processor, enabling fast polynomial evaluation operations. An field-programmable gate array interpolation processor was implemented and demonstrated at a clock frequency of 23 MHz, corresponding to decoding rates of 10-15 Mb/s     

Trellis decoding of combined diversity-coding scheme (MLSD) forfading channels

The performance of a receiver using a combination of soft-decision decoding and diversity reception is investigated for nonselective multipath Rayleigh fading channels. A new scheme for soft-diversity, soft-decision detection, maximum likelihood selection and decoding (MLSD), is introduced, in which decisions on the diversity channels and decoding are carried out simultaneously by using a trellis and the Viterbi algorithm     

Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes (Corresp.)

A decoding algorithm for linear codes that uses the minimum weight words of the dual code as parity checks is defined. This algorithm is able to correct beyond the half minimum distance and has the capability of including soft-decision decoding. Results on applying this algorithm to quadratic residue (QR) codes, BCH codes, and the Golay codes (with and without soft-decision decoding) are presented.     

Soft-decision decoding of Reed-Muller codes as generalized multipleconcatenated codes

Constructs Reed-Muller codes by generalized multiple concatenation of binary block codes of length 2. As a consequence of this construction, a new decoding procedure is derived that uses soft-decision information. The algorithm is designed for low decoding complexity and is applicable to all Reed-Muller codes. It gives better decoding performance than soft-decision bounded-distance decoding. Its decoding complexity is much lower than that of maximum-likelihood trellis decoding of Reed-Muller codes, especially for long codes     

基于双向逐幸存路径处理的空时格形码软判决自适应解码

本文提出一种针对TDMA下行链路的空时格形码自适应解码算法.为充分利用下行链路相邻时隙前导序列中的正交导引信号,该解码算法采用了双向逐幸存路径处理技术——正向处理利用基于当前时隙前导序列的自适应信道估计实现正向解码,并将软判决结果传递给反向处理模块;以正向软判决为先验知识,反向处理利用基于下一时隙前导序列的自适应信道估计实现反向解码,并将反向软判决作为最终结果输出.计算机仿真结果表明:在存在卷积外码的情况下,与基于最大似然序列检测的单向硬判决解码相比,基于所提出算法的软判决解码在多普勒频移小于60赫兹的时变信道中可提供1～2dB的增益.     

Applications of algebraic soft-decision decoding of Reed-Solomon codes

Efficient soft-decision decoding of Reed-Solomon (RS) codes is made possible by the Koetter-Vardy (KV) algorithm which consists of a front-end to the interpolation-based Guruswami-Sudan (GS) 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(255,239) 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. Queueing analysis verifies the practicality of the redecoding architecture by showing that only a modestly sized RAM buffer is required.     

基于可靠性的LDPC码软判决解码算法的研究

描述Gallager提出的LDPC码的第一解码方案，在此基础上提出基于可靠性的软判决解码算法。软判决算法充分考虑了接收符号的可靠性信息。为了防止相同位的重复翻转，算法中引入了“禁翻”(taboo)功能。为了快速搜索翻转位，对不满足的校验方程数采用最大投票数排队算法。这些措施的合理应用提高了基于校验和的位翻转解码算法的性能。