一种二进制算术码的软解码算法

算术码是一种高效率的熵编码方法,广泛应用在多媒体压缩中.但是,算术码的高压缩性能也导致其对信道传输中残存的误码极其敏感,存在误码扩散现象.本文将算术码解码过程表示为一个有限状态机(FSM),利用最大后验概率估计准则(MAP)进行序列解码,FSM提供先验信息估计和差错检测功能.通过对独立信源和JPEG2000编码图像的实验表明,该解码算法降低了二进制算术码的序列差错率,提高了解压缩图像的质量.     

基于纠错算术码的信源信道自适应联合编解码系统

对信源信道自适应联合编码方法进行了研究,提出了一种新的基于纠错算术码的联合信源信道编解码系统。该系统在编码端利用算术码内嵌禁用符号实现信源信道一体式编码,即利用马尔科夫信源模型和根据信道状态信息自适应地调整禁用符号概率大小从而调整编码码率来实现信道自适应;在解码端,推导出了基于MAP的解码测度数学公式并基于此测度公式提出了一种改进的堆栈序列估计算法。与传统的信道自适应编码算法不同,该自适应编码算法只需调整一个参数:禁用符号,且理论上可获得连续可变的编码码率。实验结果表明,与经典的Grangetto联合编码系统以及分离编码系统相比,所提出的编码系统具有明显改善的性能增益。     

低速率语音通信中高效维特比译码的FPGA实现

维特比译码是卷积码勰码中一种最大似然的译码算法,文章给出了一种高效的卷积码编码及维特比解码FPGA硬件实现的结构,提出了一种采用（2,1,7）卷积码对2．4kbps MELP语音编码参数进行抗误码保护的信道编码方案。实验表明,能有效提舞噪声信道下传输的语音参数的抗误码性能。     

一种改进的LT码构造方法

通过分析信道信息在参与LT码译码过程的特点,给出迭代深度的概念。在找出编码符号的抗误码性能与迭代深度关系的基础上对累积边增加法(PEG)加以改进来构造LT码,试图从Tanner图中找出优秀拓扑结构应具备的特征。与传统的PEG法相比,使用改进后的PEG法(IPEG)构造的LT码,其输入符号的度数分布严格符合Poisson分布,且度数为1的符号不发生错误,极大地提高了LT码的抗误码性能。     

一种新型的卷积码混合译码算法

该文提出了一种级联的卷积码混合译码算法。该算法由两级译码实现,第1级采用置信传播(Belief-Propagation, BP)算法,而第2级采用修改的维特比译码(Modified Viterbi Decoding, MVD)算法。BP首先对接收序列进行预译码,并利用伴随式将译码输出的对数似然比值分为可靠的和不可靠的两类。不可靠的对数似然比值用接收符号取代,可靠的部分硬判决为编码符号,它们共同组成混合序列。随后,MVD对该混合序列作进一步纠错译码。仿真表明,与传统的维特比算法相比,所提出的混合译码算法的误码性能只有很小的损失,其译码平均复杂度在中高信噪比条件下有明显降低。     

基于新停止准则的多进制LDPC码加权符号翻转译码算法

为了降低多进制低密度奇偶校验(Low-Density Parity-Check,LDPC)码译码算法的复杂度,该文提出了基于新停止准则的符号翻转译码算法。该算法根据翻转函数和接收比特可靠性度量来确定对应的翻转符号,通过分析不满足校验方程个数的变化趋势来提前终止迭代。仿真结果表明,新算法在保持原有符号翻转译码算法误码性能不变的情况下,极大地减少了译码迭代次数,取得了译码性能和复杂度的折衷。     

CPM调制的迭代检测技术

CPM信号具有包络恒定、峰均比小、功率利用率高的优点。针对CPM信号的特征,比较了最大似然序列检测Viterbi算法和逐符号的最大后验概率(MAP)解调算法的特点,重点研究了使用迭代检测技术进行软输入输出解调及译码的MAP解调方法。在AWGN信道条件下对CPM全响应和部分响应信号进行了误码性能仿真,结果表明采用相干解调和译码,迭代检测方案可得到较高的编码增益。     

OFDM对提高短波跳频性能的作用

