Joint source-channel coding and power adaptation for energy efficient wireless video communications

We consider efficiently transmitting video over a hybrid wireless/wire-line network by optimally allocating resources across multiple protocol layers. Specifically, we present a framework of joint source-channel coding and power adaptation, where error resilient source coding, channel coding, and transmission power adaptation are jointly designed to optimize video quality given constraints on the total transmission energy and delay for each video frame. In particular, we consider the combination of two types of channel coding—inter-packet coding (at the transport layer) to provide protection against packet dropping in the wire-line network and intra-packet coding (at the link layer) to provide protection against bit errors in the wireless link. In both cases, we allow the coding rate to be adaptive to provide unequal error protection at both the packet and frame level. In addition to both types of channel coding, we also compensate for channel errors by adapting the transmission power used to send each packet. An efficient algorithm based on Lagrangian relaxation and the method of alternating variables is proposed to solve the resulting optimization problem. Simulation results are shown to illustrate the advantages of joint optimization across multiple layers.     

Joint QoS control for video streaming over wireless multihop networks: A cross-layer approach

In this paper, we propose a novel cross-layer framework for jointly controlling and coding for multiple video streams in wireless multihop networks. At first, we develop a cross-layer flow control algorithm that works at the medium access control (MAC) layer to adjust each link's persistence probability and at the transport layer to adjust flow rates. This proposal is designed in a distributed manner that is amenable to online implementation for wireless networks, and then, a rate-distortion optimized joint source-channel coding (JSCC) approach for error-resilient scalable encoded video is presented, in which the video is encoded into multiple independent streams and each stream is assigned forward error correction (FEC) codes to avoid error propagation. Furthermore, we integrate the JSCC with the specific flow control algorithm, which optimally applies the appropriate channel coding rate given the constraints imposed by the transmission rate obtained from the proposed flow control algorithm and the prevailing channel condition. Simulation results demonstrate the merits and the need for joint quality of service (QoS) control in order to provide an efficient solution for video streaming over wireless multihop networks.     

A Scalable Information Security Technique: Joint Authentication-Coding Mechanism for Multimedia over Heterogeneous Wireless Networks

There have been increasing concerns about the security issues of wireless transmission of multimedia in recent years. Wireless networks, by their natures, are more vulnerable to external intrusions than wired ones. Therefore, many applications demand authenticating the integrity of multimedia content delivered wirelessly. In this work, we propose a framework for jointly authenticating and coding multimedia to be transmitted over heterogeneous wireless networks. We firstly provide a novel graph-based authentication scheme which can not only construct the authentication graph flexibly but also trade-off well among some practical requirements such as overhead, robustness and delay. And then, a rate-distortion optimized joint source-channel coding (JSCC) approach for error-resilient scalable encoded video is presented, in which the video is encoded into multiple independent streams and each stream is assigned forward error correction (FEC) codes to avoid error propagation. Furthermore, we consider integrating authentication with the specific JSCC scheme to achieve a satisfactory authentication results and end-to-end reconstruction quality by optimally applying the appropriate authentication and coding rate. Simulation results show the effectiveness of the proposed authentication-coding scheme for multimedia over wireless networks.     

Optimized error protection of scalable image bit streams [advances in joint source-channel coding for images]

This article focuses on FEC for scalable image coders. For various channel models, we survey recent progress made in system design and discuss efficient source-channel bit allocation techniques, with emphasis on unequal error protection. This article considered JSCC (joint source-channel coding) at the application layer only. Recent research has studied cross-layer optimization where JSCC is applied to both the application layer and the physical layer. The basic task here is to minimize the average distortion by allocating available power, subcarriers, and bandwidth among users at the physical layer and source-channel symbols at the application layer subject to a total resource constraint. Most of the JSCC systems covered in this article can be readily extended to transmit scalable compressed bit streams of video sequences and 3-D meshes. Due to the stringent delay constraints in video communications and the fact that MPEG is currently exploring a scalable video coding standard, fast JSCC algorithms are expected to play a bigger role and bring more performance gains. This article is also expected to stimulate further research efforts into JSCC and more importantly, prompt the industry to adopt some of these JSCC algorithms in their system designs, thus closing the cycle from algorithm development to implementation.     

Joint source-channel coding for wireless object-based video communications utilizing data hiding.

In recent years, joint source-channel coding for multimedia communications has gained increased popularity. However, very limited work has been conducted to address the problem of joint source-channel coding for object-based video. In this paper, we propose a data hiding scheme that improves the error resilience of object-based video by adaptively embedding the shape and motion information into the texture data. Within a rate-distortion theoretical framework, the source coding, channel coding, data embedding, and decoder error concealment are jointly optimized based on knowledge of the transmission channel conditions. Our goal is to achieve the best video quality as expressed by the minimum total expected distortion. The optimization problem is solved using Lagrangian relaxation and dynamic programming. The performance of the proposed scheme is tested using simulations of a Rayleigh-fading wireless channel, and the algorithm is implemented based on the MPEG-4 verification model. Experimental results indicate that the proposed hybrid source-channel coding scheme significantly outperforms methods without data hiding or unequal error protection.     

