MétaCan
Menu
Back to cohort
Record W3169625709 · doi:10.1109/lcomm.2021.3089725

Bursty Impulsive Noise Mitigation in NOMA: A MAP Receiver-Based Approach

2021· article· en· W3169625709 on OpenAlexafffund
Md Sahabul Alam, Bassant Selim, Imtiaz Ahmed, Georges Kaddoum, Halim Yanıkömeroğlu

Bibliographic record

VenueIEEE Communications Letters · 2021
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Technologies
Canadian institutionsÉcole de Technologie SupérieureEricsson (Canada)Carleton University
FundersFonds de recherche du Québec – Nature et technologies
KeywordsComputer scienceTelecommunications linkImpulse noiseNomaNoise (video)Gaussian noiseReal-time computingDecoding methodsSingle antenna interference cancellationBit error rateContext (archaeology)Electronic engineeringAlgorithmTelecommunicationsArtificial intelligence

Abstract

fetched live from OpenAlex

Non-orthogonal multiple access (NOMA) was recently proposed as a promising multiple access technique that can enable improved spectral efficiency, massive connectivity, and low latency. In this letter, we analyze the performance of power domain NOMA in the presence of impulsive noise, which is encountered in various practical applications, such as smart-grid communications. Such noise is known to degrade overall system performance. Moreover, since the noise in question is bursty, it is an arduous task to detect the signals with conventional receivers. Therefore, this letter sheds light on the performance degradation and mitigation of bursty impulsive noise, modeled by a two-state Markov-Gaussian process, in the context of uplink NOMA systems. More specifically, we propose a maximum a posteriori (MAP) receiver combined with successive interference cancellation to mitigate the effect of impulsive noise on the detection of the different users' signals. Simulation results prove the effectiveness of the proposed MAP-based bursty impulsive noise mitigation scheme in terms of bit error rate.

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: Empirical · Consensus signal: none
Teacher disagreement score0.641
Threshold uncertainty score0.957

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.017
GPT teacher head0.242
Teacher spread0.224 · 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
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

Citations8
Published2021
Admission routes2
Has abstractyes

Explore more

Same venueIEEE Communications LettersSame topicAdvanced Wireless Communication TechnologiesFrench-language works237,207