MétaCan
Menu
Back to cohort
Record W4406604079 · doi:10.1002/itl2.585

A comparative analysis of diversity combining techniques for repetitive transmissions in time spreading <scp>SCMA</scp> systems

2024· article· en· W4406604079 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

VenueInternet Technology Letters · 2024
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Technologies
Canadian institutionsToronto Metropolitan University
FundersTürkiye Bilimsel ve Teknolojik Araştırma Kurumu
KeywordsComputer scienceDiversity (politics)Sociology

Abstract

fetched live from OpenAlex

Abstract Sparse Code Multiple Access (SCMA) is a recently introduced wireless communication network technology. There are various techniques in SCMA systems to increase the system's efficiency, and one of these techniques is time spreading. By adding repetitive transmission and time spreading into SCMA, it is shown in previous works that the Bit‐Error‐Rate (BER) results are improved convincingly. However, in the previous works, other diversity combining techniques have not been considered. This paper introduces a new approach to further improve the performance of repetitive transmission in SCMA systems with time spreading by adding imperialist competitive algorithm in diversity combining. Alongside, four different combining techniques; equal gain combining, maximal ratio combining, selection combining, and genetic algorithm are considered to bring comparative analysis to show the significance of the new technique. Results show that the proposed method offers up to 2.3 dB gain in terms of BER, under certain conditions.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.401
Threshold uncertainty score0.853

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0020.002
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.020
GPT teacher head0.271
Teacher spread0.251 · 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