RS码的时域编码/频域译码技术

提出一种RS混合译码技术－时域编码／频域译码，对照单纯的时域编译 码和频域编译码分析了其优越性。这种编译码技术可广泛应用于数字电视信号的传输及其它数字通信场合。     

一种新的缩短RS码迭代译码方案

为了在EPON中应用GF(256)标准RS码对信息帧长大于255位的信息流进行编码,并提高RS码的编码增益,提出了一种新的缩短RS码的编译码方案。该方案通过两个缩短RS码的交叠编码和互相迭代译码,可以提高编译码增益。RS码BM硬判决译码和chase软判决译码的计算机仿真表明,该方案对缩短RS码的软硬判决译码性能都有明显提高。     

两种在频域编译RS码的方法

本文讨论了利用快速付里叶变换编译RS码的技术,并在此基础上提出了两种在频域编译RS码的方法。采用这两种方法,只要进行一次付里叶变换即可译码,因而大大加快了译码速度,并减少了设备费用。     

RS编译码技术在一种数传系统中的应用

从伽罗华域讨论RS编译原理着手，并分析时域，频域编译码原理，着重讨论在数传系统中引用RS频域编译码技术，提高数传系统的可靠性。     

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

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

Turbo码编译码技术

深入地介绍了Turbo码编译码技术,包括:Turbo码编码器的结构、Turbo码的译码器结构、Turbo码的迭代译码算法和Turbo码的性能及其优、缺点。Turbo码编译码技术以其优异的性能和可实现的复杂度特性定有良好的应用前景。     

中短长度LDPC码与卷积码的比较

文中将一类短码长LDPC码与IS-95规定的卷积码从性能、编译码运算复杂度、纠突发错误能力以及不等保护能力等角度进行了比较。结果表明短码长的LDPC码在编码复杂度以及译码的空间复杂度上逊于卷积码,但在译码性能、纠突发错误能力和不等保护能力上有较大的优势,并且译码的运算复杂度相近。     

基于级联码的差错控制系统的设计与实现

介绍了级联码编码与译码的设计和实现。该级联码由RS码、卷积码以及郑交织器构成。编码电路可用CPLD实现，译码采用AHA4210芯片完成，速度快。编译码的各种参数和过程由软件控制，非常灵活。通过加载不同的软件可以在同一硬件平台上实现多种的级联、RS码、卷积码或是卷交织器。在工程中有很高的实用价值。     

基于联合译码的RS码中继协作系统设计

协作通信技术是通过一定规则使单天线终端能够共享其他用户的天线,从而达到空间分集的效果,能够有效地减轻通信系统中信道衰落的不良影响.RS码在短码且信息位一定的条件下,其译码复杂度较低,且具有较强的应对突发错误的能力.基于此,提出了一种基于联合译码的缩短RS码的中继编码协作系统方案.该方案通过在源节点设置码长自由的缩短RS...     

CSS型量子卷积码的编译码方法

该文给出了 型量子卷积码的一般结构,并计算得到其稳定子, 算子与 算子的标准型,重点讨论了这类码的编译码实现方法,描述了其编译码网络。 型量子卷积码的编译码过程只涉及Hadamard操作与控制非操作,因此编译码复杂度低,网络结构非常简单。     

RS码频域编译码的计算机模拟

频域编译码是近年来由Ｂｌａｈｕｔ等人提出来的纠错码编译方法。本文介绍了在时域和频域编译ＲＳ码的基本方法，并给出了在移动信息道的简单分群Ｍａｒｋｏｖ模型下频域编译码的计算机模拟方法和结果。     

Outage Probability Analysis of Three-User Reed–Solomon Coded Cooperation Scheme for Wireless Slow Fading Channel

In a coded cooperation scheme, the relay must decode and re-encode data. This process needs to be completed rapidly. Therefore, a simple channel coding/decoding scheme that requires low computational loads is needed. Reed–Solomon (RS) codes are simple, forward error-correction codes with low decoding computational loads. This paper introduces a three-user RS coded cooperation scheme that aims to have simple encoding/decoding complexity as well as to increase diversity order. It also presents the mathematical derivations of outage probability and investigates the outage performance of the three-user RS coded cooperation scheme. The derived outage probability expressions prove that the three-user RS coded cooperation scheme can achieve full diversity. Numerical bit error rate comparisons show that the three-user RS coded cooperation scheme performs better than a two-user scheme under various inter-user and uplink channel conditions. Outage probability performance improves at approximately 5 dB for regions with low signal-to-noise ratio (SNR) and 10 dB for regions with high SNR under a slow-fading channel. The paper also presents the complete calculated numerical tables for outage probability terms (integral terms) that do not have closed-form solutions.     