Distributed Joint Source-Channel Coding of Video Using Raptor Codes

Extending recent works on distributed source coding, this paper considers distributed source-channel coding and targets at the important application of scalable video transmission over wireless networks. The idea is to use a single channel code for both video compression (via Slepian-Wolf coding) and packet loss protection. First, we provide a theoretical code design framework for distributed joint source-channel coding over erasure channels and then apply it to the targeted video application. The resulting video coder is based on a cross-layer design where video compression and protection are performed jointly. We choose Raptor codes - the best approximation to a digital fountain - and address in detail both encoder and decoder designs. Using the received packets together with a correlated video available at the decoder as side information, we devise a new iterative soft-decision decoder for joint Raptor decoding. Simulation results show that, compared to one separate design using Slepian-Wolf compression plus erasure protection and another based on FGS coding plus erasure protection, the proposed joint design provides better video quality at the same number of transmitted packets. Our work represents the first in capitalizing the latest in distributed source coding and near-capacity channel coding for robust video transmission over erasure channels.     

Robust Packet Video Transport Over Wireless Fading Channels Using a Joint Source-channel Coding Approach

In this paper, we address the problem of robust video transmission over wireless networks. Specifically, we consider packet video transmission over wireless IP networks based on the RTP/UDP/IP protocol stack. Digital video delivered over wireless networks is expected to suffer quality degradation from both packet loss and bit errors in the payload. In this paper, both packet loss and bit errors in the payload are considered and the performance of a joint source-channel coding (JSCC) approach employing forward error-correction (FEC) coding schemes for H.263 +  video transmission is studied. Results indicate that with an appropriate JSCC approach, FEC-based error-control techniques can significantly improve the packetization efficiency for a given end-to-end quality requirement and lead to more acceptable video delivery quality over time-varying wireless networks. Another important observation is that with a JSCC approach the fading effects of wireless links upon end-to-end video quality are substantially decreased compared to a system without using channel coding, resulting in attractive robust performance characteristics.

Reliable transmission of high-quality video over ATM networks

The development of broadband networks has led to the possibility of a wide variety of new and improved service offerings. Packetized video is likely to be one of the most significant high-bandwidth users of such networks. The transmission of variable bit-rate (VBR) video offers the potential promise of constant video quality but is generally accompanied by packet loss which significantly diminishes this potential. We study a class of error recovery schemes employing forward error-control (FEC) coding to recover from such losses. In particular, we show that a hybrid error recovery strategy involving the use of active FEC in tandem with simple passive error concealment schemes offers very robust performance even under high packet losses. We discuss two different methods of applying FEC to alleviate the problem of packet loss. The conventional method of applying FEC generally allocates additional bandwidth for channel coding while maintaining a specified average video coding rate. Such an approach suffers performance degradations at high loads since the bandwidth expansion associated with the use of FEC creates additional congestion that negates the potential benefit in using FEC. In contrast, we study a more efficient FEC application technique in our hybrid approach, which allocates bandwidth for channel coding by throttling the source coder rate (i.e., performing higher compression) while maintaining a fixed overall transmission rate. More specifically, we consider the performance of the hybrid approach where the bandwidth to accommodate the FEC overhead is made available by throttling the source coder rate sufficiently so that the overall rate after application of FEC is identical to that of the original unprotected system. We obtain the operational rate-distortion characteristics of such a scheme employing selected FEC codes. In doing so, we demonstrate the robust performance achieved by appropriate use of FEC under moderate-to-high packet losses in comparison to the unprotected system.     

Progressive transmission of images over memoryless noisy channels

An embedded source code allows the decoder to reconstruct the source progressively from the prefixes of a single bit stream. It is desirable to design joint source-channel coding schemes which retain the capability of progressive reconstruction in the presence of channel noise or packet loss. Here, we address the problem of joint source-channel coding of images for progressive transmission over memoryless bit error or packet erasure channels. We develop a framework for encoding based on embedded source codes and embedded error correcting and error detecting channel codes. For a target transmission rate, we provide solutions and an algorithm for the design of optimal unequal error/erasure protection. Three performance measures are considered: the average distortion, the average peak signal-to-noise ratio, and the average useful source coding rate. Under the assumption of rate compatibility of the underlying channel codes, we provide necessary conditions for progressive transmission of joint source-channel codes. We also show that the unequal error/erasure protection policies that maximize the average useful source coding rate allow progressive transmission with optimal unequal protection at a number of intermediate rates     

