MétaCan
Menu
Back to cohort

Adaptive Blind Equalization of Nonlinear Channels and Chaotic Systems using Coupled EKF and RLS Estimator

2005· article· en· W2328031340 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.

Bibliographic record

VenueIETE Journal of Research · 2005
Typearticle
Languageen
FieldComputer Science
TopicBlind Source Separation Techniques
Canadian institutionsConcordia University
FundersElse Kröner-Fresenius-Stiftung
KeywordsControl theory (sociology)Extended Kalman filterEstimatorChaoticNonlinear systemEqualization (audio)Channel (broadcasting)Kalman filterComputer scienceMathematicsTelecommunicationsStatisticsArtificial intelligence

Abstract

fetched live from OpenAlex

A novel approach, which employs coupled extended Kalman filter (EKF) and recursive least squares (RLS) estimator is proposed for adaptive blind equalization of nonlinear channels and chaotic systems. The conventional models of nonlinear FIR Volterra channels, nonlinear IIR channels, and chaotic communication systems are cast into regression models to formulate RLS algorithm to estimate the unknown channel parameters. The state-space representation of the channels have been formulated to develop the EKF to estimate the state from which the input sequence can be recovered. Then, the EKF and RLS estimator are coupled to estimate jointly the channel parameters and the state. The stability problem of the estimator is also addressed. The proposed estimator is corroborated with simulation examples on adaptive blind equalization of nonlinear FIR Volterra channels, nonlinear IIR channels, and chaotic communication systems. Simulation results show that the proposed estimator is effective in recovering the input sequence as well as the channel parameters blindly from the channel output measurement.

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.004
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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.751
Threshold uncertainty score0.279

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0040.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.160
GPT teacher head0.425
Teacher spread0.265 · 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