MétaCan
Menu
Back to cohort
Record W2146578672 · doi:10.1109/vetecs.2007.407

A Low Complexity Frequency Domain Iterative Decision-Directed Channel Estimation Technique for Single-Carrier Systems

2007· article· en· W2146578672 on OpenAlexaff
Chan–Tong Lam, D.D. Falconer, Florence Danilo-Lemoine

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsCarleton University
FundersEuropean Commission
KeywordsFrequency domainViterbi algorithmChannel (broadcasting)Computer scienceAlgorithmWiener filterNoise (video)Viterbi decoderOrthogonal frequency-division multiplexingFrame (networking)Decoding methodsTelecommunicationsArtificial intelligence

Abstract

fetched live from OpenAlex

A low complexity frequency domain iterative decision-directed channel estimation (FD-IDDCE) technique for single-carrier (SC) systems with frequency domain multiplexed (FDM) pilots is proposed. The tentative hard decisions from either the frequency domain equalizer output or the Viterbi decoder output are used as extra pilots to further improve the initial frequency channel estimates using a cascaded 2 times 1D Wiener filter. The issue of noise enhancement when finding the least square (LS) estimates of the channel frequency response (CFR) using the tentative decisions in the frequency domain is overcome by the so called frequency replacement algorithm, which replaces the noise enhanced LS estimates of the CFR with the corresponding channel frequency estimates in the previous iteration, by comparing with a threshold. Using the proposed FD-IDDCE, the frame error rate (FER) performance for coded SC systems using FDM pilots with frequency expanding technique and frequency domain superimposed pilot technique was found to be about 0.4 dB and about 1 dB away from the FER performance with known CFR at FER=10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-2</sup> .

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.001
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: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.506
Threshold uncertainty score0.939

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.030
GPT teacher head0.286
Teacher spread0.255 · 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 designBench or experimental
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

Citations10
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Communication TechniquesFrench-language works237,207