基于GPU并行计算技术的大约束长度卷积码的恶码检验

卷积码生成多项式对通信系统中信道编译码的性能有决定性影响,通常我们利用计算机搜索大约束长度的卷积码生成多项式,在搜索得到的生成多项式中有相当数量是恶性的需剔除,因此必须对搜索到的生成多项式进行检验.判定一个编码器的生成多项式是否是恶性的方法可以是数学推导或Matlab计算.但只适合约束长度较短的卷积码,而当约束长度较大时,运用现有的计算手段很难对编码器生成多项式进行检验.本文提出了一种新的基于GPU的高性能并行运算技术验证卷积码生成多项式的方法,GPU在进行大约束长度卷积码的恶码检验上有明显的速度优势.     

扩展卷积码生成矩阵的统一表述

针对在删除卷积码识别过程中缺乏对扩展卷积码先验认知的问题,提出了一种求解母码与扩展卷积码生成矩阵的统一表述方法。通过分析编码器输入输出关系的基本物理意义,先后以( n,1,m)、(n,k,m)作为母码,构建了其与扩展后编码器多项式系数的对应关系模型,归纳和证明了扩展卷积码生成矩阵的统一表述定理。验证结果表明：该定理能够对扩展卷积码生成矩阵实现快速计算,为遍历和重建删除卷积码的删除图样和母码生成矩阵提供方便。     

(n，1，m)递归系统卷积码的盲识别

递归系统卷积码(RSC码)是Turbo码子编码器常采用的编码形式。针对(n,1,m)递归系统卷积码的盲识别问题,给出了完整的编码参数和生成多项式识别方法。首先,采用矩阵分析法先求得卷积码参数,避免后续识别生成多项式时因参数循环估计带来的额外计算量。然后,根据RSC码的特性推导出生成多项式识别模型,给出了模型的具体求解步骤,并对所采用的Walsh-Hadamard变换算法进行了介绍。最后,运用Matlab平台进行仿真验证。仿真结果表明,该方法容错性能明显优于常规方法,在误码率为10-2条件下成功识别概率能达到90%,对于Turbo码的进一步研究具有重要意义。     

卷积译码的维特比算法和实现技术

介绍了卷积编码、解码的原理及适用于卷积码和网格码维特比译码的编程技术,叙述了用德州仪器(TI)TMS32054CX实现维特比算法的过程。认为此基本方法可用于对任何卷积码进行解码和译码,比如序列译码等。     

循环码的编、译码电路

可以用反馈移位寄存器作为电路来实现循环码的编译码。编码意味着从信息位中求出监督位;译码就是检出和在可能时纠正一些错误。已在1.6节和4.5节中介绍过反馈移位寄存器了。图7.1是由 k 个二进制储存位和一些反馈路径组成的反馈移位寄存器。它的反馈样本相当于生成多项式     

高误码率下Turbo码分量编码器快速识别算法

针对目前Turbo码中,分量编码器递归系统卷积码识别算法计算量大,容错性不好两大缺点,该文提出了一种容错性能较好的快速识别算法。首先,在分析递归系统卷积码特殊结构的基础上,定义了更具普遍意义的广义码重概念;其次,建立出递归系统卷积码生成多项式数据库,按照数据库中多项式是否为实际编码多项式的情况,分析出多项式所对应的结果向量广义码重概率分布;然后,按照分析出的广义码重概率分布,基于极大极小准则,导出快速识别算法判决门限的计算公式;最后通过遍历多项式数据库,将遍历的多项式所对应的校验方程广义码重值与判决门限比较,从而实现参数的快速识别。仿真结果表明：理论分析出的广义码重概率分布与仿真结果相一致,同时算法容错性能较好,在误码率高达0.09的条件下,各种编码约束长度下的递归系统卷积码识别率在90%以上,并且计算复杂度较小。     

一种具有混合编码器结构的自适应HARQ机制

本文提出了一种具有混合编码器结构的自适应HARQ机制。该机制根据当前信道质量和业务对时延敏感性的要求,自适应调整编码模式。与传统的HARQ机制不同的是它采用了新的编码器结构,利用Turbo码编码器由两个递归系统卷积编码器构成的特点,实现了可调速率的卷积码和可调速率的Turbo码,减少了硬件实现所需的资源。     