Mark XIIA Mode5中RS编译码器设计及性能分析

新型Mark XIIA Mode 5敌我识别系统由美军及北约共同研制,用以提高战场态势感知能力.为提高系统数据传输的抗干扰能力,Mode 5采用了RS(11,9)编译码.文章首先分析了RS码本原多项式及生成多项式,并构建了RS(11,9)伽罗华域,然后给出RS(11,9)编/译码算法.最后利用Simulink仿真平台对RS(11,9)的编/译码过程进行仿真和抗干扰性能分析.     

非系统RS(31,19)编译码算法研究与FPGA实现

针对战术数据链系统低时延数据传输需求,提出一种适用于数据链系统的信道编码方案—非系统缩短码RS(31,19)。本文从MS多项式的观点讨论了非系统RS码的编码和译码算法,并对缩短RS码的编译码算法进行了研究。最后在FPGAEP3SE110上采用了一种改进的BM算法,成功实现RS(31,19)编译码复杂算法,有效提高了译码速度,简化了数据链系统硬件设计。     

GPON系统OLT接收侧FEC解码电路的设计

前向纠错(FEC)在通信系统中有着广泛的应用.在吉比特无源光网络(GPON)系统中,上行带宽是以动态方式进行分配的,光线路终端(OLT)接收侧要求能够支持RS(255,239)及其缩短码的解码.文章采用一种"变换时钟域+RS全码解码"的方法,通过基于双端口随机存储器(DPRAM)的时钟域变换后,再进行RS全码解码.采用这种方式能够以较低的硬件复杂度完成FEC解码.     

A novel RS BTC coding scheme for optical communications

A novel Reed Solomon(RS) block turbo code(BTC) coding scheme of RS(63,58)×RS(63,58) for optical communications is proposed.The simulation results show that the net coding gain(NCG) of this scheme at the sixth iteration is more than that of other coding schemes at the third iteration for the bit error rate(BER) of 10-12.Furthermore,the novel RS BTC has shorter component code and rapider encoding and decoding speed.Therefore,the novel RS BTC coding scheme can be better used in high-speed long-haul optical communication systems,and the novel RS BTC can be regarded as a candidate code of the super forward error correction(super-FEC) code.Moreover,the encoding/decoding design and implementation of the novel RS BTC are also presented.     

RS码频域纠错编码在激光对潜通信信道中的实现方法

介绍了信道编码在激光对潜通信系统中的重要作用，介绍了频域编译ＲＳ码的基本方法，并给出了脉冲位置调制信道的ＲＳ码频域编译码的计算机模拟方法和结果。     

Fast generalized minimum-distance decoding of algebraic-geometryand Reed-Solomon codes

Generalized minimum-distance (GMD) decoding is a standard soft-decoding method for block codes. We derive an efficient general GMD decoding scheme for linear block codes in the framework of error-correcting pairs. Special attention is paid to Reed-Solomon (RS) codes and one-point algebraic-geometry (AG) codes. For RS codes of length n and minimum Hamming distance d the GMD decoding complexity turns out to be in the order O(nd), where the complexity is counted as the number of multiplications in the field of concern. For AG codes the GMD decoding complexity is highly dependent on the curve in consideration. It is shown that we can find all relevant error-erasure-locating functions with complexity O(o₁nd), where o₁ is the size of the first nongap in the function space associated with the code. A full GMD decoding procedure for a one-point AG code can be performed with complexity O(dn²)     

Serial Concatenation of Space‐Time and Recursive Convolutional Codes

We propose a new serial concatenation scheme for space‐time and recursive convolutional codes, in which a space‐time code is used as the outer code and a single recursive convolutional code as the inner code. We discuss previously proposed serial concatenation schemes employing multiple inner codes and compare them with the new one. The proposed method and the previous one with joint decoding, both performing a combined decoding of the simultaneous output signals from multiple antennas, give a large performance gain over the separate decoding method. In decoding complexity, the new concatenation scheme has a lower complexity compared with the multiple encoding/joint decoding scheme due to the use of the single inner code. Simulation results for a communication system with two transmit and one receive antennas in a quasi‐static Rayleigh fading channel show that the proposed scheme outperforms the previous schemes.     

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.