English
Related papers

Related papers: Massive Unsourced Random Access Based on Uncoupled…

200 papers

Sparse subspace clustering (SSC) is one of the current state-of-the-art methods for partitioning data points into the union of subspaces, with strong theoretical guarantees. However, it is not practical for large data sets as it requires…

Computer Vision and Pattern Recognition · Computer Science 2019-08-06 Maryam Abdolali , Nicolas Gillis , Mohammad Rahmati

This paper investigates the problem of resource allocation for joint communication and radar sensing system on rate-splitting multiple access (RSMA) based unmanned aerial vehicle (UAV) system. UAV simultaneously communicates with multiple…

Information Theory · Computer Science 2021-07-13 Yuwei Li , Wanli Ni , Hui Tian , Meihui Hua , Shaoshuai Fan

A key challenge of massive MTC (mMTC), is the joint detection of device activity and decoding of data. The sparse characteristics of mMTC makes compressed sensing (CS) approaches a promising solution to the device detection problem.…

Information Theory · Computer Science 2018-06-27 Kamil Senel , Erik G. Larsson

We consider the unsourced random access problem with multiple receivers and propose a cell-free type solution for that. In our proposed scheme, the active users transmit their signals to the access points (APs) distributed in a geographical…

Emerging Technologies · Computer Science 2025-01-20 Mert Ozates , Mohammad Kazemi , Eduard Jorswieck , Deniz Gunduz

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 is a tutorial introduction to the field of unsourced multiple access (UMAC) protocols. We first provide a historical survey of the evolution of random access protocols, focusing specifically on the case in which uncoordinated…

Information Theory · Computer Science 2024-08-20 Gianluigi Liva , Yury Polyanskiy

In the research of next-generation wireless communication technologies, orthogonal time frequency space (OTFS) modulation is emerging as a promising technique for high-speed mobile environments due to its superior efficiency and robustness…

Signal Processing · Electrical Eng. & Systems 2025-04-29 Yanfeng Hu , Dongming Wang , Xinjiang Xia , Jiamin Li , Pengcheng Zhu , Xiaohu You

Motivated by applications in unsourced random access, this paper develops a novel scheme for the problem of compressed sensing of binary signals. In this problem, the goal is to design a sensing matrix $A$ and a recovery algorithm, such…

Information Theory · Computer Science 2021-09-21 Elad Romanov , Or Ordentlich

In this paper we investigate the effect of spatial coupling applied to the recently-proposed coded slotted ALOHA (CSA) random access protocol. Thanks to the bridge between the graphical model describing the iterative interference…

Information Theory · Computer Science 2016-11-17 Gianluigi Liva , Enrico Paolini , Michael Lentmaier , Marco Chiani

Compressive random access (CRA) is a random access scheme that has been considered for massive machine-type communication (MTC) with non-orthogonal spreading sequences, where the notion of compressive sensing (CS) is used for low-complexity…

Information Theory · Computer Science 2019-01-01 Jinho Choi

We consider wireless networks of remote radio heads (RRH) with large antenna-arrays, operated in TDD, with uplink (UL) training and channel-reciprocity based downlink (DL) transmission. To achieve large area spectral efficiencies, we…

Information Theory · Computer Science 2017-01-26 Ozgun Y. Bursalioglu , Chenwei Wang , Haralabos Papadopoulos , Giuseppe Caire

Massive random access is an important technology for achieving ultra-massive connectivity in next-generation wireless communication systems. It aims to address key challenges during the initial access phase, including active user detection…

Information Theory · Computer Science 2026-02-09 Keke Ying , Zhen Gao , Sheng Chen , Tony Q. S. Quek , H. Vincent Poor

The random access scheme is a fundamental scenario in which users transmit through a shared channel and cannot coordinate each other. In recent years, successive interference cancellation (SIC) was introduced into the random access scheme.…

Information Theory · Computer Science 2018-04-16 Tomokazu Emoto , Takayuki Nozaki

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

Recently, a novel coded compressed sensing (CCS) approach was proposed in [1] for dealing with the scalability problem for large sensing matrices in massive machine-type communications. The approach is to divide the compressed sensing (CS)…

Networking and Internet Architecture · Computer Science 2021-09-01 Yi-Jheng Lin , Chia-Ming Chang , Cheng-Shang Chang

Rateless Multiple Access (RMA) is a novel non-orthogonal multiple access framework that is promising for massive access in Internet of Things (IoT) due to its high efficiency and low complexity. In the framework, after certain…

Information Theory · Computer Science 2016-11-17 Zhaoyang Zhang , Xianbin Wang , Yu Zhang , Yan Chen

Compressive sensing is a signal acquisition framework based on the revelation that a small collection of linear projections of a sparse signal contains enough information for stable recovery. In this paper we introduce a new theory for…

Information Theory · Computer Science 2009-01-23 Dror Baron , Marco F. Duarte , Michael B. Wakin , Shriram Sarvotham , Richard G. Baraniuk

This paper considers an uplink massive machine-type communication (mMTC) scenario, where a large number of user devices are connected to a base station (BS). A novel grant-free massive random access (MRA) strategy is proposed, considering…

Information Theory · Computer Science 2021-02-23 Jia-Cheng Jiang , Hui-Ming Wang

The Random Sequential Adsorption (RSA) problem holds crucial theoretical and practical significance, serving as a pivotal framework for understanding and optimizing particle packing in various scientific and technological applications. Here…

Statistical Mechanics · Physics 2024-04-09 G Palacios , A M S Macêdo , Sumanta Kundu , M A F Gomes

The Massive MIMO (multiple-input multiple-output) technology has great potential to manage the rapid growth of wireless data traffic. Massive MIMO achieves tremendous spectral efficiency by spatial multiplexing of many tens of user…

Information Theory · Computer Science 2017-02-14 Emil Björnson , Elisabeth de Carvalho , Jesper H. Sørensen , Erik G. Larsson , Petar Popovski
‹ Prev 1 3 4 5 6 7 10 Next ›