English
Related papers

Related papers: Probabilistic ODMA Receiver with Low-Complexity Al…

200 papers

The core requirement of massive Machine-Type Communication (mMTC) is to support reliable and fast access for an enormous number of machine-type devices (MTDs). In many practical applications, the base station (BS) only concerns the list of…

Information Theory · Computer Science 2022-01-03 Jingze Che , Zhaoyang Zhang , Zhaohui Yang , Xiaoming Chen , Caijun Zhong , Derrick Wing Kwan Ng

This letter proposes a joint pilot and payload power allocation (JPA) scheme to mitigate the error propagation problem for uplink multiple-input multiple-output non-orthogonal multiple access (MIMO-NOMA) systems. A base station equipped…

Information Theory · Computer Science 2018-01-25 Zhiqiang Wei , Derrick Wing Kwan Ng , Jinhong Yuan

In this paper, we consider a massive uncoordinated non-orthogonal multiple access (NOMA) scheme where devices have strict latency requirements and no retransmission opportunities are available. Each device chooses a pilot sequence from a…

Information Theory · Computer Science 2017-07-25 Rana Abbas , Mahyar Shirvanimoghaddam , Yonghui Li , Branka Vucetic

Unsourced random access (URA) is a recently proposed communication paradigm attuned to machine-driven data transfers. In the original URA formulation, all the active devices share the same number of bits per packet. The scenario where…

Information Theory · Computer Science 2021-02-16 Vamsi K. Amalladinne , Allen Hao , Stefano Rini , Jean-Francois Chamberland

The superimposed pilot transmission scheme offers substantial potential for improving spectral efficiency in MIMO-OFDM systems, but it presents significant challenges for receiver design due to pilot contamination and data interference. To…

Information Theory · Computer Science 2025-07-15 Xinjie Li , Xingyu Zhou , Yixiao Cao , Jing Zhang , Chao-Kai Wen , Xiao Li , Shi Jin

We consider unsourced random access (uRA) in a cell-free (CF) user-centric wireless network, where a large number of potential users compete for a random access slot, while only a finite subset is active. The random access users transmit…

Information Theory · Computer Science 2025-05-01 Burak Çakmak , Eleni Gkiouzepi , Manfred Opper , Giuseppe Caire

We investigate an orthogonal frequency-division multiplexing (OFDM)-based downlink transmission scheme for large-scale multi-user (MU) multiple-input multiple-output (MIMO) wireless systems. The use of OFDM causes a high peak-to-average…

Information Theory · Computer Science 2012-09-06 Christoph Studer , Erik G. Larsson

This paper considers a simple on-off random multiple access channel, where n users communicate simultaneously to a single receiver over m degrees of freedom. Each user transmits with probability lambda, where typically lambda n < m << n,…

Information Theory · Computer Science 2009-03-09 Alyson K. Fletcher , Sundeep Rangan , Vivek K Goyal

High-mobility scenarios are becoming increasingly critical in next-generation communication systems. While multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) stands as a prominent technology, its…

Signal Processing · Electrical Eng. & Systems 2025-12-22 Hengyu Zhang , Xuehan Wang , Xu Shi , Jintao Wang , Zhaohui Yang

Sparse code multiple access (SCMA) is one of the most promising methods among all the non-orthogonal multiple access techniques in the future 5G communication. Compared with some other non-orthogonal multiple access techniques such as low…

Signal Processing · Electrical Eng. & Systems 2020-02-28 Fan Wei , Wen Chen

Grant-free random access is promising for massive connectivity with sporadic transmissions in massive machine type communications (mMTC), where the hand-shaking between the access point (AP) and users is skipped, leading to high access…

Information Theory · Computer Science 2023-04-11 Zhengdao Yuan , Fei Liu , Qinghua Guo , Xiaojun Yuan , Zhongyong Wang , Yonghui Li

Wireless random access protocols are attracting a revived research interest as a simple yet effective solution for machine-type communications. In the quest to improve reliability and spectral efficiency of such schemes, the use of multiple…

Information Theory · Computer Science 2019-03-11 Andrea Munari , Federico Clazzer , Gianluigi Liva , Michael Heindlmaier

We propose a novel low-complexity receiver design for multicarrier continuous aperture array (CAPA) systems operating over doubly-dispersive (DD) channels. The receiver leverages a Gaussian Belief Propagation (GaBP)-based framework that…

Signal Processing · Electrical Eng. & Systems 2025-09-30 Kuranage Roche Rayan Ranasinghe , Giuseppe Thadeu Freitas de Abreu , Emil Björnson

The conventional grant-based network relies on the handshaking between base station and active users to achieve dynamic multi-user scheduling, which may cost large signaling overheads as well as system latency. To address those problems,…

Signal Processing · Electrical Eng. & Systems 2017-11-27 Fan Wei , Wen Chen , Yongpeng Wu , Jun Ma , Theodoros A. Tsiftsis

In this work we treat the unsourced random access problem on a Rayleigh block-fading AWGN channel with multiple receive antennas. Specifically, we consider the slowly fading scenario where the coherence block-length is large compared to the…

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

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 consider the problem of type estimation over unsourced multiple access fading channels in distributed multiple-input multiple-output (D-MIMO) systems. Unlike classical unsourced multiple access, type-based unsourced multiple access…

Information Theory · Computer Science 2026-03-03 Kaan Okumus , Khac-Hoang Ngo , Giuseppe Durisi , Erik G. Ström

This article introduces a novel communication paradigm for the unsourced, uncoordinated Gaussian multiple access problem. The major components of the envisioned framework are as follows. The encoded bits of every message are partitioned…

Information Theory · Computer Science 2020-11-23 Asit Pradhan , Vamsi Amalladinne , Avinash Vem , Krishna R. Narayanan , Jean-Francois Chamberland

Non-orthogonal multiple access (NoMA) as an efficient way of radio resource sharing has been identified as a promising technology in 5G to help improving system capacity, user connectivity, and service latency in 5G communications. This…

Information Theory · Computer Science 2018-12-13 Xiangming Meng , Yiqun Wu , Chao Wang , Yan Chen

Orthogonal Frequency Division Multiple Access (OFDMA) as well as other orthogonal multiple access techniques fail to achieve the system capacity limit in the uplink due to the exclusivity in resource allocation. This issue is more prominent…

Information Theory · Computer Science 2017-05-12 Mohammed Al-Imari , Pei Xiao , Muhammad Ali Imran , Rahim Tafazolli