在短波跳频通信的环境下,基于OFDM能有效抗符号间干扰的原理,研究了OFDM对短波跳频性能的影响。研究采用Matlab/Simulink仿真工具,考虑了有无编码情况下的误码性能。结果显示,结合OFDM技术后的跳频系统性能要高于结合之前的,考虑编码后的性能要高于无编码的。     

一种新的基于最大似然估计的迭代定时恢复算法

符号同步误差对LDPC译码性能会产生严重恶化,如何在低信噪比下,利用LDPC的编码增益来提高符号同步误差估计性能是本文的核心问题.基于最大似然(ML)准则,提出了似然函数导数归零的码辅助迭代符号同步算法,该算法以单一编码分组为单位进行迭代估计,不但可以应用于连续信道,同样适用于突发通信.仿真结果表明,本文提出算法的估计性能可以在信噪比很低的情况下逼近MCRB,在符号同步误差估计值快速收敛的同时,译码性能接近符号精确同步的理想情况.     

高阶调制系统下LDPC码优化设计

为了提高编码调制系统的整体编码增益,提出一种高阶调制系统下LDPC码的度分布优化方法.根据高阶调制符号中不同比特的误比特特性,将调制符号所经历信道建模为一组对称二进制输入加性高斯信道.在此基础上,推导了高阶调制系统下LDPC码高斯近似密度进化分析方法,并得到译码收敛条件.结合度分布约束关系及译码收敛条件,提出高阶调制系统下LDPC码的度分布优化问题及差分进化实现方法.仿真结果表明,设计的LDPC码在高阶调制系统中的渐进性能和误码性能优于基于比特优化映射的编码调制方案.     

The low-cost packet radio

Research on packet switched radio networks requires reconfigurable testbeds with large numbers of readily deployable radios. This motivated the development of a small, low-cost packet radio (LPR) with the flexibility to support extensive network experiments, and to be amenable to tailoring to specific end-use applications. The LPR incorporates a digitally controlled direct sequence minimum shift keyed spread-spectrum radio and a microprocessor-based packet switch. Code changeable surface acoustic wave (SAW) matched filtering provides processing gain at burst symbol rates of 100k and 400k symbols per second in the presence of interference. Coherent recursive integration enhances synchronization performance, provides synchronous detection of the data, and serves the adaptive multipath accumulator. Forward error correction utilizing convolutional encoding and sequential decoding is incorporated at four different code rates for both burst symbol rates. The microprocessor runs the networking software. Requirements, design, and performance data for the LPR engineering model are presented.     

Errors and erasures decoding of BCH and Reed-Solomon codes for reduced M-ary orthogonal signaling

The paper presents a comparison of communication systems using different signal constellation sizes and Reed-Solomon or Bose-Chaudhuri-Hocquengem codes with different rates so that the overall required bandwidth is the same for each system. In these comparisons, the channel symbol size is smaller than the code symbol size, so that a code symbol contains parts of multiple channel symbols. Thus, the normal assumption of independent code symbols does not apply. Instead, consideration must be taken to obtain the best arrangement of channel symbols in each code symbol. Analytical expressions are developed to compare the bit error probability performance of comparable systems, based on individual codewords using errors-only decoding and errors and erasures decoding with transmission over a Rayleigh fading channel.     

Joint Source/Channel Coding and MAP Decoding of Arithmetic Codes

Joint Source/Channel Coding and MAP Decoding of Arithmetic Codes In this paper, a novel MAP estimation approach is employed for error correction of arithmetic codes with a forbidden symbol. The system is founded on the principle of joint source channel coding, which allows one to unify the arithmetic decoding and error correction takes into a single process, with superior performance compared to traditional separated techniques. The proposed system improves the performance in terms of error correction with respect to a separated source and channel coding approach based on convolutional codes, with the additional great advantage of allowing complete flexibility in adjusting the coding rate. The proposed MAP decoder is tested in the case of image transmission across the AWGN channel and compared against standard FEC techniques in terms of performance an complexity. Both hard and soft decodng are taken into account, and excellent result in terms of packet error rate and decoded image quality are obtained.     

Stack Algorithm Speech Encoding with Fixed and Variable Symbol Release Rules

