MétaCan
Menu
Back to cohort
Record W2944780132 · doi:10.1109/tvt.2019.2915005

Spectral Efficiency of Multipair Massive MIMO Two-Way Relaying With Imperfect CSI

2019· article· en· W2944780132 on OpenAlexfundno aff
Chuili Kong, Caijun Zhong, Michail Matthaiou, Emil Björnson, Zhaoyang Zhang

Bibliographic record

VenueIEEE Transactions on Vehicular Technology · 2019
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsnot available
FundersNational Natural Science Foundation of ChinaState Key Laboratory of Integrated Services NetworksQueen's UniversityQueen's University BelfastNational Natural Science Foundation of China-Zhejiang Joint Fund for the Integration of Industrialization and InformatizationLeverhulme Trust
KeywordsRelayMIMOSpectral efficiencyTopology (electrical circuits)Computer scienceChannel (broadcasting)Transmitter power outputPower (physics)AlgorithmMathematicsTelecommunicationsPhysicsCombinatorics

Abstract

fetched live from OpenAlex

We consider a two-way half-duplex relaying system where multiple pairs of single-antenna users exchange information assisted by a multiple-antenna relay. Taking into account the practical constraint of imperfect channel knowledge, we study the achievable sum spectral efficiency (SE) of the amplify-and-forward protocol, assuming that the relay employs maximum ratio processing. We derive a closed-form expression for the sum SE for arbitrary system parameters and a large-scale approximation for the sum SE when the number of relay antennas M becomes sufficiently large. In addition, we study how the transmit power reduces with M to maintain a desired SE. Our results show that by using a large number of relay antennas, the transmit powers of the user, relay, and pilot symbol can be scaled down proportionally to 1/M <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">α</sup> , 1/M <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">β</sup> , and 1/M <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">γ</sup> for certain combinations of α, β, and γ, respectively. This elegant power scaling law reveals a fundamental tradeoff between the transmit powers of the user/relay and pilot symbol. Finally, capitalizing on the new expressions for the sum SE, novel power allocation schemes are designed to further improve the sum SE.

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: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.581
Threshold uncertainty score0.682

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
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.011
GPT teacher head0.239
Teacher spread0.228 · 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
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

Citations15
Published2019
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Vehicular TechnologySame topicCooperative Communication and Network CodingFrench-language works237,207