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

Charles R. Davis

dblp:134/5750 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1980
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 2Theory 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 · 91% Information theory · 9%

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

TopicWeightPapersLastEvidence papers
Coding theory › source coding › rate-distortion theory
rate-distortion bound
0.011975
On tree coding with a fidelity criterion · IEEE Trans. Inf. Theory 1975
Coding theory
source coding
0.011975
On tree coding with a fidelity criterion · IEEE Trans. Inf. Theory 1975
Coding theory › source coding
tree coding
0.011975
On tree coding with a fidelity criterion · IEEE Trans. Inf. Theory 1975
Information theory › probability theory
stochastic processes
0.011975
On tree coding with a fidelity criterion · IEEE Trans. Inf. Theory 1975

Methods — techniques the papers use, named apart from their topics

rate-distortion theory · 0.0branching process theory · 0.0
YearPublicationVenuePosition
1980 Improvements in the classical model for better speech quality
abstract
This paper presents improvements on the classical model which produces speech that is significantly better than currently available systems. The first major improvement results from treating speech as a two source phenomenon that can be separated for parallel but independent analysis/ synthesis. This two component decomposition is accomplished by making use of the quasi-periodic nature of 'voiced' speech. The second major improvement in bit compression and robustness of operation results from an efficient encoding of the prediction residuals of the two components. The key step is to encode the residual of the periodic component by picking out and transmitting the essential information for only one cycle (pitch period) of the residual.
Sidhartha Maitra, Charles R. Davis
ICASSP2
1980 A maximum peakiness criterion for deconvolving speech waveforms
abstract
Linear predictive coding of speech has traditionally used a least mean square (LMS) criterion for determining the optimal filter parameters. Auto-regressive (AR) models using LMS are in wide-spread use for low bit rate speech compression. These models are particularly susceptible to moderate amounts of added noise and distortion. This paper proposes a new model which does not use the least-mean-square criterion but rather uses the "peakiness" of the deconvolved waveform to determine the filter parameters. Since voiced output speech is reproduced with a maximally "peaked" waveform, viz, an impulse, this criterion is naturally suited for the characteristics of the synthesis process. Preliminary analysis also shows the feasability of implementing the proposed algorithm in microprocessor based hardware.
Sidhartha Maitra, Scott H. Foster, Charles R. Davis
ICASSP3
1975 On tree coding with a fidelity criterion
abstract
This paper reexamines Jelinek's proof that tree codes can be used to approach the rate-distortion bound. It is shown that the branching process used in Jelinek's proof is not a (strict-sense) branching process (SSBP) when the source is asymmetric. Branching processes with random environments (BPWRE) are introduced and used to extend the proof to general discrete-time memoryless sources. The theory developed indicates why a particular metric used in experiments performed better than another suggested by the original proof.
Charles R. Davis, Martin E. Hellman
IEEE Trans. Inf. Theory1