MétaCan
Menu
Back to cohort
Record W1673798896 · doi:10.1109/vtc.2002.1002913

A low-complexity iterative multiuser receiver for turbo-coded MC-CDMA system

2003· article· en· W1673798896 on OpenAlexaff
P.L. Kafle, A.B. Sesay

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsSingle antenna interference cancellationMultiuser detectionComputer scienceRayleigh fadingMaximum a posteriori estimationTurboTurbo codeAlgorithmCode division multiple accessMultipath propagationTurbo equalizerIterative methodInterference (communication)FadingMaximum likelihood sequence estimationComputational complexity theoryDecoding methodsElectronic engineeringMaximum likelihoodTelecommunicationsEstimation theoryChannel (broadcasting)MathematicsLow-density parity-check codeEngineeringStatistics

Abstract

fetched live from OpenAlex

A low-complexity iterative multiuser receiver is proposed using groupwise maximum likelihood sequence estimation (MLSE) combined with a modified interference cancellation scheme in a turbo coded MC-CDMA system. It is based on grouping the active users according to their signal strengths and computing the log-likelihood ratios by MLSE among each group of users at the first iteration. For subsequent iterations, a modified interference cancellation scheme that can benefit from code extrinsic information available through decoding is used, for lower complexity. Simulation results are presented in a Rayleigh multipath fading environment for a typical data transmission scheme. Comparisons are made with iterative receivers using the maximum a posteriori (MAP) criterion and soft interference cancellation. Performance very close to that of a MAP based iterative receiver is achieved by this novel scheme within a few iterations, with much lower computational cost. This approach also performs significantly well under near-far conditions.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.980
Threshold uncertainty score0.633

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.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.064
GPT teacher head0.311
Teacher spread0.247 · 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 designTheoretical or conceptual
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

Citations2
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Networks ResearchFrench-language works237,207