MétaCan
Menu
Back to cohort
Record W1802314031 · doi:10.1109/adfsp.1998.685720

Wavelet-based compression of speech signals on the TMS320C30 digital signal processor

2002· article· en· W1802314031 on OpenAlexaff
I.V. Singh, P. Agathoklis, A. Antoniou

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsLossless compressionLossy compressionComputer scienceData compressionSpeech recognitionData compression ratioCompression ratioHuffman codingWaveletAlgorithmImage compressionArtificial intelligenceImage processingEngineering

Abstract

fetched live from OpenAlex

Lossless and lossy compression of speech signals using wavelet transforms is examined. Reversible wavelets based on integer arithmetic are used to calculate the transform coefficients. These coefficients are quantized and coded using a two-pass Huffman coder. Comparisons are made with other state-of-the-art coders such as the low-delay code excited linear predictive coder described in the G.728 standard. The proposed technique achieves an average lossless compression ratio of 1.8:1 and average lossy compression ratio of 3.2:1 with peak-signal-to-noise-ratio (PSNR) of more than 40 dB. The technique has also been successfully implemented on the TMS320C30 digital signal processor for real-time speech compression.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.002
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
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.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0020.001

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.036
GPT teacher head0.253
Teacher spread0.217 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations2
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207