Semi-Grant-Free NOMA: Ergodic Rates Analysis with Random Deployed Users

October 28, 2020 Β· Declared Dead Β· πŸ› IEEE Wireless Communications Letters

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Chao Zhang, Yuanwei Liu, Wenqiang Yi, Zhijin Qin, Zhiguo Ding arXiv ID 2010.15169 Category cs.IT: Information Theory Citations 34 Venue IEEE Wireless Communications Letters Last Checked 6 months ago
Abstract
Semi-grant-free (Semi-GF) non-orthogonal multiple access (NOMA) enables grant-free (GF) and grant-based (GB) users to share the same resource blocks, thereby balancing the connectivity and stability of communications. This letter analyzes ergodic rates of Semi-GF NOMA systems. First, this paper exploits a Semi-GF protocol, denoted as dynamic protocol, for selecting GF users into the occupied GB channels via the GB user's instantaneous received power. Under this protocol, the closed-form analytical and approximated expressions for ergodic rates are derived. The numerical results illustrate that the GF user (weak NOMA user) has a performance upper limit, while the ergodic rate of the GB user (strong NOMA user) increases linearly versus the transmit signal-to-noise ratio.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted