This paper proposes a new adaptive source-channel coding scheme in the context of subband coding. We rst express the total mean-squared distortion su ered by the source in terms of source and channel distortions of the subbands. We then minimize this total distortion by an appropriate choice of source and channel coding rates for the subbands. This corresponds to casting the conventional bit al...

I. Kontoyiannis Appeared in IEEE Trans. Inform. Theory, 43, pp. 1339 1341, July 1997. Abstract { Shannon's celebrated source coding theorem can be viewed as a \one-sided law of large numbers." We formulate second-order noiseless source coding theorems for the deviation of the codeword lengths from the entropy. For a class of sources that includes Markov chains we prove a \one-sided central limi...

A new approach to joint source–channel coding is presented in the context of communicating correlated sources over multiple access channels. Similar to the separation architecture, the joint source– channel coding system architecture in this approach is modular, whereby the source encoding and channel decoding operations are decoupled. However, unlike the separation architecture, the same codew...

Distributed source coding, the separate encoding and joint decoding of statistically dependent sources, has many potential applications ranging from lower complexity capsule endoscopy to higher throughput satellite imaging. This dissertation improves distributed source coding algorithms and the analysis of their coding performance to handle uncertainty in the statistical dependence among source...

9.1 Motivation: Quantization of Random Variables . . . . . . . . . . . . . . . . . . . . . 1 9.2 Lossy Source Coding Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 9.3 The Rate Distortion Coding Theorem . . . . . . . . . . . . . . . . . . . . . . . . . . 4 9.3.1 Example: Binary Source . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 9.3.2 Example: Gaussian ...

This paper deals with a universal coding problem for a certain kind of multiterminal source coding system that we call the complementary delivery coding system. Both fixed-to-fixed length and fixed-to-variable length lossless coding schemes are considered. Explicit constructions of universal codes and bounds of the error probabilities are clarified via type-theoretical and graph-theoretical ana...

2 ⌋ }. The i-th reconstruction is of the form X̂i(T, Y ), i.e., it is allowed to depend on the side information, but only causally. The motivation for studying this problem comes from source coding systems that are constrained to operate with no, or with limited, delay. Sequential source codes with a limited-delay encoder and a sequential, zero-delay, decoder with access to side information comp...

Here we write in a unified fashion (using “R(P,Q,D)” [1]) the random coding exponents in channel coding and lossy source coding. We derive their explicit forms and show, that, for a given random codebook distribution Q, the channel decoding error exponent can be viewed as an encoding success exponent in lossy source coding, and the channel correct-decoding exponent can be viewed as an encoding ...

The compression or coding of a signal (e.g., speech, text, image, video) has been a topic of great interest for a number of years. Numerous results and successful compression standards exist. Source compression is the enabling technology behind the multimedia revolution we are experiencing. The two primary applications for data compressing are storage and transmission. Video transmission is the...

Waveform coding of audio signals at low bit rates generally results in coding errors. In high-quality applications these must remain inaudible. The bit rate required to code audio signals without audible errors depends on both the signal's power spectral density function and masking properties of the human ear. It is shown how rate distortion theory and psy-choacoustic models of hearing can be ...