MétaCan
Menu
Back to cohort
Record W1804403131 · doi:10.1109/icc.2003.1204302

Soft quasi-maximum-likelihood detection for multiple-antenna channels

2004· article· en· W1804403131 on OpenAlexaff
B. Steingrimsson, Zhi‐Quan Luo, Kon Max Wong

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsMcMaster University
Fundersnot available
KeywordsDetectorMIMOAlgorithmChannel state informationComputer scienceRayleigh fadingPhase-shift keyingAntenna (radio)Electronic engineeringKeyingChannel (broadcasting)FadingWirelessMathematicsTopology (electrical circuits)Control theory (sociology)TelecommunicationsDecoding methodsBit error rateEngineeringCombinatoricsArtificial intelligence

Abstract

fetched live from OpenAlex

The paper addresses soft maximum-likelihood (ML) detection for multiple-antenna wireless channels. We propose a soft quasi-ML detector, which maximizes the log-likelihood function by developing a semi-definite relaxation (SDR). Given perfect channel state information at the receiver, the quasi-ML detector achieves the performance of the optimal ML detector in both coded and uncoded multiple-input multiple-output (MIMO) channels with quadrature phase-shift keying modulation and frequency-flat Rayleigh fading. The complexity of the quasi-ML SDR detector is much less than that of the optimal ML detector, and, thus, the quasi-ML detector offers more favorable performance/complexity trade-off. Compared to the existing sphere decoder the quasi-ML detector enjoys low polynomial worst-case complexity, as well as guaranteed near capacity 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.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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.905
Threshold uncertainty score0.615

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.015
GPT teacher head0.247
Teacher spread0.232 · 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 designBench or experimental
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

Citations8
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Communication TechniquesFrench-language works237,207