Hybrid ARQ with Cross-Packet Channel Coding

We describe hybrid automatic repeat request/forward error correction (H-ARQ) with cross-packet channel coding which extends current H-ARQ schemes for point-to-point communications. In contrast to current H-ARQ schemes, the transmission of two consecutive packets of information bits is considered jointly. If a retransmission for the first packet is necessary, we encode the first and a second packet jointly. For fading channels, this allows diversity gain from retransmissions without decreasing the total code rate. We describe an encoder and a decoder which can be decoded iteratively for a system with H-ARQ with cross-packet channel coding     

Huffman code based error screening and channel code optimization for error concealment in perceptual audio coding (PAC) algorithms

The class of perceptual audio coding (PAC) algorithms yields efficient and high-quality stereo digital audio bitstreams at bit rates from 16 kb/sec to 128 kb/sec (and higher). To avoid "pops and clicks" in the decoded audio signals, channel error detection combined with source error concealment, or source error mitigation, techniques are preferred to pure channel error correction. One method of channel error detection is to use a high-rate block code, for example, a cyclic redundancy check (CRC) code. Several joint source-channel coding issues arise in this framework because PAC contains a fixed-to-variable source coding component in the form of Huffman codes, so that the output audio packets are of varying length. We explore two such issues. First, we develop methods for screening for undetected channel errors in the audio decoder by looking for inconsistencies between the number of bits decoded by the Huffman decoder and the number of bits in the packet as specified by control information in the bitstream. We evaluate this scheme by means of simulations of Bernoulli sources and real audio data encoded by PAC. Considerable reduction in undetected errors is obtained. Second, we consider several configurations for the channel error detection codes, in particular CRC codes. The preferred set of formats employs variable-block length, variable-rate outer codes matched to the individual audio packets, with one or more codewords used per audio packet. To maintain a constant bit rate into the channel, PAC and CRC encoding must be performed jointly, e.g., by incorporating the CRC into the bit allocation loop in the audio coder.     

无线视频的一种码率控制方法

无线信道的高误码率对视频图像质量有很大的影响,前向纠错(FEC)和自动重发请求(ARQ)对于降低无线信道的误码率,提高图像质量有很好的效果。通过对FEC和ARQ方法的有效性分析,在TMN8的基础上提出一种简单的混合FEC/ARQ自适应模式选择码率控制方法。该方法首先预测报文丢失数量和纠错报文传输时延,从而选择合适的纠错编码模式,并为纠错编码分配比特数。实验结果表明该方法有效降低无线信道下报文丢失率,显著提高了图像质量。     

Joint Source-Channel Distortion Modeling for MPEG-4 Video

Multimedia communication has become one of the main applications in commercial wireless systems. Multimedia sources, mainly consisting of digital images and videos, have high bandwidth requirements. Since bandwidth is a valuable resource, it is important that its use should be optimized for image and video communication. Therefore, interest in developing new joint source-channel coding (JSCC) methods for image and video communication is increasing. Design of any JSCC scheme requires an estimate of the distortion at different source coding rates and under different channel conditions. The common approach to obtain this estimate is via simulations or operational rate-distortion curves. These approaches, however, are computationally intensive and, hence, not feasible for real-time coding and transmission applications. A more feasible approach to estimate distortion is to develop models that predict distortion at different source coding rates and under different channel conditions. Based on this idea, we present a distortion model for estimating the distortion due to quantization and channel errors in MPEG-4 compressed video streams at different source coding rates and channel bit error rates. This model takes into account important aspects of video compression such as transform coding, motion compensation, and variable length coding. Results show that our model estimates distortion within 1.5 dB of actual simulation values in terms of peak-signal-to-noise ratio.      

Performance of truncated type-II hybrid ARQ schemes with noisyfeedback over block fading channels

This paper considers truncated type-II hybrid automatic repeat-request (ARQ) schemes with noisy feedback over block fading channels. With these ARQ techniques, the number of retransmissions is limited, and, similar to forward error correction (FEC), error-free delivery of data packets cannot be guaranteed. Bounds on the average number of transmissions, the average coding rate as well as the reliability of the schemes are derived using random coding techniques, and the performance is compared with FEC. The random coding bounds reveal the achievable performance with block codes and maximum-likelihood soft-decision decoding. Union upper bounds and simulation results show that over block fading channels, these bounds can be closely approached with simple terminated convolutional codes and soft-decision Viterbi decoding. Truncated type-II hybrid ARQ and the corresponding FEC schemes have the same probability of packet erasure; however, the truncated ARQ schemes offer a trade-off between the average coding rate and the probability of undetected error. Truncated ARQ schemes have significantly higher average coding rates than FEC at high and medium signal-to-noise ratio even with noisy feedback. Truncated ARQ can be viewed as adaptive FEC that adapts to the instantaneous channel conditions     

