MétaCan
Menu
Back to cohort
Record W2090413096 · doi:10.1109/iccspa.2013.6487289

Multiuser detection for Rate-½ OSTBC wih four transmit antennas

2013· article· en· W2090413096 on OpenAlexaff
Rajab M. Legnain, Roshdy H. M. Hafez, Ian Marsland

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsCarleton University
Fundersnot available
KeywordsBlock codeComputer scienceSpace–time block codeRayleigh fadingCoding (social sciences)FadingTopology (electrical circuits)AlgorithmTelecommunicationsChannel (broadcasting)Decoding methodsMathematicsCombinatoricsStatistics

Abstract

fetched live from OpenAlex

In this paper we consider a multiuser detection scheme where K users, each with NTtransmit antennas, transmit their symbols simultaneaously using space-time block coding (STBC). Previously, it was shown that a receiver can completely separate signals of K users, where each user has two antenna and uses Alamouti coding, using a number of receive antennas equals to or greater than the number of users (i.e., NR≥ K). Also, it was shown that if there are two users employing rate-1/2 complex orthogonal STBC (OSTBC) the receiver can separate their signals. However, there is no work investigating the scenario when number of user is greater than two and each user has more than two transmit antennas. In this paper we show that if the K users are equipped with four transmit antennas and use rate-1/2 complex OSTBC, the receiver can completely separate the signals of all the users provided NR≥ K/2. For example, in the case of four users the receiver can separate all the signals using two antennas and provides diversity order of two. Numerical results are provided for the uncorrelated Rayleigh fading channel.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.001

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.025
GPT teacher head0.245
Teacher spread0.219 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Citations0
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Communication TechniquesFrench-language works237,207