基于Markov信源和LDPC编码的信源信道联合译码算法

本文通过利用Markov信源的冗余信息,提出了一种基于系统LDPC码编码器的信源信道联合译码算法（JSCD）。仿真结果显示,当信源中存在更多的冗余信息时,该JSCD算法可相应取得更好的系统性能。     

基于隐马尔科夫模型的多元LDPC联合译码

采用隐马尔科夫模型对信源估计,对基于多进制LDPC码的联合信源信道译码算法展开研究。该算法通过对传统的多进制LDPC译码算法的改进,在迭代过程中加入通过估计算法得到的信源冗余,校正了迭代软信息,提高译码性能。仿真结果表明,在AWGN信道中,改进算法相比传统译码算法性能优越。     

基于MSK和LT码的联合迭代译码算法

传统的简单级联编码调制系统在译码时会造成软信息损失.提出了一种基于MSK和LT码的联合软迭代译码算法,设计了算法的系统模型.利用LT码的软译码和MSK调制的SISO算法,进行联合软迭代译码,提高了编码调制系统的性能.仿真结果表明:在误码率为10-4时,提出的算法比传统的简单级联编码调制算法约有1.5 dB的编码增益.     

一种利用信源冗余的Turbo均衡新算法

为克服无线衰落信道中严重的符号间干扰(ISI)的影响,提出了一种新的利用信源冗余的Turbo均衡算法。该算法将联合信源信道译码技术与Turbo均衡技术结合起来,在均衡、译码、信源之间建立起软信息交互的环路,有效提高了整体接收的性能。外信息传递(EXIT)图分析与计算机仿真均表明,尽管信源冗余给译码器带来的性能提升较为有限,但是将这部分信息反馈回均衡器后,在严重ISI信道,信源冗余度为70%时,整体接收的性能改善约为9.5 dB,基本达到了理想加性高斯白噪声（AWGN）信道下的误码性能。     

一种利用信源冗余的Turbo均衡新算法

为克服无线衰落信道中严重的符号间干扰( ISI)的影响,提出了一种新的利用信源冗余的Turbo均衡算法。该算法将联合信源信道译码技术与Turbo均衡技术结合起来,在均衡、译码、信源之间建立起软信息交互的环路,有效提高了整体接收的性能。外信息传递( EXIT)图分析与计算机仿真均表明,尽管信源冗余给译码器带来的性能提升较为有限,但是将这部分信息反馈回均衡器后,在严重ISI信道,信源冗余度为70%时,整体接收的性能改善约为9.5 dB,基本达到了理想加性高斯白噪声( AWGN)信道下的误码性能。     

噪声信道中基于残留冗余的联合信源信道编码.

对信源编码中的残留冗余在联合编码中的作用进行了研究，提出了一个在噪声信道中对可变长信源编码码流传输提供有效差错保护的联合信源信道编码方法，该方法利用信源编码器输出中的残留冗余为传输码流提供差错保护。与Sayood K提出的系统相比，该方法是基于改进的联合卷积软解码以及采用非霍夫曼码的通用可变长码，更接近于一般的信源和信道编码方法，并且信源符号集的大小也不受限制。仿真表明，所提出的联合编码方法可获得比传统的分离编码方法更高的性能增益。     

噪声信道中基于残留冗余的联合信源信道编码

对信源编码中的残留冗余在联合编码中的作用进行了研究,提出了一个在噪声信道中对可变长信源编码码流传输提供有效差错保护的联合信源信道编码方法,该方法利用信源编码器输出中的残留冗余为传输码流提供差错保护。与SayoodK提出的系统相比,该方法是基于改进的联合卷积软解码以及采用非霍夫曼码的通用可变长码,更接近于一般的信源和信道编码方法,并且信源符号集的大小也不受限制。仿真表明,所提出的联合编码方法可获得比传统的分离编码方法更高的性能增益。     

信源反馈条件下Raptor码的一种解码算法

在Raptor码普通译码方法的基础上,结合信源信道联合译码方法,提出一种利用信源解码器反馈信息作为输入的改进译码的算法,并对此算法进行试验仿真以及参数研究。测试结果显示,在信源信道联合编码条件下,使用这种双信息来源的译码的算法,可以使得信道解码的成功率大幅提高,残留误码率大幅降低。最后,将这种算法与JPEG2000信源编码结合测试,图像的PSNR值比普通译码方法最高提高了6dB。在信道条件恶劣的无线传输中具有重要意义。     

光通信中基于BCJR的BCH译码算法研究

首先从理论上分析了硬判决译码算法和软判决译码算法的性能然后对BCH(Bose,Ray-Chaudhuri,Hocquenghem)码的网格结构以及BCJR(Bahl,Cocke,Jelinek and Raviv)算法进行了详细地分析及推导。实验结果表明,在光信道环境中,在误比特率为10-5时,当仅提高最小汉明距离码率相同或者仅减小码率最小汉明距离相同时,BCJR算法相对于硬判决译码算法的编码增益分别在之前的编码增益基础上又增加了0.15dB和0.25dB。因此设计级联码方案时,应尽可能选择纠错能力较大的内码。此外也可以采用适当增加内码的冗余度相应减小外码的冗余度的方法,在获得更高的编码增益的同时保证整个系统的带宽利用率不变。     

