MétaCan
Menu
Back to cohort
Record W2125175190 · doi:10.1109/icassp.2005.1415231

Increasing the Robustness of CELP-Based Coders By Constrained Optimization

2006· article· en· W2125175190 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsUniversité de Sherbrooke
Fundersnot available
KeywordsCode-excited linear predictionComputer scienceCodecCodebookSpeech codingSpeech recognitionEncoderRobustness (evolution)Adaptive Multi-Rate audio codecLinear predictive codingVector sum excited linear predictionAlgorithmVoice activity detectionSpeech processingComputer hardware

Abstract

fetched live from OpenAlex

The adaptive codebook used in CELP-like speech coders is extremely effective on voiced signals. Unfortunately, it is also the main source of error propagation at the decoder when a frame is lost. In this paper, we study several ways of limiting the energy contribution of the adaptive codebook to the synthesized speech signal. We show that a constrained search of the adaptive and innovative codebooks significantly improves the recovery time of the decoder after a lost frame, at the cost of only minor quality degradation in a clear channel. When applied to a standard codec such as the AMR-WB, this constraint only affects the encoder, and the modified codec remains fully interoperable with the standard codec.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.305
Threshold uncertainty score0.232

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.007
GPT teacher head0.226
Teacher spread0.219 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations7
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207