MétaCan
Menu
Back to cohort
Record W2132287493 · doi:10.1109/ccece.2007.158

Chase Based Multiuser Detection for MIMO-CDMA Systems

2007· article· en· W2132287493 on OpenAlexaff
Feng Liu, Mohammad Soleymani

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsConcordia University
Fundersnot available
KeywordsMIMODetectorMultiuser detectionCode division multiple accessComputer scienceElectronic engineeringDetection theoryBit error rateNoise (video)TelecommunicationsEngineeringChannel (broadcasting)Artificial intelligence

Abstract

fetched live from OpenAlex

In multiuser MIMO-CDMA systems, the layered space-time multiuser detector (LAST-MUD) can achieve high data rate and reliable communication by combining time-domain technique and space-domain technique. At the receiver side of LAST-MUD, the mathematical expression of the signals passing through the space-code matched filters is similar to the received signals of the V-BLAST system. This similarity makes it possible to apply some advance detection schemes originally used in single user V-BLAST system to multiuser MIMO-CDMA system. Recently, the B-Chase and L-Chase detectors have been developed to improve V-BLAST system performance. In this paper, we investigate the use of these two Chase based schemes to MIMO-CDMA system. The simulation results show that the performance of the L-Chase detector is worse than LAST-MUD due to the error in noise estimation, while the B-Chase detector can achieve a better performance than LAST-MUD.

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.942
Threshold uncertainty score0.308

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.0010.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.042
GPT teacher head0.321
Teacher spread0.279 · 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

Citations1
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Networks ResearchFrench-language works237,207