自适应多码率语音编码流的可靠传输

自适应多码率语音编码已入选为第三代移动通信系统的语音压缩编码方案。本文提出了一种适合压缩语音传输的联合信源信道编码方法并对其性能进行了统计比较。利用压缩语音比特流中的固用冗余的信道译码算法是本文的研究重点。仿真结果表明利用信源冗余信息的信道译码器可以获得较大的编码增益。本文所用的信道编码方案为适合语音传输的卷积码。     

结合残留冗余信息与MMSE估计的信源信道联合编解码

文中提出一种利用残留冗余的RDPCM信源信道联合编码系统与最小均方误差估计结合的方法.首先,本文针对联合编码系统修正了SOVA算法,在接收端获得利用残留冗余后的比特似然度;然后利用这些后验信息,对信源预测编码器的输出符号值进行最小均方误差重建后再进行信源译码,从而减小了由于硬判决得到符号值所带来的失真.仿真结果显示这种算法在信噪比的低端最大得到了约2dB的增益.     

Low-complexity iterative joint source-channel decoding for variable-length encoded Markov sources

In this paper, we present a novel packetized bit-level decoding algorithm for variable-length encoded Markov sources, which calculates reliability information for the decoded bits in the form of a posteriori probabilities (APPs). An interesting feature of the proposed approach is that symbol-based source statistics in the form of the transition probabilities of the Markov source are exploited as a priori information on a bit-level trellis. This method is especially well-suited for long input blocks, since in contrast to other symbol-based APP decoding approaches, the number of trellis states does not depend on the packet length. When additionally the variable-length encoded source data is protected by channel codes, an iterative source-channel decoding scheme can be obtained in the same way as for serially concatenated codes. Furthermore, based on an analysis of the iterative decoder via extrinsic information transfer charts, it can be shown that by using reversible variable-length codes with a free distance of two, in combination with rate-1 channel codes and residual source redundancy, a reliable transmission is possible even for highly corrupted channels. This justifies a new source-channel encoding technique where explicit redundancy for error protection is only added in the source encoder.     

Minimum Terms of Residual Redundancy for Successful Iterative Source-Channel Decoding

Iterative source-channel decoding (ISCD) improves the error robustness of a digital communication system by iteratively evaluating natural residual source redundancy and artificial channel coding redundancy in a TURBO-like process. Based on recent results to extrinsic information transfer (EXIT) charts we present a novel (experimental) approach to quantify the minimum terms of residual redundancy which are needed for (almost) successful ISCD. Moreover, we clarify why in certain situations the decoding trajectory exceeds the EXIT-characteristic of soft decision source decoding (SDSD) in an ISCD scheme     

A constrained joint source/channel coder design

The design of joint source/channel coders in situations where there is residual redundancy at the output of the source coder is examined. It has previously been shown that this residual redundancy can be used to provide error protection without a channel coder. In this paper, this approach is extended to conventional source coder/convolutional coder combinations. A family of nonbinary encoders is developed which more efficiently use the residual redundancy in the source coder output. It is shown through simulation results that the proposed systems outperform conventional source-channel coder pairs with gains of greater than 9 dB in the reconstruction SNR at high probability of error     

Joint source-channel decoding of variable-length codes for convolutional codes and turbo codes

Several recent publications have shown that joint source-channel decoding could be a powerful technique to take advantage of residual source redundancy for fixed- and variable-length source codes. This letter gives an in-depth analysis of a low-complexity method recently proposed by Guivarch et al., where the redundancy left by a Huffman encoder is used at a bit level in the channel decoder to improve its performance. Several simulation results are presented, showing for two first-order Markov sources of different sizes that using a priori knowledge of the source statistics yields a significant improvement, either with a Viterbi channel decoder or with a turbo decoder.     

基于HMM的信源—信道迭代联合译码

提出一种在接收端利用Turbo译码软输出,结合HMM（隐马尔可夫模型）中的Baum-Welch重估算法获取信源模型参数并进行信源-信道迭代联合译码的算法.通过含噪接收序列信道译码后的软输出对信源模型参数进行估计,并将迭代估计获得的信源精确概率结构和信道译码结合进行信源-信道联合迭代译码.同时从信息论角度提出用鉴别信息来度量估计获得的信源模型参数的精度,以及确定迭代估计终止的条件.     

Iterative Source-Channel Decoding With Markov Random Field Source Models

We propose a joint source-channel decoding approach for multidimensional correlated source signals. A Markov random field (MRF) source model is used which exemplarily considers the residual spatial correlations in an image signal after source encoding. Furthermore, the MRF parameters are selected via an analysis based on extrinsic information transfer charts. Due to the link between MRFs and the Gibbs distribution, the resulting soft-input soft-output (SISO) source decoder can be implemented with very low complexity. We prove that the inclusion of a high-rate block code after the quantization stage allows the MRF-based decoder to yield the maximum average extrinsic information. When channel codes are used for additional error protection the MRF-based SISO source decoder can be used as the outer constituent decoder in an iterative source-channel decoding scheme. Considering an example of a simple image transmission system we show that iterative decoding can be successfully employed for recovering the image data, especially when the channel is heavily corrupted.