LTE中咬尾卷积编码器的VHDL设计

咬尾卷积码编码具有不要求传输任何额外比特的优点,成为LTE通信系统中重要的编码方式。在介绍LTE物理信道结构的基础上,分析了咬尾卷积码编码器的编码原理,设计了咬尾卷积编码器的工作时序,然后基于Quartus-Ⅱ平台对咬尾卷积码编码器进行了VHDL设计,并利用Modelsim进行了波形仿真与验证。结果表明:采用VHDL设计方法实现咬尾卷积码编码具有设计灵活、修改方便的特点,能满足LTE通信系统的编码要求。     

卷积码的神经网络编码方法

根据卷积码的编码原理以及卷积码编码器的结构特点,结合BP神经网络的结构特征和工作原理,并将它们有机地结合起来,研究了卷积码的BP神经网络编码方法。利用BP神经网络输入和输出之间的非线性映射关系实现卷积码编码器的编码功能,为卷积码编码提供一条有效可行的实现途径。     

数字通信中卷积交织盲识别方法

分析了卷积交织原理和交织器中移位寄存器的工作方式.在无任何辅助信息下,利用卷积交织器中移位寄存器所设初始值被交织后在交织序列中保持不变的特性,提出叠加法来确定交织序列中原移位寄存器初始值位置,并以此对卷积交织器支路数和每条支路增加的移位寄存器数这两个重要参数进行估计.为保证叠加结果的正确性,同时提出一种判决准则对叠加法...     

A High-Performance Codec Suitable for the GSM Half-Rate Coding System

1IntroductionTheGSMpanEuropeandigitalradiosystemhas-beendesignedwithaparticularTDMAframestfllcturewhichenablestheusingofeitherfull-rateorhalf-ratechannels.Speechandchannelcodingalgorithmsforfull-ratechannelshavebeenindependentlystandardized,leadingrespectivelytotheRPE-LTPalgorithmandprotectionschemebasedonaconvolutionalcodewithaCRCforerrordetection.StandardiZationofacombinedspeechandchannelhalf-ratecodecataglobalrateofII.4kbpshasstartedunderthecontrolofETSI.Theobjectiveisverychalleng…     

802.16e系统中CTC译码算法研究

作为802.16e标准OFDMA系统物理层支持的前向纠错编码方案之一,CTC信道编码方式采用双二进制循环递归系统卷积码编码器,在有效提高编码效率的同时,利用编码器的循环状态设置消除尾比特对译码性能的影响。介绍了协议中定义的CTC编码器结构及循环状态规则,并在经典Turbo码译码算法的基础上采用循环递归算法得到译码所需的循环状态条件,并在16eOFDMA系统中对算法性能进行了仿真验证。     

多速率调制解调器设计与实现

现代通信系统中多种信息速率并存,多速率兼容成为一个突出的问题.基于直接序列扩频（DS-SS）和卷积编码技术,提出了一种可以满足多速率兼容的调制解调器实现方法,通过选择不同长度的伪随机序列或者卷积编码,不同的信息速率占用相同的传输带宽.对扩频、解扩以及卷积码的编码和解码部分进行了较为详细的论述,给出了关键模块的原理和实现方法,对使用此调制解调器的通信系统进行了测试,并给出了测试数据.     

Joint source-channel turbo decoding of entropy-coded sources

We analyze the dependencies between the variables involved in the source and channel coding chain. This analysis is carried out in the framework of Bayesian networks, which provide both an intuitive representation for the global model of the coding chain and a way of deriving joint (soft) decoding algorithms. Three sources of dependencies are involved in the chain: (1) the source model, a Markov chain of symbols; (2) the source coder model, based on a variable length code (VLC), for example a Huffman code; and (3) the channel coder, based on a convolutional error correcting code. Joint decoding relying on the hidden Markov model (HMM) of the global coding chain is intractable, except in trivial cases. We advocate instead an iterative procedure inspired from serial turbo codes, in which the three models of the coding chain are used alternately. This idea of using separately each factor of a big product model inside an iterative procedure usually requires the presence of an interleaver between successive components. We show that only one interleaver is necessary here, placed between the source coder and the channel coder. The decoding scheme we propose can be viewed as a turbo algorithm using alternately the intersymbol correlation due to the Markov source and the redundancy introduced by the channel code. The intermediary element, the source coder model, is used as a translator of soft information from the bit clock to the symbol clock     