Tree codes find wide use in a variety of problems such as source encoding, sequential decoding, pattern recognition, and related fields. Efficient algorithms exist to explore the code trees and are well documented in the literature. All of these algorithms search code trees in an incremental manner, releasing a path map symbol at a time. A recent work has investigated the effect of releasing multiple symbols on the performance of the(M, L)algorithm used with speech. Here we investigate the effect of multiple symbol release rules on the performance of the stack algorithm in the context of speech encoding. We show that significant computational reduction can result with the use of such rules. We use an efficient data structure, the AVL tree data structure, to store code tree paths.     

Advances in the performance of Reed-Solomon codes

This paper presents generalized expressions for the probabilities of correct decoding and decoder error for Reed-Solomon (RS) codes. In these expressions, the symbol error and erasure probabilities are different in each coordinate in a codeword. The above expressions are used to derive the expressions for reliability and delay for Type-I hybrid ARQ (HARQ-I) systems when each symbol in a packet (multiple codewords per packet) has unique symbol error and erasure probabilities. Applications of the above results are demonstrated by analyzing a bursty-correlative channel in which the symbols and codewords within the packet are correlated     

基于混沌密钥控制的联合信源信道与安全算术码编译码算法

该文针对深空通信、移动通信等资源受限网络中的信息有效性、可靠性和安全性传输,提出一种基于混沌密钥控制的联合信源信道与安全算术码编译码算法。该算法在编码端通过混沌映射1控制在算术码内嵌入多个禁用符号,将信道编码检错与密码流的扰乱相结合;同时,通过混沌映射2控制信源符号的算术编码,将信源编码与信息安全相结合,实现了联合信源信道与信息安全编译码。实验结果表明,该算法与现有的同类算法相比,当误包率为10-3时,改善编译码性能0.4 dB,同时增强了可靠性和安全性。     

Iterative decoding of serially concatenated arithmetic and channel codes with JPEG 2000 applications.

In this paper, an innovative joint-source channel coding scheme is presented. The proposed approach enables iterative soft decoding of arithmetic codes by means of a soft-in soft- out decoder based on suboptimal search and pruning of a binary tree. An error-resilient arithmetic coder with a forbidden symbol is used in order to improve the performance of the joint source/channel scheme. The performance in the case of transmission across the AWGN channel is evaluated in terms of word error probability and compared to a traditional separated approach. The interleaver gain, the convergence property of the system, and the optimal source/channel rate allocation are investigated. Finally, the practical relevance of the proposed joint decoding approach is demonstrated within the JPEG 2000 coding standard. In particular, an iterative channel and JPEG 2000 decoder is designed and tested in the case of image transmission across the AWGN channel.     

Maximum-likelihood decoding and code combining for DS/SSMA slottedALOHA

This paper considers the combination of multiple copies of a packet to improve the performance of a slotted direct-sequence spread-spectrum multiple-access (DS/SSMA) ALOHA packet radio system with coherent binary phase-shift keying (BPSK) modulation. Both slotted DS/SSMA ALOHA with and without forward error correction (FEC) are considered. For the case with FEC, maximum-likelihood decoding with code combining is used. Code combining allows for the combination of multiple copies of the same packet (which are typically discarded), to obtain a lower code rate for that specific packet, and therefore an improved probability of successful decoding. In both cases, combining multiple copies of the same packet results in a throughput which is an increasing function over a broad range of offered load, so that the system is more reliable from the point of view of stability. In addition, combining provides a higher throughput and a smaller time delay for packet transmission. This is illustrated by means of analytical and simulation results     

Fast adaptive arithmetic code for large alphabet sources with asymmetrical distributions

We address the problem of constructing an adaptive arithmetic code in the case where the source alphabet is large and there are lots of different symbols with equal counts of occurrence. For an alphabet of N symbols and r distinct symbol weights we describe a code for which the number of operations needed for encoding and decoding is equal to clogr+c/sub 1/ instead of clogN+c/sub 2/ as in previous arithmetic codes, c, c/sub 1/, c/sub 2/ are constants. When r is small relative to N-which is the case for most practical coding problems on large alphabets-the encoding and decoding speed of the suggested code will be substantially greater than with known methods.