Journal ArticleDOI
Trellis Encoding of memoryless discrete-time sources with a fidelity criterion
Andrew J. Viterbi,J. Omura +1 more
Reads0
Chats0
TLDR
A bound on the average per-letter distortion achievable by a trellis source code of fixed constraint length is derived for any fixed code rate greater than R(D) , and this bound decreases toward D^{\ast} exponentially with constraint length.Abstract:
For memoryless discrete-time sources and bounded single-letter distortion measures, we derive a bound on the average per-letter distortion achievable by a trellis source code of fixed constraint length. For any fixed code rate greater than R(D^{\ast}) , the rate-distortion function at D^{\ast} , this bound decreases toward D^{\ast} exponentially with constraint length.read more
Citations
More filters
Journal ArticleDOI
Quantization
Robert M. Gray,David L. Neuhoff +1 more
TL;DR: The key to a successful quantization is the selection of an error criterion – such as entropy and signal-to-noise ratio – and the development of optimal quantizers for this criterion.
Journal ArticleDOI
Vector quantization in speech coding
John Makhoul,S. Roucos,H. Gish +2 more
TL;DR: This tutorial review presents the basic concepts employed in vector quantization and gives a realistic assessment of its benefits and costs when compared to scalar quantization, and focuses primarily on the coding of speech signals and parameters.
Journal ArticleDOI
Minimizing Additive Distortion in Steganography Using Syndrome-Trellis Codes
TL;DR: This paper proposes a complete practical methodology for minimizing additive distortion in steganography with general (nonbinary) embedding operation and reports extensive experimental results for a large set of relative payloads and for different distortion profiles, including the wet paper channel.
Journal ArticleDOI
Trellis coded quantization of memoryless and Gauss-Markov sources
TL;DR: The authors adopt the notions of signal set expansion, set partitioning, and branch labeling of TCM, but modify the techniques to account for the source distribution, to design TCQ coders of low complexity with excellent mean-squared-error (MSE) performance.
Journal ArticleDOI
Speech coding: a tutorial review
TL;DR: The objective of this paper is to provide a tutorial overview of speech coding methodologies with emphasis on those algorithms that are part of the recent low-rate standards for cellular communications.
References
More filters
Journal ArticleDOI
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
TL;DR: The upper bound is obtained for a specific probabilistic nonsequential decoding algorithm which is shown to be asymptotically optimum for rates above R_{0} and whose performance bears certain similarities to that of sequential decoding algorithms.
Journal ArticleDOI
The viterbi algorithm
TL;DR: This paper gives a tutorial exposition of the Viterbi algorithm and of how it is implemented and analyzed, and increasing use of the algorithm in a widening variety of areas is foreseen.
Journal ArticleDOI
Convolutional Codes and Their Performance in Communication Systems
TL;DR: This tutorial paper begins with an elementary presentation of the fundamental properties and structure of convolutional codes and proceeds with the development of the maximum likelihood decoder, which yields for arbitrary codes both the distance properties and upper bounds on the bit error probability.
Journal ArticleDOI
A simple derivation of the coding theorem and some applications
TL;DR: Both amplitude-discrete and amplitude-continuous channels are treated, both with and without input constraints, and the exponential behavior of the bounds with block length is the best known for all transmission rates between 0 and capacity.
Journal ArticleDOI
Tree encoding of memoryless time-discrete sources with a fidelity criterion
TL;DR: It is shown that for memoryless time-discrete sources with a bounded fidelity criterion, the limiting average distortion achievable by tree codes of rate R is D, the solution of the equation R = R(D) , where R( ) denotes the usual rate distortion function.