Results 221 to 230 of about 442,961 (254)
Some of the next articles are maybe not open access.

Contention-based nonorthogonal massive access with massive MIMO

China Communications, 2020
The sporadic communication character of massive machine-type communication systems provides natural advantages to utilize the principle of compressive sensing (CS). However, due to the high computational complexity of CS algorithms, CS-based contention-free access schemes have limited scalability and high computational complexity for massive access ...
Yanna Bai   +3 more
openaire   +1 more source

A perspective on massive random-access

2017 IEEE International Symposium on Information Theory (ISIT), 2017
This paper discusses the contemporary problem of providing multiple-access (MAC) to a massive number of uncoordinated users. First, we define a random-access code for Ka-user Gaussian MAC to be a collection of norm-constrained vectors such that the noisy sum of any K a of them can be decoded with a given (suitably defined) probability of error.
openaire   +2 more sources

Compressive-Sensing-Based Grant-Free Massive Access for 6G Massive Communication [PDF]

open access: yesIEEE Internet of Things Journal
The advent of the sixth-generation (6G) of wireless communications has given rise to the necessity to connect vast quantities of heterogeneous wireless devices, which requires advanced system capabilities far beyond existing network architectures. In particular, such massive communication has been recognized as a prime driver that can empower the 6G ...
Derrick Wing Kwan Ng   +2 more
exaly   +5 more sources

Massive MIMO for dynamic spectrum access

2017 IEEE International Conference on Consumer Electronics (ICCE), 2017
This paper proposes the application of massive MIMO, combined with millimeter (mm)-wave technology, in dynamic spectrum access (DSA) systems. In the proposed system, secondary users transmit together with the primary users, while using beamforming to control interference. Simulation results show significant performance gains compared to traditional DSA
openaire   +2 more sources

Near-Optimal Coding for Massive Multiple Access

2021 IEEE International Symposium on Information Theory (ISIT), 2021
We study the Gaussian multiple access channel (MAC) in the asymptotic regime where the number of users grows linearly with the codelength. We analyze coding schemes based on random linear models with approximate message passing (AMP) decoding. For fixed target error rate and number of bits per user, we obtain the exact tradeoff between energy-per-bit ...
Kuan Hsieh   +2 more
openaire   +3 more sources

Federated Learning With Massive Random Access

IEEE Transactions on Wireless Communications
In this paper, we propose an online federated learning framework with massive random access, aiming to learn a sequence of global models using local data that are sequentially collected by massive edge devices. As only a subset of devices is capable of collecting data and performing local model update at any specific moment, the communication pattern ...
Shuhao Xia   +5 more
openaire   +2 more sources

Enabling LPWAN Massive Access: Grant-Free Random Access with Massive MIMO

IEEE Wireless Communications, 2022
Hao Jiang 0030   +5 more
openaire   +1 more source

Massive Multiple Access for 6G

2022
This chapter addresses the connectivity problem between a massive number of intermittently active devices contending for transmission of short uplink packets to a single base station. Such a context, usually referred to as 'massive multiple access', deviates sharply from traditional multiple access due to the extremely large device population size ...
Enrico Paolini   +5 more
openaire   +1 more source

A Data Accessing Method in Distributed Massive Computing

2009 Ninth International Conference on Hybrid Intelligent Systems, 2009
The distributed storage system has evolved from one host infrastructure to distributed environment. It becomes more and more evident for the necessary of the separation of the computing and storage. This paper proposes a universal data accessing method for a distributed computing platform accessing data from different storage systems.
Dadan Zeng, Minqi Zhou, Aoying Zhou
openaire   +1 more source

Coded Categorization in Massive Random Access

2022 IEEE International Symposium on Information Theory (ISIT), 2022
Ryan Song, Kareem M. Attiah, Wei Yu 0001
openaire   +2 more sources

Home - About - Disclaimer - Privacy