Author: Publisher:
ISBN:
Category :
Languages : en
Pages :
Book Description
Unified Structural View of Multiterminal Source Coding
Author: Unified Structural View of Multiternal Source Coding
Author: Soumya JanaMultiterminal Source Coding
Author: Sui-yin TungPublisher:
ISBN:
Category : Coding theory
Languages : en
Pages : 212
Book Description
Some Results on Multiterminal Source Coding
Author: Raymond Wai Ho YeungPublisher:
ISBN:
Category : Coding theory
Languages : en
Pages : 160
Book Description
Rate-distortion Regions for Successively Structured Multiterminal Source Coding Schemes
Author: Hamid BehrooziHelper-assisted Lossy Multiterminal Source Coding
Author: Network-aware Source Coding and Communication
Author: Nima SarsharPublisher: Cambridge University Press
ISBN: 1139504568
Category : Technology & Engineering
Languages : en
Pages : 189
Book Description
An introduction to the theory and techniques for achieving high quality network communication with the best possible bandwidth economy, this book focuses on network information flow with fidelity. Covering both lossless and lossy source reconstruction, it is illustrated throughout with real-world applications, including sensor networks and multimedia communications. Practical algorithms are presented, developing novel techniques for tackling design problems in joint network-source coding via collaborative multiple description coding, progressive coding, diversity routing and network coding. With systematic introductions to the basic theories of distributed source coding, network coding and multiple description coding, this is an ideal self-contained resource for researchers and students in information theory and network theory.
Dissertation Abstracts International
Author: Publisher:
ISBN:
Category : Dissertations, Academic
Languages : en
Pages : 854
Book Description
Multiterminal Source Coding
Author: Yang YangPublisher:
ISBN:
Category :
Languages : en
Pages :
Book Description
Driven by a host of emerging applications (e.g., sensor networks and wireless video), distributed source coding (i.e., Slepian-Wolf coding, Wyner-Ziv coding and various other forms of multiterminal source coding), has recently become a very active research area. This dissertation focuses on multiterminal (MT) source coding problem, and consists of three parts. The first part studies the sum-rate loss of an important special case of quadratic Gaussian multi-terminal source coding, where all sources are positively symmetric and all target distortions are equal. We first give the minimum sum-rate for joint encoding of Gaussian sources in the symmetric case, and then show that the supremum of the sum-rate loss due to distributed encoding in this case is 1 2 log2 5 4 = 0:161 b/s when L = 2 and increases in the order of o. L 2 log2 e b/s as the number of terminals L goes to infinity. The supremum sum-rate loss of 0:161 b/s in the symmetric case equals to that in general quadratic Gaussian two-terminal source coding without the symmetric assumption. It is conjectured that this equality holds for any number of terminals. In the second part, we present two practical MT coding schemes under the framework of Slepian-Wolf coded quantization (SWCQ) for both direct and indirect MT problems. The first, asymmetric SWCQ scheme relies on quantization and Wyner-Ziv coding, and it is implemented via source splitting to achieve any point on the sum-rate bound. In the second, conceptually simpler scheme, symmetric SWCQ, the two quantized sources are compressed using symmetric Slepian-Wolf coding via a channel code partitioning technique that is capable of achieving any point on the Slepian-Wolf sum-rate bound. Our practical designs employ trellis-coded quantization and turbo/LDPC codes for both asymmetric and symmetric Slepian-Wolf coding. Simulation results show a gap of only 0.139-0.194 bit per sample away from the sum-rate bound for both direct and indirect MT coding problems. The third part applies the above two MT coding schemes to two practical sources, i.e., stereo video sequences to save the sum rate over independent coding of both sequences. Experiments with both schemes on stereo video sequences using H.264, LDPC codes for Slepian-Wolf coding of the motion vectors, and scalar quantization in conjunction with LDPC codes for Wyner-Ziv coding of the residual coefficients give slightly smaller sum rate than separate H.264 coding of both sequences at the same video quality.
Multi-terminal Secrecy and Source Coding
Author: Yeow Khiang ChiaPublisher:
ISBN:
Category :
Languages : en
Pages :
Book Description
Network Information Theory is a branch of Information Theory that aims to address the fundamental limits of communications in a multiple user setting and when several sources of information are available. While a complete theory is still lacking, tools and techniques developed to address research problems in Network Information Theory have started to make an impact on other fields. In this thesis, we present results in two sub-areas in Network Information Theory. The first area, Information-Theoretic Secrecy, involves an application of Network Information Theory techniques to a secret communication setting, where a message is to be kept hidden from an eavesdropper. We consider two generalizations of the classical wiretap channel, where a sender wishes to communicate to a receiver over a noisy broadcast channel in the presence of an eavesdropper. The first generalization considers the setting where we have more than one receiver or more than one eavesdropper. The second setting considers the case where the transmission occurs over a broadcast channel with state - a channel model that can serve a base model for communicating over fast fading channels found in wireless communications. In the second part of this thesis, we turn our attention to the area of multi-terminal source coding. In particular, we investigate the Cascade Source Coding problem where a source node has a source sequence that it wishes to send to an intermediate node over a rate limited link, and also to an end node that the intermediate node can communicate with over a rate limited link. We investigate the optimum coding schemes under different assumptions on the side information available at the nodes, or operational restrictions on the reconstruction process.