MétaCan
Menu
Back to cohort
Record W2158535666 · doi:10.1109/vetec.1994.345385

Low complexity, low delay speech coding for indoor wireless communications

2002· article· en· W2158535666 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 institutionsCarleton University
Fundersnot available
KeywordsComputer scienceWirelessCode-excited linear predictionInterleavingRobustness (evolution)Time division multiple accessCodecFull RateComputer networkReal-time computingSpeech codingSpeech recognitionTelecommunicationsLinear predictive coding

Abstract

fetched live from OpenAlex

The paper presents a low complexity, low delay variable rate speech coding method suitable for low power (CDMA or TDMA) indoor wireless communications. The indoor wireless communications channel is characterized by relatively deep fades resulting in bursty errors. A robust speech codec is required to combat this bursty nature. Low power operation is essential, which negates the applicability of LD-CELP (G.728) for indoor wireless applications, Historically, ADPCM (G.721) has been proposed, which lacks robustness to random and bursty errors and has a relatively high bit rate (32 kb/s). To circumvent the need for relatively complex echo-cancellation, low end to end delays are required which implies that interleaving is not applicable. In the paper, a low complexity, low delay, variable rate CELP algorithm is proposed and techniques to improve the robustness to bursty errors are investigated. The new technique is compared to ADPCM on the basis of complexity and performance (MOS) over measured indoor wireless channels at 1.7 GHz with various combinations of space, frequency and code diversity.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.797
Threshold uncertainty score0.688

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.001
Open science0.0040.002
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.094
GPT teacher head0.328
Teacher spread0.234 · 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

Citations5
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207