A Novel Technique for the Identification of ARMA Systems Under Very Low Levels of SNR
Bibliographic record
Abstract
In this paper, a novel technique for the identification of minimum-phase autoregressive moving average (ARMA) systems from the output observations in the presence of heavy noise is presented. First, starting from the conventional correlation estimator, a simple and accurate ARMA correlation (ARMAC) model in terms of the poles of the ARMA system is presented in a unified manner for white noise and impulse-train excitations. The AR parameters of the ARMA system are then obtained from the noisy observations by developing and using a residue-based least-squares correlation-fitting optimization technique that employs the proposed ARMAC model. As for the estimation of the MA parameters, it is preceded by the application of a new technique intended to reduce the noise present in the residual signal that is obtained by filtering the noisy ARMA signal via the estimated AR parameters. A scheme is then devised whereby the task of MA parameter estimation is transformed into a problem of correlation-fitting of the inverse autocorrelation function corresponding to the noise-compensated residual signal. In order to demonstrate the effectiveness of the proposed method, extensive simulations are performed by considering synthetic ARMA systems of different orders in the presence of additive white noise and the results are compared with those of some of the existing methods. It is shown that the proposed method is capable of estimating the ARMA parameters accurately and consistently with guaranteed stability for signal-to-noise ratio (SNR) levels as low as$-{5}~{\hbox {dB}}$. Simulation results are also provided for the identification of a human vocal-tract system using natural speech signals showing a superior performance of the proposed technique in terms of the power spectral density of the synthesized speech signal.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| 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".