MétaCan
Menu
Back to cohort
Record W2102524639 · doi:10.1109/icassp.2008.4518243

Channel estimation using DPSS based frames

2008· article· en· W2102524639 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

VenueProceedings of the ... IEEE International Conference on Acoustics, Speech, and Signal Processing · 2008
Typearticle
Languageen
FieldEngineering
TopicSparse and Compressive Sensing Techniques
Canadian institutionsCommunications Research Centre CanadaWestern University
Fundersnot available
KeywordsChannel (broadcasting)EstimatorAlgorithmRepresentation (politics)Computer scienceBasis (linear algebra)Frame (networking)Basis functionFadingEstimation theoryMatching (statistics)MathematicsDecoding methodsStatisticsTelecommunications

Abstract

fetched live from OpenAlex

Accurate and sparse representation of a moderately fast fading channel using bases functions is achievable when both channel and bases bands align. If a mismatch exists, usually a larger number of bases functions is needed to achieve the same accuracy. In this paper, we propose a novel approach for channel estimation based on frames, which preserves sparsity and improves estimation accuracy. Members of the frame are formed by modulating and varying the band-width of discrete prolate spheroidal sequences (DPSS) in order to reflect various scattering scenarios. To achieve the sparsity of the proposed representation, a matching pursuit approach is employed. The estimation accuracy of the scheme is evaluated and compared with the accuracy of a Slepian basis expansion estimator based on DPSS for a variety of mobile channel parameters. The results clearly indicate that for the same number of atoms, a significantly higher estimation accuracy is achievable with the proposed scheme when compared to the DPSS estimator.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.688
Threshold uncertainty score0.691

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.058
GPT teacher head0.274
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