MétaCan
Menu
Back to cohort
Record W2104172471 · doi:10.1109/pacrim.2001.953689

A new optimal transmit and receive diversity scheme

2002· article· en· W2104172471 on OpenAlexaff
Xiaoyan Feng, Cyril Leung

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsTransmit diversityFadingMaximal-ratio combiningComputer scienceSignal-to-noise ratio (imaging)Diversity combiningTransmission (telecommunications)Antenna diversityDiversity schemeDiversity gainScheme (mathematics)Constraint (computer-aided design)Antenna (radio)AlgorithmTelecommunicationsElectronic engineeringMathematicsDecoding methodsEngineering

Abstract

fetched live from OpenAlex

The effects of fading in mobile radio channels can be mitigated with the use of space (or antenna) diversity. One diversity scheme which is applicable to any number of transmit and receive antennas is maximum ratio transmission (MRT). In this paper, it is shown that a certain constraint on the MRT receiver combining weights results in performance degradation. A new transmit and receive diversity scheme, MRTC, is proposed which maximizes the output signal-to-noise ratio (SNR). The MRTC scheme optimizes the transmit and receive weights. It is found that MRTC can offer significant gains over MRT. Another slightly sub-optimal but simpler-to-implement diversity scheme, IMRT, is also proposed. The IMRT scheme uses the same transmit weights as MRT; however, in contrast to MRT, it uses optimal MRC-based receive weights.

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.841
Threshold uncertainty score0.535

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.001
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.058
GPT teacher head0.244
Teacher spread0.185 · 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

Citations21
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network CodingFrench-language works237,207