Joint Source-Channel Coding for Image Transmission over Underlay Multichannel Cognitive Radio Networks

The increasing prominence of wireless applications exacerbates the problem of radio spectrum scarcity and promotes the usage of Cognitive Radio (CR) in wireless networks. With underlay dynamic spectrum access, CRs can operate alongside Primary Users, the incumbent of a spectrum band, as long as they limit the interference to the Primary Users below a certain threshold. Multimedia streaming transmissions face stringent Quality of Services constraints on top of the CR interference constraints, as some packets in the data stream have higher levels of importance and are the most vulnerable to packet loss over the channel. This raises a need for Unequal Error Protection (ULP) for multimedia streams transmissions, in which the channel encoder assigns different amount of error correction to different parts of the data stream, thereby protecting more the most valuable parts of the stream from packet loss problems. This research presents an end-to-end system setup for image transmission, utilizing ULP as part of a Joint Source-Channel Coding scheme over a multichannel CR network operating through underlay dynamic spectrum access. The setup features a Set Partitioning in Hierarchical Trees (SPIHT) source encoder, and Reed-Solomon forward error correction channel coding, and uses their properties to devise an ULP framework that maximizes the quality of the received image

Cross-layer optimization of unequal protected layered video over hierarchical modulation

Abstract-unequal protection mechanisms have been proposed at several layers in order to improve the reliability of multimedia contents, especially for video data. The paper aims at implementing a multi-layer unequal protection scheme, which is based on a Physical-Transport-Application cross-layer design. Hierarchical modulation, in the physical layer, has been demonstrated to increase the overall user capacity of a wireless communications. On the other hand, unequal erasure protection codes at the transport layer turned out to be an efficient method to protect video data generated by the application layer by exploiting their intrinsic properties. In this paper, the two techniques are jointly optimized in order to enable recovering lost data in case the protection is performed separately. We show that the cross-layer design proposed herein outperforms the performance of hierarchical modulation and unequal erasure codes taken independently

Speeding up Future Video Distribution via Channel-Aware Caching-Aided Coded Multicast

Future Internet usage will be dominated by the consumption of a rich variety of online multimedia services accessed from an exponentially growing number of multimedia capable mobile devices. As such, future Internet designs will be challenged to provide solutions that can deliver bandwidth-intensive, delay-sensitive, on-demand video-based services over increasingly crowded, bandwidth-limited wireless access networks. One of the main reasons for the bandwidth stress facing wireless network operators is the difficulty to exploit the multicast nature of the wireless medium when wireless users or access points rarely experience the same channel conditions or access the same content at the same time. In this paper, we present and analyze a novel wireless video delivery paradigm based on the combined use of channel-aware caching and coded multicasting that allows simultaneously serving multiple cache-enabled receivers that may be requesting different content and experiencing different channel conditions. To this end, we reformulate the caching-aided coded multicast problem as a joint source-channel coding problem and design an achievable scheme that preserves the cache-enabled multiplicative throughput gains of the error-free scenario,by guaranteeing per-receiver rates unaffected by the presence of receivers with worse channel conditions.Comment: 11 pages,6 figures,to appear in IEEE JSAC Special Issue on Video Distribution over Future Interne

Polar Codes for Distributed Hierarchical Source Coding

We show that polar codes can be used to achieve the rate-distortion functions in the problem of hierarchical source coding also known as the successive refinement problem. We also analyze the distributed version of this problem, constructing a polar coding scheme that achieves the rate distortion functions for successive refinement with side information.Comment: 14 page

Network vector quantization

We present an algorithm for designing locally optimal vector quantizers for general networks. We discuss the algorithm's implementation and compare the performance of the resulting "network vector quantizers" to traditional vector quantizers (VQs) and to rate-distortion (R-D) bounds where available. While some special cases of network codes (e.g., multiresolution (MR) and multiple description (MD) codes) have been studied in the literature, we here present a unifying approach that both includes these existing solutions as special cases and provides solutions to previously unsolved examples