联合编码模式选择的码率控制算法

本文提出了一种丢包网络中联合信源信道码率控制算法.该算法克服了以往码率控制方法和误码复原技术互不关联的弊病,在统计率失真模型的基础上,联合最优地计算图像级量化参数和寻找最佳宏块编码模式,在给定的受限码率下能充分利用可用信道带宽,使得视频信源编码和信道传输总失真最小.实验结果表明该算法能够获得比传统算法更高的性能增益.     

基于反馈的自适应参考帧选择的率失真优化分析

为了提高数字视频实时传输的容差能力,该文提出了一种基于反馈的自适应参考帧选择方法。在传统参考帧选择优点的基础上,设计了一种新的通过率失真技术优化选择参考帧的帧间帧预测结构,分析了选择不同参考帧编码时的编码码率以及它对编码失真的影响。引入了信道代价均值的概念,探讨了信道误差的扩散过程及其对信道失真的影响。在联合信源和信道的率失真优化框架内,选择使得率失真代价最小的候选参考帧作为当前帧编码的参考帧,有效地改善了视频传输质量,并减少了编/解码器所需缓存的参考帧。仿真实验显示自适应参考帧选择的PSNR性能在不同码率和丢包率下均优于经典的ACK和NACK参考帧选择方法。     

图像分层编码技术的分析与设计

无线移动通信信道是时变信道,特性复杂、恶劣,严重影响数字图像信号传输的可靠性。图像分层编码是一种很灵活的编码方式,减轻了因环境变化出现的接收图像质量的剧烈变化,使得图像传输具有良好的鲁棒性和带宽的自适应性,可以有效地解决带宽受限时的图像传输问题。主要介绍了分层编码层数选取、基本层和增强层的码率分配问题,分析了影响这些问题的主要因素,并提出一种基于码率失真理论的增强层码率分配方法。     

基于H.264率失真模型的无线信源信道联合编码方案

针对H.264编码器的率失真特性,建立了一种新的H.264编码率失真(R-D,rate-distortion)模型:然后基于该R-D模型和Turbo码的抗差错特性,对无线环境下的端到端视频传输失真进行了深入的分析,提出了一种无线信道下的自适应视频信源信道联合编码(JSCC,joint source channel coding)方案,该方案可以自适应地根据当前无线信道的具体状况,将网络可用带宽在信道编码和信源编码之间进行最优的分配,使得端到端的传输失真达到最小.实验结果表明,与固定选择信道编码速率方案相比,该方案可以显著提高传输的可靠性,在接收端可以获得更好的视频重建质量.     

视频传输中的码率控制技术

码率控制是视频通信系统中的一个天键环节，主要用于调摔编码视频的输出质量。设计码率摔制系统时一般需要涉及目标码率计算、信源与信道模型建立、视频编码方法、率失真估计、码率分配、跳帧、实时性、传输环境和系统性能评估等诸多方面。新出现的网络视频流媒体传输、无线信道传输、MPEG-4的对象编码传输、信噪比精细可分级编码传输等实际应用要求鲁棒高效的码率控制算法来满足视频实时传输的需要。相应的码率摔制算法已成为近几年的研究热点。本文给出了视频码率控制技术的系统框架和基本要求，介绍了现有的各种恒定码率(CBR)与可变码率(VBR)摔制算法，综合比较了各自的优缺点，概括论述了视频码率控制技术的发展现状，并给出了下一步的研究方向。     

基于多描述和不等差错保护的航空遥感图像传输方法

 本文提出了一种针对航空遥感图像传输的信源信道联合编码方法.将小波变换后的图像进行小波树分组以形成多描述,并重复描述重要的低频子带系数;然后利用改进的多级树集合分裂(SPIHT)算法对每个描述单独编码,并为其提供不等差错保护.为保证编码实时性,提出了一种快速的码率分配搜索算法.仿真结果表明该方法在频率选择性莱斯衰落信道下实现了遥感图像的鲁棒传输,且具有较低的复杂度.     

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

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

序列图像的多码率混合编码及其性能分析

本文针对序列图像提出了一种可称为MRHC的多码率编码方法。该方法把信源和信道编码组成一个整体,利用3D小波图像能量分布的特点,在完成压缩编解码的同时完成纠错编解码。从而达到码率优化分配,提高了序列图像在噪声信道中的传输的质量。     

一种抗误码能力强的无线信道图像传输方案

本文提出一种新的综合源编码和信道编码的无线信道图像传输方案，对子波变换后各个子带采用基于统计特性的变系数定长（VCFL）编码，数据经过Reed-Solomon编码后选择不同码率的码率兼容删除卷积码（RCPC）编码以提供不同程度的差错保护（UEP），最后数据经交织后传输。在给定传输的总比特数的情况下，通过优化算法使总体失真最小。模拟结果表明新方案在无线衰落信道上表现出良好的性能。     

无线视频传输中的信源信道联合编码的研究

文章在研究信源信道联合编码方法的基础上,介绍了信源信道联合编码的产生背景、研究意义、应用环境,指出了信源信道联合编码在通信系统中的实际应用。结合编码码流的自身特点,给出了一种以图片组为单位的码流重要性模型,并根据此模型使用不同码率的Turbo码对H.264编码码流进行不等差错保护。     

On source coding, channel coding and spreading tradeoffs in a DS-CDMA system operating over frequency selective fading channels with narrowband interference

