MétaCan
Menu
Back to cohort
Record W1578593028 · doi:10.1109/iscas.2006.1693891

A blind identification technique for noisy ARMA systems

2006· article· en· W1578593028 on OpenAlexaff
Shaikh Anowarul Fattah, Wei‐Ping Zhu, M. Omair Ahmad

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicBlind Source Separation Techniques
Canadian institutionsConcordia University
Fundersnot available
KeywordsCepstrumAutoregressive–moving-average modelAutocorrelationAutoregressive modelComputer scienceNoise (video)Speech recognitionSystem identificationEstimation theoryIdentification (biology)Moving averageAlgorithmMathematicsPattern recognition (psychology)Artificial intelligenceStatisticsData modeling

Abstract

fetched live from OpenAlex

In this paper, a new model for the ramp-cepstrum of the one-sided autocorrelation function of a noise-free autoregressive moving average (ARMA) signal is presented. The proposed blind identification technique can estimate the parameters of ARMA systems in both noise-free and noisy environments without using the input observations. It is shown that, utilizing the proposed ARMA ramp-cepstrum model in accordance with a residue-based least-squares optimization technique, both AR and MA parameters of ARMA systems can be directly obtained. The proposed method is tested on synthetic ARMA systems of different orders and also on some natural speech signals. Simulation results demonstrate the efficacy of the proposed identification scheme at low to high SNR levels

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.001
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.019
GPT teacher head0.281
Teacher spread0.262 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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".

Quick stats

Citations3
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicBlind Source Separation TechniquesFrench-language works237,207