MétaCan
Menu
Back to cohort
Record W1505714377

Backward Linear Prediction for Lossless Coding of Stereo Audio

2004· article· en· W1505714377 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

VenueJournal of the Audio Engineering Society · 2004
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsUniversité de Sherbrooke
Fundersnot available
KeywordsLinear predictionLossless compressionComputer scienceSpeech codingEntropy encodingAudio signalQuantization (signal processing)Vector quantizationSpeech recognitionAlgorithmData compressionEntropy (arrow of time)ResidualDecoding methodsRedundancy (engineering)
DOInot available

Abstract

fetched live from OpenAlex

Lossless audio coding aims at achieving the lowest possible bitrate for transmission or storage of audio without any loss of information. This is usually done by first removing redundancy from the audio signal, and then applying entropy coding to the residual signal. Linear prediction (LP), when applied to monophonic signals, is a very effective way to remove redundancy. It produces minimum-phase predictors that are efficiently compressed by combining vector quantization with a meaningful representation of the LP coefficients (such as the LSFs). When applied to stereo signals however, joint channel prediction often produces non-minimum-phase predictors, whose quantization requires a high bit rate and poses stability problems. In this paper, we show that backward estimation of the LP coefficients (where those are estimated on the past decoded signal) solves most of the problems associated with the use of joint channel prediction in a lossless audio coder.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.554
Threshold uncertainty score0.335

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.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.012
GPT teacher head0.242
Teacher spread0.230 · 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