MétaCan
Menu
Back to cohort
Record W2088652862 · doi:10.1049/iet-spr.2008.0203

Least square identification of alias components of linear periodically time-varying systems and optimal training signal design

2010· article· en· W2088652862 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIET Signal Processing · 2010
Typearticle
Languageen
FieldEngineering
TopicAdvanced Adaptive Filtering Techniques
Canadian institutionsUniversity of Saskatchewan
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsAliasControl theory (sociology)Finite impulse responseOversamplingInfinite impulse responseMathematicsAlgorithmComputer scienceDigital filterFilter (signal processing)Telecommunications

Abstract

fetched live from OpenAlex

A least-squares (LS) method for identifying alias components of discrete linear periodically time-varying (LPTV) systems is proposed. The authors apply a periodic input signal to a finite impulse response (FIR)–LPTV system and measure the noise-contaminated output. The output of this LPTV system has the same period as the input when the period of the input signal is a multiple of the period of the LPTV system. The authors show that the input and the output can be related by using the discrete Fourier transform. In the frequency domain, an LS method can be used to identify the alias components. A lower bound on the mean square error (MSE) of the estimated alias components is given for FIR–LPTV systems. The optimal training signal achieving this lower MSE bound is designed subsequently. The algorithm is extended to the identification of infinite impulse response (IIR)–LPTV systems as well. Simulation results show the accuracy of the estimation and the efficiency of the optimal training signal design.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.670
Threshold uncertainty score0.884

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.037
GPT teacher head0.262
Teacher spread0.225 · 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