Backward pitch prediction for low-delay speech coding
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.
Bibliographic record
Abstract
A backward-adaptive pitch prediction algorithm is described. It is used in conjunction with a backward-adaptive short-term predictor in a low-delay speech coding system operating at 16 kb/s. The backward-adaptive pitch prediction algorithm is a hybrid algorithm which combines backward block adaptive pitch prediction and backward recursive pitch prediction. The pitch predictor tap gains and the pitch period are periodically initialized by using a backward block adaptive algorithm. Between these initializations, however, both the tap gains and the pitch period are adapted using backward recursive algorithms. The tap gains are adapted using the well-known gradient algorithm, in a manner similar to the way the short-term predictor coefficients are adapted. The pitch period is adapted using a novel pitch tracking algorithm. By combining backward recursive adaptation with backward block adaptation, it was possible to increase the prediction gain of the pitch predictor and reduce the interval required between initialization of the pitch predictor parameters.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it