MétaCan
Menu
Back to cohort

Deep Learning Based Modified Message Passing Algorithm for Sparse Code Multiple Access

2019· article· en· W3002563005 on OpenAlexaff
Lanping Li, Xiaohu Tang, Chintha Tellambura

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Technologies
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsMessage passingComputer scienceAlgorithmCode (set theory)Convergence (economics)Artificial neural networkRate of convergenceComputational complexity theoryGraphFactor graphTheoretical computer scienceArtificial intelligenceParallel computingDecoding methodsChannel (broadcasting)Telecommunications

Abstract

fetched live from OpenAlex

Shuffled message passing algorithm (SMPA) is a serial variant of message passing algorithm (MPA) for sparse code multiple access (SCMA) signal detection, which accelerates the convergence rate of MPA. However, SMPA still achieves the near-optimal performance due to the effect of cycles in the factor graph. In the paper, we propose to optimize the weights assigned to the edges of the factor graph by unfolding SMPA as layers of deep neural network (DNN). We consider the weights as network parameters and then train the network offline to obtain weights which can minimize the loss function. With simulations, we show that DNN based SMPA (DNN-SMPA) outperforms SMPA in terms of bit-error-rate (BER) for the same level of computational complexity.

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.775
Threshold uncertainty score0.657

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.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.031
GPT teacher head0.273
Teacher spread0.243 · 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

Citations5
Published2019
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Communication TechnologiesFrench-language works237,207