MétaCan
Menu
Back to cohort

Compressed Sensing Based Channel Estimation for GFDM Systems in High Mobility Scenario

2023· article· en· W4388426810 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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicPAPR reduction in OFDM
Canadian institutionsConcordia University
Fundersnot available
KeywordsComputer scienceChannel (broadcasting)Compressed sensingOrthogonal frequency-division multiplexingOverhead (engineering)AlgorithmDoppler effectFrequency domainMultiplexingSubspace topologyReal-time computingElectronic engineeringTelecommunicationsEngineeringArtificial intelligence

Abstract

fetched live from OpenAlex

In this paper a channel estimation method using compressed sensing is proposed for generalized frequency division multiplexing (GFDM) systems in high mobility scenarios. The sparsity of the channel model in the delay-Doppler domain makes it possible to employ the subspace pursuit (SP) algorithm to ease the channel estimation process. Besides, the spectral efficiency is improved through superimposing pilot symbols on the data symbols without requiring any guard between pilot and data symbols. To separate data from pilot symbols for the channel estimation in the delay-Doppler domain, an unknown data-dependent sequence is added to the time-frequency data symbols. Our simulation results show that the proposed algorithm provides accurate channel estimation with low pilot overhead.

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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.652
Threshold uncertainty score0.444

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.027
GPT teacher head0.250
Teacher spread0.223 · 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

Quick stats

Citations3
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicPAPR reduction in OFDMFrench-language works237,207