Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

J. Foster

dblp:41/234 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1985
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%
Computer graphics and multimedia
1 paper
Audio and music processing · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › source coding › quantization › vector quantization
finite-state vector quantization
0.011985
Finite-state vector quantization for waveform coding · IEEE Trans. Inf. Theory 1985
Coding theory
source coding
0.011985
Finite-state vector quantization for waveform coding · IEEE Trans. Inf. Theory 1985
Coding theory › source coding › quantization
vector quantization
0.011985
Finite-state vector quantization for waveform coding · IEEE Trans. Inf. Theory 1985
Audio and music processing
speech coding
0.011985
Finite-state vector quantization for waveform coding · IEEE Trans. Inf. Theory 1985
YearPublicationVenuePosition
1985 Finite-state vector quantization for waveform coding
abstract
A finite-state vector quantizer is a finite-state machine used for data compression: Each successive source vector is encoded into a codeword using a minimum distortion rule, and into a code book, depending on the encoder state. The current state and the selected codeword then determine the next encoder state. A finite-state vector quantizer is capable of making better use of the memory in a source than is an ordinary memoryless vector quantizer of the same dimension or blocklength. Design techniques are introduced for finite-state vector quantizers that combine ad hoc algorithms with an algorithm for the design of memoryless vector quantizers. 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.
J. Foster, Robert M. Gray, Mari O. Dunham
IEEE Trans. Inf. Theory1