Implementation of MPEG system target decoder
Bibliographic record
Abstract
The MPEG-2 system standard provides methods for multiplexing a number of elementary MPEG streams into a single system stream. It also defines methods to maintain the synchronization and timing of compressed streams. This is achieved by exact definitions of the times at which data arrive to the decoder, timing of data flow in the decoder and timing of decoding and presentation events. For this purpose, the standard defines a conceptual model for a target decoder, called "system target decoder" (STD), which is used to model the decoding process. System streams generated by the multiplexer should comply with the specifications imposed by the STD model to guarantee the normal operations of real time decoding and presentation process. Therefore, this model is necessary during the construction and verification of system streams. The multiplexer should observe the behavior of STD to ensure that decoder buffers will not overflow or underflow due to encoding or multiplexing issues when receiving the system stream. To achieve this, the scheduler that coordinates the multiplexing order of system packs should consider the monitored information from STD as one of the scheduling control parameters to follow the specifications imposed by STD. This paper describes the theoretical principles, design considerations and architecture of program and transport STDs. The implementations of these target decoders in a software package for verification of MPEG system streams is presented. This implementation uses Microsoft DirectShow. The results of decoding some sample system streams are also presented.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.009 | 0.004 |
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".