MétaCan
Menu
Back to cohort
Record W2799712149 · doi:10.1109/access.2018.2832616

Blind System Identification Using Symbolic Dynamics

2018· article· en· W2799712149 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

VenueIEEE Access · 2018
Typearticle
Languageen
FieldComputer Science
TopicBlind Source Separation Techniques
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsCramér–Rao boundBlind equalizationComputer scienceAlgorithmSystem identificationBinary numberUpper and lower boundsKalman filterEstimation theoryEqualization (audio)MathematicsArtificial intelligenceDecoding methodsData modeling

Abstract

fetched live from OpenAlex

In this paper, a chaos-based approach is proposed for system identification with binary random signal. A chaos-based approach is developed to model random binary sequence and is applied to blind system identification. The Cramér Rao Lower Bound (CRLB)-based on the chaos representation is derived. The theoretical mean square error of the proposed approach is also derived. It is shown that the proposed blind approach achieves the CRLB asymptotically. The proposed technique is applied to blind channel equalization of a quadrature amplitude modulation communication system. The equalizer is based on expected maximization and unscented Kalman filtering and smoother. Our proposed method shows superior performance in comparison with conventional blind equalization techniques. The significance of this research is to extend the advantages of chaos to random signals for the blind system identification.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.912
Threshold uncertainty score0.829

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.001
Science and technology studies0.0000.000
Scholarly communication0.0010.002
Open science0.0010.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.059
GPT teacher head0.363
Teacher spread0.304 · 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