MétaCan
Menu
Back to cohort
Record W2140972142 · doi:10.1109/vetecf.2008.154

Blind Polynomial Channel Estimation for OFDM Systems

2008· article· en· W2140972142 on OpenAlexaff
Y. H. Zhang, Wu-Sheng Lu, T. Aaron Gulliver

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicBlind Source Separation Techniques
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsOrthogonal frequency-division multiplexingChannel (broadcasting)PolynomialAlgorithmComputer scienceSIGNAL (programming language)Blind equalizationComputational complexity theoryBit error rateMinimum mean square errorModulation (music)Mean squared errorMathematicsMathematical optimizationTelecommunicationsStatisticsEqualization (audio)Estimator

Abstract

fetched live from OpenAlex

Orthogonal frequency division multiplexing (OFDM) modulation is widely used in communication systems to meet the demand for ever increasing data rates. Characteristics of the transmitted signal can be employed for blind channel identification. In this paper, we propose a blind polynomial channel estimation algorithm using noncircular second-order statistics of the received OFDM signal. A set of polynomial equations are then formulated based on the correlation of the received signal. The solution of these equations provides an estimate of the channel coefficients. Results are presented which show that the proposed algorithm provides performance comparable to the least minimum mean square error (LMMSE) solution with low computational complexity. The performance is near-optimal for large OFDM systems.

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 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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.970
Threshold uncertainty score0.271

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.050
GPT teacher head0.286
Teacher spread0.236 · 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 teacher head, 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

Citations0
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicBlind Source Separation TechniquesFrench-language works237,207