MétaCan
Menu
Back to cohort
Record W2151078383 · doi:10.1109/icct.1996.545076

A reduced state Viterbi algorithm for multiuser detection in DS/CDMA systems

2002· article· en· W2151078383 on OpenAlexaff
Zhaocheng Wang, Ning Ge, Yan Yao, Qiang Wang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsCode division multiple accessComputer scienceViterbi algorithmAsynchronous communicationMultiuser detectionAlgorithmSpread spectrumAdditive white Gaussian noiseInterference (communication)Time division multiple accessDetectorComputational complexity theorySingle antenna interference cancellationElectronic engineeringReal-time computingTelecommunicationsDecoding methodsChannel (broadcasting)Engineering

Abstract

fetched live from OpenAlex

Code division multiple access (CDMA) has attracted considerable attention in digital cellular mobile and personal communications. We propose a novel multiuser detector based on the reduced state Viterbi algorithm. It partitions the total K users into G groups according to their power strengths and interference levels, which reduces the computational complexity per binary decision from O(2/sup K-1/) to O(G*2/sup K/G-1/) for asynchronous DS/CDMA systems in AWGN. Theoretical analyses and simulation results are presented to demonstrate the significant performance improvement over the successive interference canceler (SIC).

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.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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.993
Threshold uncertainty score0.401

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.001
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.045
GPT teacher head0.287
Teacher spread0.242 · 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
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Networks ResearchFrench-language works237,207