MétaCan
Menu
Back to cohort
Record W2048867907 · doi:10.1049/iet-com.2010.0730

Blind channel estimation for equalisation in dispersive fading channel

2011· article· en· W2048867907 on OpenAlexaff
S. Alireza Banani, Rodney G. Vaughan

Bibliographic record

VenueIET Communications · 2011
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsFadingChannel (broadcasting)Rayleigh fadingKalman filterAlgorithmChannel state informationComputer scienceOrthogonal frequency-division multiplexingBlind equalizationMathematicsMinimum mean square errorEqualization (audio)StatisticsControl theory (sociology)TelecommunicationsEstimatorWirelessArtificial intelligence

Abstract

fetched live from OpenAlex

A new blind channel estimation technique is presented for non-linear/linear equalisation in a frequency-selective Rayleigh fading channel. At each symbol interval, a decision algorithm first makes a primary data estimate based on constrained linear minimum mean square error criterion, and then this is applied to subsequent channel estimation. Channel estimates are obtained in the form of two alternative, related methods: directly from the Wiener solution or Kalman-based recursion. The former performs better but requires more values from the normalised time-correlation function. The performance is evaluated by simulation, allowing fair comparison with the benchmark of equalised coherent detection; optimal uncoded orthogonal frequency division multiplexing with perfect channel state information at the receiver; the conventional decision-directed Kalman filtering which employs channel tracking with delay; and for the special case of flat fading, an optimised, pilot symbol-assisted modulation system.

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.000
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: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0000.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.129
GPT teacher head0.324
Teacher spread0.195 · 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
GenreEmpirical

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

Citations2
Published2011
Admission routes1
Has abstractyes

Explore more

Same venueIET CommunicationsSame topicAdvanced Wireless Communication TechniquesFrench-language works237,207