A joint source and channel coding algorithm for error-resilient SPIHT-coded video bitstreams

We propose an analytical rate-distortion optimized joint source and channel coding algorithm for error-resilient scalable encoded video for lossy transmission. A video is encoded into multiple independent substreams to avoid error propagation and is assigned forward error correction (FEC) codes and source bits using Lagrange optimization. Our method separates video coding and packetization into different tiers which can be easily incorporated into any coding structure that generates a set of independent compressed bit-streams. To demonstrate the performance, we use the 2-state Markov model to describe the burst loss channel and Reed-Solomon codes as forward error correction codes. Simulation results show that the proposed channel incorporated rate-distortion optimization approach have better performance.     

Packet-by-Packet Adaptive Scheme for Video Coding and Transmission Over Wireless IP Networks Using Rate-Compatible Punctured Turbo (RCPT) Codes

In this paper, we consider real-time video coding and transmission over packet-switched wireless IP networks, such as WLAN, using RCPT codes and joint source-channel coding (JSCC) with concentration on a packet-by-packet adaptive scheme. We present a systematic design methodology to enable the applicability of JSCC techniques. The performance of H.263+ video coding and transmission over wireless channel modeled as slow Rician fading channels using this approach is studied. Results indicate that a packet-by-packet adaptive RCPT-JSCC approach is of significant advantage for real-time video applications and leads to more acceptable video delivery quality over interference-limited and time-varying wireless networks.     

Toward a unified framework for modeling and analysis of diversity in joint source-channel coding

The study of joint source-channel coding (JSCC) systems faces one major challenge in obtaining an analytical expression for the function that links end-to-end distortion with channel signal-to-noise ratio, the D-SNR curve. In this paper, for certain multimedia systems using practical source and channel codes in a JSCC bit rate allocation design, the D-SNR curve is shown to be well approximated by a set of carefully selected points where the relative contribution of channel errors to end-to-end distortion is small. This approach has the potential advantage that it could be applied to represent performance of many practical systems using JSCC bit rate allocation for which it is shown that the D-SNR function is approximately linear in log-log scales. A unified framework for the modeling, analysis and performance measurement of these systems is proposed by considering a view of diversity more general than its usual interpretation. This view extends that of diversity to include redundant information so coding and diversity gain are still used to characterize performance. Furthermore, the proposed approach is applied to study issues arising from using practical source and channel codes, including the effects on performance of channel codes of different strength or source codes with different compression efficiency.     

On the joint source-channel coding error exponent for discrete memoryless systems

We investigate the computation of Csisza/spl acute/r's bounds for the joint source-channel coding (JSCC) error exponent E/sub J/ of a communication system consisting of a discrete memoryless source and a discrete memoryless channel. We provide equivalent expressions for these bounds and derive explicit formulas for the rates where the bounds are attained. These equivalent representations can be readily computed for arbitrary source-channel pairs via Arimoto's algorithm. When the channel's distribution satisfies a symmetry property, the bounds admit closed-form parametric expressions. We then use our results to provide a systematic comparison between the JSCC error exponent E/sub J/ and the tandem coding error exponent E/sub T/, which applies if the source and channel are separately coded. It is shown that E/sub T//spl les/E/sub J//spl les/2E/sub T/. We establish conditions for which E/sub J/>E/sub T/ and for which E/sub J/=2E/sub T/. Numerical examples indicate that E/sub J/ is close to 2E/sub T/ for many source-channel pairs. This gain translates into a power saving larger than 2 dB for a binary source transmitted over additive white Gaussian noise (AWGN) channels and Rayleigh-fading channels with finite output quantization. Finally, we study the computation of the lossy JSCC error exponent under the Hamming distortion measure.     

Unequal error protection for MPEG-2 video transmission over wireless channels

This paper proposes an unequal error protection (UEP) method for MPEG-2 video transmission. Since the source and channel coders are normally concatenated, if the channel is noisy, more bits are allocated to channel coding and fewer to source coding. The situation is reversed when the channel conditions are more benign. Most of the joint source channel coding (JSCC) methods assume that the video source is subband coded, the bit error sensitivity of the source code can be modeled, and the bit allocations for different subband channels will be calculated. The UEP applied to different subbands is the rate compatible punctured convolution channel coder. However, the MPEG-2 coding is not a subband coding, the bit error sensitivity function for the coded video can no longer be applied. Here, we develop a different method to find the rate-distortion functions for JSCC of the MPEG-2 video. In the experiments, we show that the end-to-end distortion of our UEP method is smaller than the equal error protection method for the same total bit-rate.