MétaCan
Menu
Back to cohort
Record W4317553693 · doi:10.1109/tcomm.2023.3238368

Analysis of Massive Ultra-Reliable and Low-Latency Communications Over the <i>κ</i>-<i>μ</i> Shadowed Fading Channel

2023· article· en· W4317553693 on OpenAlexaff
Jie Zeng, Teng Wu, Wei Feng, Wei Ni, Tiejun Lv, Shidong Zhou, Xianbin Wang, Y. Jay Guo

Bibliographic record

VenueIEEE Transactions on Communications · 2023
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Technologies
Canadian institutionsWestern University
FundersBeijing Institute of Technology Research Fund Program for Young ScholarsNatural Science Foundation of Beijing MunicipalityNational Natural Science Foundation of China
KeywordsFadingChannel state informationChannel (broadcasting)Probability density functionAlgorithmMathematicsMIMOComputer scienceStatisticsDecoding methodsWirelessTelecommunications

Abstract

fetched live from OpenAlex

We investigate the performance of massive ultra-reliable and low-latency communications (mURLLC) under massive active users, and non-uniform small-scale and shadow fading in the uplink (UL) of a next-generation multiple access (NGMA) system that integrates massive multiple-input multiple-output (MIMO) and non-orthogonal multiple access (NOMA) techniques. We first derive new closed-form expressions to accurately approximate the probability density function (PDF) and cumulative distribution function (CDF) of the channel gains in MIMO systems under the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\kappa $ </tex-math></inline-formula> - <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mu $ </tex-math></inline-formula> shadowed fading. Then, we derive the post-processing signal-to-noise ratio (SNR) and its closed-form PDFs and CDFs in the NGMA system, under both perfect and imperfect channel state information of the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\kappa $ </tex-math></inline-formula> - <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mu $ </tex-math></inline-formula> shadowed fading channel. Given the post-processing SNRs and their PDFs, the general expressions are established for the error probability (EP) to analyze the mURLLC of NGMA by applying finite blocklength information theory. Corroborated by extensive simulations, our analysis reveals that with the increasing reliability requirements of the users, the relative gaps in EPs enlarge between users experiencing different fading channels, and the feasible system configurations (i.e., the transmit powers of the users, and the numbers of antennas, active users, and subcarriers) also increasingly differ between the users. The impact of different fading on mURLLC implementations cannot be overlooked, and the research of mURLLC under the <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\kappa $ </tex-math></inline-formula> - <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mu $ </tex-math></inline-formula> shadowed fading model is indispensable. The NGMA system considered in this paper is capable of achieving mURLLC under non-uniform small-scale and shadow fading.

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.855
Threshold uncertainty score0.891

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.004
Science and technology studies0.0010.001
Scholarly communication0.0000.000
Open science0.0030.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.027
GPT teacher head0.268
Teacher spread0.241 · 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

Citations7
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on CommunicationsSame topicAdvanced Wireless Communication TechnologiesFrench-language works237,207