MétaCan
Menu
Back to cohort
Record W2095649434 · doi:10.1109/glocom.2005.1578323

Generalized feedback detection for MIMO systems

2005· article· en· W2095649434 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueGLOBECOM '05. IEEE Global Telecommunications Conference, 2005. · 2005
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsMIMODecoding methodsDetectorComputer scienceConvolutional codeComputationAlgorithmTree (set theory)MultiplexingTheoretical computer scienceMathematicsChannel (broadcasting)Telecommunications

Abstract

fetched live from OpenAlex

In this paper, we present a unified detection framework for spatial multiplexing multiple-input multiple-output (MIMO) systems. We propose a generalized feedback detector (GFD) by modifying the classical feedback decoding algorithm for convolutional codes. When the three controlling parameters of the GFD vary, the diversity order of the GFD varies between 1 and N and the SNR gain also varies. Many previous MIMO detectors are special cases of our GFD. The connection between MIMO detectors and tree search algorithms is also established. To reduce redundant computations in the GFD, a shared computation technique is proposed using a tree data structure. The complexity of the GFD varies between those of maximum-likelihood (ML) detection and zero-forcing decision feedback detector (ZF-DFD). Our proposed GFD provides a flexible performance-complexity tradeoff.

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.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.855
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0010.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.028
GPT teacher head0.281
Teacher spread0.253 · 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