MétaCan
Menu
Back to cohort
Record W2889358071 · doi:10.1109/spawc.2018.8445781

Low-Complexity Design of Decode-Forward Relaying in Massive MIMO Heterogeneous Networks

2018· article· en· W2889358071 on OpenAlexaff
Ahmad Abu Al Haija, Min Dong, Ben Liang, Gary Boudreau

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced MIMO Systems Optimization
Canadian institutionsEricsson (Canada)Ontario Tech UniversityUniversity of Toronto
Fundersnot available
KeywordsCodebookDecoding methodsComputer scienceTransmission (telecommunications)MIMOBase stationTelecommunications linkComputer networkJoint (building)DecodesScheme (mathematics)Set (abstract data type)AlgorithmTopology (electrical circuits)TelecommunicationsChannel (broadcasting)MathematicsEngineering

Abstract

fetched live from OpenAlex

We investigate the impact of massive MIMO on the uplink transmission design for a heterogeneous network (HetNet) where multiple users communicate with a macro-cell base station (MCBS) through multiple small-cell BSs (SCBSs). We develop a new scheme in which the SCBSs deploy decode-forward (DF) relaying, multi-layer binning, and time division transmission, where the number of binning layers (resp. time slots) is equal to the number of SCBSs (resp. users). The MCBS separately and sequentially decodes the binning indices and each user's message that belongs to those indices. The proposed scheme is simpler than schemes with common transmission of all users' messages by each SCBS and joint decoding at the MCBS: 1) the codebook size and the decoding complexity increase linearly with the number of users instead of exponentially, 2) every transmission-decoding step is similar to the conventional point-to-point communication, and 3) the same set of time slot durations at all SCBSs is sufficient to achieve the maximum rate. Despite its simplicity, the proposed scheme is effective since it achieves the same rate performance of more complex schemes with joint decoding.

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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.883
Threshold uncertainty score0.584

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.023
GPT teacher head0.239
Teacher spread0.216 · 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

Citations1
Published2018
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced MIMO Systems OptimizationFrench-language works237,207