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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Charles D. Lueck

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

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

Computer networks · 1

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.

Computer graphics and multimedia
1 paper
Audio and music processing · 67% Image and video coding · 33%

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

TopicWeightPapersLastEvidence papers
Image and video coding › quantization › vector quantization
codebook search		 0.011994
Complexity reduction of CELP speech coders through the use of phase information · IEEE Trans. Commun. 1994
Audio and music processing › speech coding
code-excited linear prediction		 0.011994
Complexity reduction of CELP speech coders through the use of phase information · IEEE Trans. Commun. 1994
Audio and music processing
speech coding		 0.011994
Complexity reduction of CELP speech coders through the use of phase information · IEEE Trans. Commun. 1994

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

phase spectrum analysis · 0.0codebook preselection · 0.0
YearPublicationVenuePosition
1994 Complexity reduction of CELP speech coders through the use of phase information
abstract
An efficient search procedure for CELP coders is described. Based on the phase spectra of the codevectors and the ideal excitation vector, a subset of the codebook is preselected. This subset is then exhaustively searched to find the best, perhaps optimum, codevector. Computational savings of the order of 30-40 are achieved while still maintaining good output speech quality.>
Tenkasi V. Ramabadran, Charles D. Lueck
 IEEE Trans. Commun.2