MétaCan
Menu
Back to cohort
Record W2107464828 · doi:10.1109/glocom.1995.502765

A reduced complexity channel estimator for linear modulations operating in fading dispersive channels

2002· article· en· W2107464828 on OpenAlexaff
P. Ho, Deng Guanghua, J.K. Cavers

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsFadingChannel state informationEstimatorComputer scienceRayleigh fadingAlgorithmChannel (broadcasting)Fading distributionPhase-shift keyingViterbi algorithmOrthogonal frequency-division multiplexingBit error rateMathematicsElectronic engineeringTelecommunicationsStatisticsDecoding methodsEngineeringWireless

Abstract

fetched live from OpenAlex

A reduced complexity, pilot symbol assisted channel estimator is presented in the paper for linear modulations operating in frequency selective Rayleigh fading channel. Instead of estimating the entire channel impulse response, our estimator only estimates a few derivative fading processes and uses them to construct the channel impulse response estimate. The technique is computationally efficient, especially for applications where the channel delay spread is small. The performance of our estimator, measured indirectly by the bit error of the companion Viterbi receiver, was evaluated for BPSK, with the number of state of the receiver as a parameter. It was found that a 16 state Viterbi receiver provides close to ideal performance. There is no irreducible error floor. To the contrary, a third order diversity effect is observed in a channel with a uniform delay-power profile. When the number of states in the receiver is reduced to 4, only a second order diversity effect is observed. Finally, we note that our receiver is quite robust against fast fading.

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.001
metaresearch head score (Gemma)0.003
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.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.000
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.086
GPT teacher head0.303
Teacher spread0.217 · 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

Citations1
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Communication TechniquesFrench-language works237,207