Journal ArticleDOI
Joint source and noisy channel trellis encoding (Corresp.)
J. Dunham,Robert M. Gray +1 more
TLDR
A coding theorem is established for a trellis encoding of a stationary and ergodic source over a discrete memoryless noisy channel which shows that such communication systems can perform arbitrarily close to the source distortion-rate function evaluated at the channel capacity.Abstract:
In a trellis encoding communication system the decoder is a time-invariant nonlinear filter with finite memory (sliding-block code), and the encoder is a trellis search algorithm matched to the decoder. A coding theorem is established for a trellis encoding of a stationary and ergodic source over a discrete memoryless noisy channel which shows that such communication systems can perform arbitrarily close to the source distortion-rate function evaluated at the channel capacity.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
Deterministic annealing for clustering, compression, classification, regression, and related optimization problems
TL;DR: The deterministic annealing approach to clustering and its extensions has demonstrated substantial performance improvement over standard supervised and unsupervised learning methods in a variety of important applications including compression, estimation, pattern recognition and classification, and statistical regression.
Journal ArticleDOI
Pseudo-Gray coding
Kenneth Zeger,Allen Gersho +1 more
TL;DR: The binary switching algorithm is introduced, based on the objective of minimizing a useful upper bound on the average system distortion, which yields a significant reduction in average distortion, and converges in reasonable running times.
Book
Finite-state-vector quantization for waveform coding
TL;DR: Finite-state vector quantizers are designed and simulated for Gauss-Markov sources and sampled speech data, and the resulting performance and storage requirements are compared with ordinary memoryless vector quantization.
Journal ArticleDOI
The design of joint source and channel trellis waveform coders
Ender Ayanoglu,Robert M. Gray +1 more
TL;DR: The generalized Lloyd algorithm is applied to the design of joint source and channel trellis waveform coders to encode discrete-time continuous-amplitude stationary and ergodic sources operating over discrete memoryless noisy channels and it is observed that the jointly optimized codes achieve performance close to or better than that of separately optimized tandem codes of the same constraint length.
References
More filters
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
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
TL;DR: The general problem of estimating the a posteriori probabilities of the states and transitions of a Markov source observed through a discrete memoryless channel is considered and an optimal decoding algorithm is derived.
Journal ArticleDOI
Viterbi Decoding for Satellite and Space Communication
J. Heller,I. Jacobs +1 more
TL;DR: Convolutional coding and Viterbi decoding, along with binary phase-shift keyed modulation, is presented as an efficient system for reliable communication on power limited satellite and space channels.
Journal ArticleDOI
Instrumentable tree encoding of information sources (Corresp.)
F. Jelinek,J. Anderson +1 more
TL;DR: An easily instrumented scheme is proposed for use with binary sources and the Hamming distortion metric, using tree codes to encode time-discrete memoryless sources with respect to a fidelity criterion.