English
Related papers

Related papers: Joint Message Detection and Channel Estimation for…

200 papers

The requirements to support massive connectivity and low latency in massive Machine Type Communications (mMTC) bring a huge challenge in the design of its random access (RA) procedure, which usually calls for efficient joint active user…

Information Theory · Computer Science 2019-06-26 Jue Wang , Zhaoyang Zhang , Lajos Hanzo

Unsourced random-access (U-RA) is a type of grant-free random access with a virtually unlimited number of users, of which only a certain number $K_a$ are active on the same time slot. Users employ exactly the same codebook, and the task of…

Information Theory · Computer Science 2021-12-10 Alexander Fengler , Peter Jung , Giuseppe Caire

In this paper, we investigate the performance of cell-free massive MIMO systems with massive connectivity. With the generalized approximate message passing (GAMP) algorithm, we obtain the minimum mean-squared error (MMSE) estimate of the…

Information Theory · Computer Science 2021-05-17 Mangqing Guo , M. Cenk Gursoy

This paper investigates the unsourced random access (URA) problem with a massive multiple-input multiple-output receiver that serves wireless devices in the near-field of radiation. We employ an uncoupled transmission protocol without…

Information Theory · Computer Science 2024-01-26 Xinyu Xie , Yongpeng Wu , Jianping An , Derrick Wing Kwan Ng , Chengwen Xing , Wenjun Zhang

This paper studies randomly spread code-division multiple access (CDMA) and multiuser detection in the large-system limit using the replica method developed in statistical physics. Arbitrary input distributions and flat fading are…

Information Theory · Computer Science 2007-07-13 Dongning Guo , Sergio Verdu

Unsourced random-access (U-RA) is a type of grant-free random access with a virtually unlimited number of users, of which only a certain number $K_a$ are active on the same time slot. Users employ exactly the same codebook, and the task of…

Information Theory · Computer Science 2021-01-11 Alexander Fengler , Peter Jung , Giuseppe Caire

This paper investigates the issue of cooperative activity detection for grant-free random access in the sixth-generation (6G) cell-free wireless networks with sourced and unsourced paradigms. First, we propose a cooperative framework for…

Information Theory · Computer Science 2020-11-23 Xiaodan Shao , Xiaoming Chen , Derrick Wing Kwan Ng , Caijun Zhong , Zhaoyang Zhang

To account for the massive uncoordinated random access scenario, which is relevant for the Internet of Things, Polyanskiy (2017) proposed a novel formulation of the multiple-access problem, commonly referred to as unsourced multiple access,…

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

Grant-free transmission and cell-free communication are vital in improving coverage and quality-of-service for massive machine-type communication. This paper proposes a novel framework of joint active user detection, channel estimation, and…

Signal Processing · Electrical Eng. & Systems 2025-02-20 Gangle Sun , Mengyao Cao , Wenjin Wang , Wei Xu , Christoph Studer

We examine unsourced random access in a fully asynchronous setup, where active users transmit their data without restriction on the start time over a fading channel. In the proposed scheme, the transmitted signal consists of a pilot…

Information Theory · Computer Science 2025-12-23 Mert Ozates , Mohammad Kazemi , Gianluigi Liva , Deniz Gündüz

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

Information Theory · Computer Science 2016-11-15 Zheng Wang , Jie Luo

Unsourced random access (URA) is an increasingly popular communication paradigm attuned to machine driven data transfers in \textit{Internet-of-Things} (IoT) networks. In a typical URA setting, a small subset of active devices within a very…

Information Theory · Computer Science 2021-05-06 Vamsi K. Amalladinne , Jean-Francois Chamberland , Krishna R. Narayanan

Massive Machine-Type Communications (mMTC) features a massive number of low-cost user equipments (UEs) with sparse activity. Tailor-made for these features, grant-free random access (GF-RA) serves as an efficient access solution for mMTC.…

Information Theory · Computer Science 2023-05-18 Zhaoji Zhang , Yuhao Chi , Qinghua Guo , Ying Li , Guanghui Song , Chongwen Huang

We investigate the asynchronous multiple user access communication in optical wireless scattering communication, where different users transmit signals without perfect alignment in the time domain. Firstly, we characterize the received…

Signal Processing · Electrical Eng. & Systems 2019-01-23 Guanchu Wang , Chen Gong , Zhimeng Jiang , Zhengyuan Xu

In this paper, we investigate unsourced random access for massive machine-type communications (mMTC) in the sixth-generation (6G) wireless networks. Firstly, we establish a high-efficiency uncoupled framework for massive unsourced random…

Information Theory · Computer Science 2024-05-07 Feiyan Tian , Xiaoming Chen , Yong Liang Guan , Chau Yuen

The performance of grant-free random access (GF-RA) is limited by the number of accessible random access resources (RRs) due to the absence of collision resolution. Compressive sensing (CS)-based RA schemes scale up the RRs at the expense…

Information Theory · Computer Science 2021-03-23 Ameha Tsegaye Abebe , Chung G. Kang

The cell-free massive multiple-input multiple-output (CF-mMIMO) systems are crucial for 6G development due to their high spectral efficiency and uniform user-experienced data rates. A key aspect of CF-mMIMO is user association (UA) and…

Signal Processing · Electrical Eng. & Systems 2025-08-28 Ahmed Naeem , El Mehdi Amhoud , Hüseyin Arslan

This work considers the problem of integrated sensing and communications (ISAC) with a massive number of unsourced and uncoordinated users. In the proposed model, known as the unsourced ISAC system (UNISAC), all active communication and…

Information Theory · Computer Science 2026-04-21 Mohammad Javad Ahmadi , Rafael F. Schaefer , H. Vincent Poor

This paper investigates asynchronous multiple-input multiple-output (MIMO) massive unsourced random access (URA) in an orthogonal frequency division multiplexing (OFDM) system over frequency-selective fading channels, with the presence of…

Information Theory · Computer Science 2024-10-24 Tianya Li , Yongpeng Wu , Junyuan Gao , Wenjun Zhang , Xiang-Gen Xia , Derrick Wing Kwan Ng , Chengshan Xiao

To realize orthogonal frequency division multiplexing (OFDM)-based grant-free access for wideband systems under frequency-selective fading, existing device activity detection and channel estimation methods need substantial accuracy…

Information Theory · Computer Science 2025-08-12 Zhiyan Li , Ying Cui , Danny H. K. Tsang