Parametric Mixing for Centralized VOIP Conferencing using ITU-T Recommendation G.722.2
Bibliographic record
Abstract
VoIP conferencing with a centralized speech mixing bridge introduces additional end-to-end latency into packetized voice communication. This paper investigates how full tandem speech decoding, time-domain mixing, speech encoding cycle can be circumvented by instead extracting the coded speech parameters and performing the speech packet mixing without time-domain reconstruction. By mixing through coded speech parameters, we show that nearly an 85 % decrease in computational complexity can be achieved over full tandem mixing of two speakers for G.722.2, thus significantly reducing the packet latency at the centralized speech mixing bridge. For the G.722.2 parametric mixer presented, linear prediction coefficients (LPCs), pitch lags, fixed codebooks, and gains, are extracted (without full speech reconstruction) from the encoded bit stream, mixed, and then re-encoded instead of the full tandem approach where each speech frame must be fully reconstructed. We investigate the mixing in two scenarios: i) mix two 12.65 kbps G.722.2 speech streams at a mixed rate of 12.65 kbps, and ii) mix two 12.65 kbps G.722.2 speech streams at a mixed rate of 18.25 kbps. PAMS is used to evaluate the speech quality of the parametric mixer, resulting in an average distortion 0.37 MOS (compared to tandem mixing) as shown by simulations using typical conversation models
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 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.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.002 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".