For a fixed total bandwidth expansion factor, we consider the problem of optimal bandwidth allocation among the source coder, the channel coder, and the spread-spectrum unit for a direct-sequence code-division multiple-access system operating over a frequency-selective fading channel with narrowband interference. Assuming a Gaussian source with the optimum scalar quantizer, and a binary convolutional code with soft-decision decoding, and further assuming that the self-interference is negligible, we obtain both a lower and an upper bound on the end-to-end average source distortion. The joint three-way constrained optimization of the source code rate, the channel code rate, and the spreading factor can be simplified into an unconstrained optimization problem over two variables. Upon fixing the channel code rate, we show that both upper and lower bound-based distortion functions are convex functions of the source code rate. Because an explicit solution for the optimum source code rate, i.e., one that minimizes the average distortion, is difficult to obtain, computer-based search techniques are employed. Numerical results are presented for the optimum source code rate and spreading factor, parameterized by the channel code rate and code constraint length. The optimal bandwidth allocation, in general, depends on the system and the channel conditions, such as the total number of active users, the average jammer-to-signal power ratio, and the number of resolved multipath components together with their power delay profile.     

Tradeoff between source and channel coding

A fundamental problem in the transmission of analog information across a noisy discrete channel is the choice of channel code rate that optimally allocates the available transmission rate between lossy source coding and block channel coding. We establish tight bounds on the channel code rate that minimizes the average distortion of a vector quantizer cascaded with a channel coder and a binary-symmetric channel. Analytic expressions are derived in two cases of interest: small bit-error probability and arbitrary source vector dimension; arbitrary bit-error probability and large source vector dimension. We demonstrate that the optimal channel code rate is often substantially smaller than the channel capacity, and obtain a noisy-channel version of the Zador (1982) high-resolution distortion formula     

Joint source/channel coding for multiple images

A joint source/channel coding algorithm is proposed for the transmission of multiple image sources over memoryless channels. The proposed algorithm uses a quality scalable image coder to optimally allocate a limited bit budget among all the sources to achieve the optimal overall distortion reduction for the multiple reconstructed images. In addition to the conventional un gain, it provides channel multiplexing gain, which can be much more significant. Furthermore, an extended scheme is proposed to provide flexibility between the optimization performance and complexity.     

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.     

Image coding with robust channel-optimized trellis-codedquantization

This paper presents a wavelet-based image coder that is optimized for transmission over the binary symmetric channel (BSC). The proposed coder uses a robust channel-optimized trellis-coded quantization (COTCQ) stage that is designed to optimize the image coding based on the channel characteristics. A phase scrambling stage is also used to further increase the coding performance and robustness to nonstationary signals and channels. The resilience to channel errors is obtained by optimizing the coder performance only at the level of the source encoder with no explicit channel coding for error protection. For the considered TCQ trellis structure, a general expression is derived for the transition probability matrix. In terms of the TCQ encoding rat and the channel bit error rate, and is used to design the COTCQ stage of the image coder. The robust nature of the coder also increases the security level of the encoded bit stream and provides a much more visually pleasing rendition of the decoded image. Examples are presented to illustrate the performance of the proposed robust image coder     

Tradeoff between source and channel coding on a Gaussian channel

Consider a system that quantizes and encodes analog data for transmission across an additive noise Gaussian channel. To minimize distortion, the channel code rate must be chosen to optimally allocate the available transmission rate between lossy source coding and block channel coding. We establish tight upper and lower bounds on the channel code rate that minimizes the average distortion of a vector quantizer cascaded with a channel coder and a Gaussian channel, thus extending some recently obtained results for the binary-symmetric channel. The upper hounds are obtained by averaging, whereas the lower bounds are uniform, over all possible index assignments. Analytic expressions are derived for large and small signal-to-noise ratios, and also for large source vector dimension. As in the binary-symmetric channel, the optimal channel code rate is often substantially smaller than the channel capacity and the distortion decays exponentially with the number of channel uses. Exact exponents are derived     

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.     

Two-stage bit allocation algorithm for stereo audio coder

A new bit allocation algorithm is proposed and applied in a stereo transform coder. This algorithm is a two-stage approach based on the minimisation of perceptual distortion measured by artificial ears. At the first stage, the use of minimum frequency-weighted reconstruction error is exploited, in which the weighting factors are related to the masking threshold and the absolute hearing threshold. The bit assignment obtained at the first stage is fine tuned by a greedy algorithm of perceptual distortion versus bit rate at the second stage. A joint stereo perceptual transform coder is implemented and incorporated with this two-stage bit allocation algorithm. The listening tests show that this coder performs better than MPEG layer 2 at bit rates below 128 kbps and has the comparative quality of MPEC layer 2 at higher bit rates     

Robust hyperspectral image coding with channel-optimizedtrellis-coded quantization

This paper presents a wavelet-based hyperspectral image coder that is optimized for transmission over the binary symmetric channel (BSC). The proposed coder uses a robust channel-optimized trellis-coded quantization (COTCQ) stage that is designed to optimize the image coding based on the channel characteristics. This optimization is performed only at the level of the source encoder and does not include any channel coding for error protection. The robust nature of the coder increases the security level of the encoded bit stream, and provides a much higher quality decoded image. In the absence of channel noise, the proposed coder is shown to achieve a compression ratio greater than 70:1, with an average peak SNR of the coded hyperspectral sequence exceeding 40 dB. Additionally, the coder is shown to exhibit graceful degradation with increasing channel errors