TETRA集群通信系统信道编码实现方案

在频谱利用率得到保证的前提下，为了进一步提高信道对传输差错控制的能力，TE－TRA标准采用了较为复杂的信道编码技术。文章通过介绍TETRA标准中所采用的信道纠错编码方案对几种纠错编码技术及其性能进行了较为详细的分析，在此基础上给出了信道编码器的实现方案。     

Progressive Video Coding for Noisy Channels

We extend the work of Sherwood and Zeger to progressive video coding for noisy channels. By utilizing a three-dimensional (3D) extension of the set partitioning in hierarchical trees (SPIHT) algorithm, we cascade the resulting 3D SPIHT video coder with the rate-compatible punctured convolutional channel coder for transmission of video over a binary symmetric channel. Progressive coding is achieved by increasing the target rate of the 3D embedded SPIHT video coder as the channel condition improves. The performance of our proposed coding system is acceptable at low transmission rate and bad channel conditions.     

（2,1,7）卷积码编译码器的FPGA实现

卷积码是一种重要的前向纠错信道编码方式,其纠错性能常常优于分组码,且（2,1,7）卷积码已应用于现代卫星通信系统中。Viterbi译码算法能最大限度地发挥卷积码的优异性能。这里采用Verilog HDL语言设计出（2,1,7）卷积码的编码器模块和基于Viterbi算法的译码器模块,译码器采用全并行结构,译码速度快。阐述了编译码器各模块的设计原理,并在ModelSim给出各模块的仿真测试结果。同时对译码器进行纠错性能测试,测试结果表明该Viterbi译码器有良好的纠错性能。     

Low bit-rate video coding using wavelet vector quantisation

A method for low bit-rate video coding based on wavelet vector quantisation is proposed. Motion estimation/compensation using overlapped block matching (OBM) is employed to eliminate the blocking effects in the prediction error introduced by conventional block matching. It is shown that OBM significantly increases the efficiency of the wavelet transform coder. The motion-compensated interframe prediction error is decomposed using a wavelet transform and a method is employed for the efficient coding of the wavelet coefficients. In this technique, the coefficients are coded with a zero-tree multistage lattice vector quantiser. Simulation results are provided to evaluate the coding performance of the described coding scheme for low bit-rate video coding. It provides constant bit rate, obviating the need for buffer, with just small fluctuations in PSNR. Moreover, comparison with the RM8 implementation of the standard H261 video coder shows that the presented codec provides improvements in both peak signal-to-noise ratio and picture quality     

Optimal allocation of bandwidth for source coding, channel coding, and spreading in CDMA systems

This paper investigates the tradeoffs between source coding, channel coding, and spreading in code-division multiple-access systems, operating under a fixed total bandwidth constraint. We consider two systems, each consisting of a uniform source with a uniform quantizer, a channel coder, an interleaver, and a direct-sequence spreading module. System A is quadrature phase-shift keyed modulated and has a linear block channel coder. A minimum mean-squared error receiver is also employed in this system. System B is binary phase-shift keyed modulated. Rate-compatible punctured convolutional codes and soft-decision Viterbi decoding are used for channel coding in system B. The two systems are analyzed for both an additive white Gaussian noise channel and a flat Rayleigh fading channel. The performances of the systems are evaluated using the end-to-end mean squared error. A tight upper bound for frame-error rate is derived for nonterminated convolutional codes for ease of analysis of system B. We show that, for a given bandwidth, an optimal allocation of that bandwidth can be found using the proposed method.     

Tradeoffs of Source Coding, Channel Coding and Spreading in Frequency Selective Rayleigh Fading Channels

This paper investigates the tradeoffs of source coding, channel coding and spreading in CDMA systems. We consider a system consisting of an image source coder, a convolutional channel coder, an interleaver, and a direct sequence spreading module. With different allocations of bandwidth to source coding, channel coding and spreading, the system is analyzed over a frequency selective Rayleigh fading channel. The performance of the system is evaluated using the cumulative distribution function of peak signal-to-noise ratio. Tradeoffs of different components of the system are determined through simulations. We show that, for a given bandwidth, an optimal allocation of that bandwidth can be found. Tradeoffs among the parameters allow us to tune the system performance to specific requirements.