Bandwidth and Rate Allocation Tradeoffs of Source

Bandwidth and Rate Allocation Tradeoffs of Source

Author: Suayb S. Arslan

Publisher:

Published: 2012

Total Pages: 159

ISBN-13: 9781267259677

DOWNLOAD EBOOK

A conventional approach to the design of wireless multimedia communications is the layered approach, in which the network layers function independent of each other. This kind of layered approach is inspired partly by Shannon's separation theorem in which the optimization of each block is equivalent to optimization of the overall source-channel coding operation. However, the separation theorem is valid only in a point-to-point communication scenario in the case of asymptotically long block lengths of data and assumes huge amounts of processing power and delay. Therefore, current practical communication systems strive to jointly design building blocks of a multimedia system for better performance. The focus of this dissertation is therefore to present various joint designs for different channel models and systems, although limited by physical constraints such as bandwidth, power and complexity. First, a robust coded scheme for progressive multimedia transmission is considered for an additive white Gaussian noise channel, a Rayleigh fading channel, and a frequency selective channel using in combination different unequal protection methods. We investigate the judicious use of the limited bandwidth through the combination and optimization of a progressive source coder, a rate compatible punctured convolutional code and a hierarchical modulation. Next, we investigate a novel packet formatting scheme for progressive sources using interleavers and various channel codes. The source coder is combined with a concatenated block coding mechanism to produce a robust transmission system for embedded bit streams. The objective is to create embedded codewords such that, for a particular information block, the necessary protection is obtained via multiple channel codings, contrary to the conventional methods which use a single code rate per information block. We show that near capacity performance can be achieved using the proposed scheme in conjunction with low density parity check codes in a binary symmetric channel scenario. We initially focus on coding strategies for multimedia where the channel state information is missing. A generalized Digital Fountain (DF) code is proposed to provide efficient universal forward error correction solution for lossy packet networks with increased unequal error protection and unequal recovery time properties. We propose a progressive source transmission system using this generalized code design. We apply the generalized DF code to a progressive source and show that it has better unequal protection and recovery time properties than other published results.


Joint Source-Channel Decoding

Joint Source-Channel Decoding

Author: Pierre Duhamel

Publisher: Academic Press

Published: 2009-11-26

Total Pages: 337

ISBN-13: 0080922449

DOWNLOAD EBOOK

Treats joint source and channel decoding in an integrated way Gives a clear description of the problems in the field together with the mathematical tools for their solution Contains many detailed examples useful for practical applications of the theory to video broadcasting over mobile and wireless networks Traditionally, cross-layer and joint source-channel coding were seen as incompatible with classically structured networks but recent advances in theory changed this situation. Joint source-channel decoding is now seen as a viable alternative to separate decoding of source and channel codes, if the protocol layers are taken into account. A joint source/protocol/channel approach is thus addressed in this book: all levels of the protocol stack are considered, showing how the information in each layer influences the others. This book provides the tools to show how cross-layer and joint source-channel coding and decoding are now compatible with present-day mobile and wireless networks, with a particular application to the key area of video transmission to mobiles. Typical applications are broadcasting, or point-to-point delivery of multimedia contents, which are very timely in the context of the current development of mobile services such as audio (MPEG4 AAC) or video (H263, H264) transmission using recent wireless transmission standards (DVH-H, DVB-SH, WiMAX, LTE). This cross-disciplinary book is ideal for graduate students, researchers, and more generally professionals working either in signal processing for communications or in networking applications, interested in reliable multimedia transmission. This book is also of interest to people involved in cross-layer optimization of mobile networks. Its content may provide them with other points of view on their optimization problem, enlarging the set of tools which they could use. Pierre Duhamel is director of research at CNRS/ LSS and has previously held research positions at Thomson-CSF, CNET, and ENST, where he was head of the Signal and Image Processing Department. He has served as chairman of the DSP committee and associate Editor of the IEEE Transactions on Signal Processing and Signal Processing Letters, as well as acting as a co-chair at MMSP and ICASSP conferences. He was awarded the Grand Prix France Telecom by the French Science Academy in 2000. He is co-author of more than 80 papers in international journals, 250 conference proceedings, and 28 patents. Michel Kieffer is an assistant professor in signal processing for communications at the Université Paris-Sud and a researcher at the Laboratoire des Signaux et Systèmes, Gif-sur-Yvette, France. His research interests are in joint source-channel coding and decoding techniques for the reliable transmission of multimedia contents. He serves as associate editor of Signal Processing (Elsevier). He is co-author of more than 90 contributions to journals, conference proceedings, and book chapters. Treats joint source and channel decoding in an integrated way Gives a clear description of the problems in the field together with the mathematical tools for their solution Contains many detailed examples useful for practical applications of the theory to video broadcasting over mobile and wireless networks


Coding for Channels with Feedback

Coding for Channels with Feedback

Author: James M. Ooi

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 190

ISBN-13: 1461557194

DOWNLOAD EBOOK

Coding for Channels with Feedback presents both algorithms for feedback coding and performance analyses of these algorithms, including analyses of perhaps the most important performance criterion: computational complexity. The algorithms are developed within a single framework, termed the compressed-error-cancellation framework, where data are sent via a sequence of messages: the first message contains the original data; each subsequent message contains a source-coded description of the channel distortions introduced on the message preceding it. Coding for Channels with Feedback provides an easily understood and flexible framework for deriving low-complexity, practical solutions to a wide variety of feedback communication problems. It is shown that the compressed-error-cancellation framework leads to coding schemes with the lowest possible asymptotic order of growth of computations and can be applied to discrete memoryless channels, finite state channels, channels with memory, unknown channels, and multiple-access channels, all with complete noiseless feedback, as well as to channels with partial and noisy feedback. This framework leads to coding strategies that have linear complexity and are capacity achieving, and illustrates the intimate connection between source coding theory and channel coding theory. Coding for Channels with Feedback is an excellent reference for researchers and communication engineers in the field of information theory, and can be used for advanced courses on the topic.


Source-channel Coding for Robust Image Transmission and for Dirty-paper Coding

Source-channel Coding for Robust Image Transmission and for Dirty-paper Coding

Author: Yong Sun

Publisher:

Published: 2007

Total Pages:

ISBN-13:

DOWNLOAD EBOOK

In this dissertation, we studied two seemingly uncorrelated, but conceptually related problems in terms of source-channel coding: 1) wireless image transmissionand 2) Costa ("dirty-paper") code design. In the first part of the dissertation, we consider progressive image transmission over a wireless system employing space-time coded OFDM. The space-time coded OFDM system based on a newly built broadband MIMO fading model is theoretically evaluated by assuming perfect channel state information (CSI) at the receiver for coherent detection. Then an adaptive modulation scheme is proposed to pick theconstellation size that offers the best reconstructed image quality for each averagesignal-to-noise ratio (SNR).A more practical scenario is also considered without the assumption of perfect CSI. We employ low-complexity decision-feedback decoding for differentially space-time coded OFDM systems to exploit transmitter diversity. For JSCC, we adopt a product channel code structure that is proven to provide powerful error protection and bursty error correction. To further improve the system performance, we also apply the powerful iterative (turbo) coding techniques and propose the iterative decoding of differentially space-time coded multiple descriptions of images. The second part of the dissertation deals with practical dirty-paper code designs. We first invoke an information-theoretical interpretation of algebraic binning and motivate the code design guidelines in terms of source-channel coding. Then two dirty-paper code designs are proposed. The first is a nested turbo construction based on soft-output trellis-coded quantization (SOTCQ) for source coding and turbo trellis-coded modulation (TTCM) for channel coding. A novel procedure is devised to balance the dimensionalities of the equivalent lattice codes corresponding to SOTCQ and TTCM. The second dirty-paper code design employs TCQ and IRA codes fornear-capacity performance. This is done by synergistically combining TCQ with IRA codes so that they work together as well as they do individually. Our TCQ/IRA design approaches the dirty-paper capacity limit at the low rate regime (e.g., 1:0 bit/sample), while our nested SOTCQ/TTCM scheme provides the best performs so far at medium-to-high rates (e.g.,= 1:0 bit/sample). Thus the two proposed practical code designs are complementary to each other.


Joint Source-channel Coding Of Discrete-time Signals With Continuous Amplitudes

Joint Source-channel Coding Of Discrete-time Signals With Continuous Amplitudes

Author: Norbert Goertz

Publisher: World Scientific

Published: 2007-09-21

Total Pages: 207

ISBN-13: 1908979143

DOWNLOAD EBOOK

This book provides the first comprehensive and easy-to-read discussion of joint source-channel encoding and decoding for source signals with continuous amplitudes. It is a state-of-the-art presentation of this exciting, thriving field of research, making pioneering contributions to the new concept of source-adaptive modulation.The book starts with the basic theory and the motivation for a joint realization of source and channel coding. Specialized chapters deal with practically relevant scenarios such as iterative source-channel decoding and its optimization for a given encoder, and also improved encoder designs by channel-adaptive quantization or source-adaptive modulation.Although Information Theory is not the main topic of the book — in fact, the concept of joint source-channel coding is contradictory to the classical system design motivated by a questionable practical interpretation of the separation theorem — this theory still provides the ultimate performance limits for any practical system, whether it uses joint source-channel coding or not. Therefore, the theoretical limits are presented in a self-contained appendix, which is a useful reference also for those not directly interested in the main topic of this book./a


On Robust and Energy-limited Joint Source-channel Coding

On Robust and Energy-limited Joint Source-channel Coding

Author: Erman Koken

Publisher:

Published: 2017

Total Pages: 108

ISBN-13: 9780355472646

DOWNLOAD EBOOK

In this thesis we investigate the lossy transmission of single and bivariate Gaussian sources over bandwidth-mismatched additive Gaussian white noise and broadcast channels. For these scenarios we proposed novel hybrid digital/analog based joint source-channel coding schemes which generalize or outperform existing schemes. In the first scenario we assume that side information is available at the receiver, channel state information of additive interference is available at the transmitter, and power is limited. For this scenario we proposed hybrid digital/analog schemes, for both bandwidth expansion and bandwidth compression cases, which can attain the optimum reconstruction levels. For bandwidth expansion we showed that the scheme can attain optimum distortion levels for a set of receivers with different side information and channel qualities simultaneously with a single set of scheme parameters. In the second scenario, where no side information or interference are present, we consider the robustness of scheme where it must attain the optimal distortion at a target signal-to-noise-ratio and we would like to attain the best distortion pair for two possible receivers one with better and the other with worse channel quality. We extended Tian et al.'s result to a set of non-integer bandwidth expansion ratios. Then we investigate the transmission of bivariate sources over broadcast channels. For this scenario we proposed a scheme which outperforms the known schemes which are either purely digital or hybrid schemes. Finally we analyzed energy-distortion tradeoff for lossy transmission of a Gaussian source over bandwidth-unlimited channel. We performed asymptotical analyses as signal- to-noise-ratio goes to infinity. We also considered zero-delay transmission of the source.