Characterization of Nonuniform Perfect-Reconstruction Filterbanks Using Unit-Step Signal
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
An algebraic characterization of nonuniform perfect reconstruction (PR) filterbanks with integer decimation factors is presented. The PR property is formulated in the z domain based on the response of the linear multirate systems to the delayed unit-step signals. This leads to a unique class of characterizing formulas that are necessary and sufficient conditions for the PR property and free from the complex roots of unity. Two related characterizations of nonuniform PR systems, in the form of necessary conditions, are also developed based on these formulas. As a concrete example, the results are then used to derive necessary and sufficient conditions for PR nonuniform delay chain filterbanks. The conditions show that nonuniform delay chain filterbanks are the signal processing realizations of the mathematical notion of the exact covering systems of congruence relations. Important results from the mathematics literature on the exact covering systems are introduced. The results elucidate the admissible factors of decimation for the nonuniform PR delay chain systems in settings with maximally distinct decimation factors. A simple test of the PR property for delay chain systems is also presented. The test is based on the divisibility of certain polynomials by the cyclotomic polynomials. Finally, multirate systems based on the Beatty sequences, which are the irrational generalization of the exact covering systems, are briefly discussed.
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.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.003 |
| Open science | 0.000 | 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