Nearly Linear-Phase 2-D Recursive Digital Filters Design Using Balanced Realization Model Reduction
Bibliographic record
Abstract
This paper presents a new method for the design of separable-denominator 2-D IIR filters with nearly linear phase in the passband. The design method is based on a balanced realization model reduction technique. The nearly linear-phase 2-D IIR filter is designed using 2-D model reduction from a linear-phase 2-D FIR filter, which serves as the initial filter. The structured controllability and observability Gramians Ps and Qs serve as the foundation for this technique. onal positive-definite matrices that satisfy 2-D Lyapunov equations. An efficient method is used to compute these Gramians by minimizing the traces of Ps and Qs under linear matrix inequality (LMI) constraints. The use of these Gramians ensures that the resulting 2-D IIR filter preserves stability and can be implemented using a separable-denominator 2-D filter with fewer coefficients than the original 2-D FIR filter. Numerical examples show that the proposed method compares favorably with existing techniques.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".