English
Related papers

Related papers: Grant-Free Massive Random Access With a Massive MI…

200 papers

This paper proposes a unified semi-blind detection framework for sourced and unsourced random access (RA), which enables next-generation ultra-reliable low-latency communications (URLLC) with massive devices. Specifically, the active…

Information Theory · Computer Science 2023-03-21 Malong Ke , Zhen Gao , Mingyu Zhou , Dezhi Zheng , Derrick Wing Kwan Ng , H. Vincent Poor

This paper considers an unsourced random access (URA) set-up equipped with a passive reconfigurable intelligent surface (RIS), where a massive number of unidentified users (only a small fraction of them being active at any given time) are…

Information Theory · Computer Science 2024-08-27 Mohammad Javad Ahmadi , Mohammad Kazemi , Tolga M. Duman

Massive random access of devices in the emerging Open Radio Access Network (O-RAN) brings great challenge to the access control and management. Exploiting the bursting nature of the access requests, sparse active user detection (SAUD) is an…

Machine Learning · Computer Science 2023-03-07 Xiao Tang , Sicong Liu , Xiaojiang Du , Mohsen Guizani

With recent advances on the dense low-earth orbit (LEO) constellation, LEO satellite network has become one promising solution to providing global coverage for Internet-of-Things (IoT) services. Confronted with the sporadic transmission…

Information Theory · Computer Science 2020-05-21 Zhaoji Zhang , Ying Li , Chongwen Huang , Qinghua Guo , Lei Liu , Chau Yuen , Yong Liang Guan

In this paper, we propose a novel fully Bayesian approach for the massive multiple-input multiple-output (MIMO) massive unsourced random access (URA). The payload of each user device is coded by the sparse regression codes (SPARCs) without…

Information Theory · Computer Science 2023-06-28 Jia-Cheng Jiang , Hui-Ming Wang

This paper studies the capacity of massive random-access cellular networks, modeled as a MIMO fading channel with an infinite number of interfering cells. To characterize the symmetric sum rate of the network, a random-coding argument is…

Information Theory · Computer Science 2025-09-26 Grace Villacrés , Tobias Koch , Gonzalo Vazquez-Vilar

The spatial diversity and multiplexing advantages of massive multi-input-multi-output (mMIMO) can significantly improve the capacity of massive non-orthogonal multiple access (NOMA) in machine type communications. However, state-of-the-art…

Signal Processing · Electrical Eng. & Systems 2025-02-17 Yueqing Wang , Yikun Mei , Zhen Gao , Ziwei Wan , Boyu Ning , De Mi , Sami Muhaidat

Grant-free transmission is an important feature to be supported by future wireless networks since it reduces the signalling overhead caused by conventional grant-based schemes. However, for grant-free transmission, the number of users…

Information Theory · Computer Science 2018-12-20 Zhiguo Ding , Robert Schober , Pingzhi Fan , H. Vincent Poor

In this work, we present the design for both pilot-uncoupled and pilot-free on-off multiple access (ODMA) receivers in unsourced random access (URA) for multiple-input multiple-output (MIMO) systems. Unlike pilot-coupled ODMA, where on-off…

Information Theory · Computer Science 2025-05-26 Zhentian Zhang , Jian Dang , Zaichen Zhang

In the massive machine-type communication (mMTC) scenario, a large number of devices with sporadic traffic need to access the network on limited radio resources. While grant-free random access has emerged as a promising mechanism for…

Signal Processing · Electrical Eng. & Systems 2023-04-13 Xinyu Bian , Yuyi Mao , Jun Zhang

We extend the seminal work by Polyanskiy (2017) on massive uncoordinated access to the case where the number of active users is random and unknown a priori. We define a random-access code accounting for both misdetection (MD) and false…

Information Theory · Computer Science 2022-02-15 Khac-Hoang Ngo , Alejandro Lancho , Giuseppe Durisi , Alexandre Graell i Amat

Unsourced random access (URA) has emerged as a candidate paradigm for massive machine-type communication (MTC) in next-generation wireless networks. While many excellent uplink schemes have been developed for URA, these schemes do not…

Information Theory · Computer Science 2022-06-06 Jamison R. Ebert , Krishna R. Narayanan , Jean-Francois Chamberland

In Sequential Massive Random Access (SMRA), a set of correlated sources is jointly encoded and stored on a server, and clients want to access to only a subset of the sources. Since the number of simultaneous clients can be huge, the server…

Information Theory · Computer Science 2018-01-18 Elsa Dupraz , Thomas Maugey , Aline Roumy , Michel Kieffer

Uplink (UL) dominated sporadic transmission and stringent latency requirement of massive machine type communication (mMTC) forces researchers to abandon complicated grant-acknowledgment based legacy networks. UL grant-free non-orthogonal…

Signal Processing · Electrical Eng. & Systems 2020-10-02 Shah Mahdi Hasan , Kaushik Mahata , Md Mashud Hyder

The Internet of Things (IoT) enables smart cities to achieve the vision of connecting everything by smartly linking gadgets without the need for human interaction. However, due to the rapid proliferation of IoT devices, the amount of data…

Signal Processing · Electrical Eng. & Systems 2022-08-26 Muhammad Waleed Aftab , Ishtiaq Ahmad

Future wireless networks need to support massive machine type communication (mMTC) where a massive number of devices accesses the network and massive MIMO is a promising enabling technology. Massive access schemes have been studied for…

Information Theory · Computer Science 2021-12-01 Unnikrishnan Kunnath Ganesan , Emil Björnson , Erik G. Larsson

The multiple access channel (MAC) with many-user is a general model for massive machine type communications. In this paradigm, the number of users may be comparable or even larger than the coding blocklength $n$. In contrast, classical MAC…

Information Theory · Computer Science 2019-08-12 Fan Wei , Yongpeng Wu , Wen Chen , Yanlin Geng , Giuseppe Caire

In this letter, we extend the sparse Kronecker-product (SKP) coding scheme, originally designed for the additive white Gaussian noise (AWGN) channel, to multiple input multiple output (MIMO) unsourced random access (URA). With the SKP…

Signal Processing · Electrical Eng. & Systems 2022-08-16 Zeyu Han , Xiaojun Yuan , Chongbin Xu , Xin Wang

In this paper, we explore an efficient uncoupled unsourced random access (UURA) scheme for 6G massive communication. UURA is a typical framework of unsourced random access that addresses the problems of codeword detection and message…

Information Theory · Computer Science 2024-05-07 Feiyan Tian , Xiaoming Chen , Chongwen Huang , Zhaoyang Zhang

We study a delay-constrained grant-free random access system with a multi-antenna base station. The users randomly generate data packets with expiration deadlines, which are then transmitted from data queues on a first-in first-out basis.…

Information Theory · Computer Science 2024-10-23 Jianan Bai , Zheng Chen , Erik. G. Larsson
‹ Prev 1 3 4 5 6 7 10 Next ›