MétaCan
Menu
Back to cohort
Record W2150202460 · doi:10.1109/icc.2006.255450

Blind Channel Estimation and Multi-User Detection for Wireless CDMA Systems

2006· article· en· W2150202460 on OpenAlexaff
Tolga Kurt, Abbas Yongaçoğlu

Bibliographic record

Venue2006 IEEE International Conference on Communications · 2006
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceMultiuser detectionDetectorMatching pursuitChannel (broadcasting)Subspace topologyCode division multiple accessSingle antenna interference cancellationAlgorithmInterference (communication)WirelessArtificial intelligenceCompressed sensingTelecommunications

Abstract

fetched live from OpenAlex

In this paper, we propose a novel system architecture for channel estimation and multi-user detection in CDMA systems. Estimation and detection are performed jointly by sequential basis selection algorithms; namely the basic matching pursuit (BMP) algorithm and the orthogonal matching pursuit (OMP) algorithm. We start by demonstrating that the iterations of the BMP algorithm are equivalent to that of the well known detection method, successive interference cancelation (SIC) in code domain. We then introduce the OMP algorithm as a multi-user detector. This novel detection structure orthogonalizes the SIC process hence improves the detection performance. By using simulation results, we demonstrate that its performance is equivalent to decorrelating detector. Inspired from these results, we propose a joint blind channel estimation and detection scheme employing OMP. This novel scheme is less complex than subspace based techniques and gives better performance.

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

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.0010.000
Scholarly communication0.0010.001
Open science0.0030.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.140
GPT teacher head0.374
Teacher spread0.234 · 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

Citations3
Published2006
Admission routes1
Has abstractyes

Explore more

Same venue2006 IEEE International Conference on CommunicationsSame topicWireless Communication Networks ResearchFrench-language works237,207