English
Related papers

Related papers: Design and Performance of Enhanced Spread Spectrum…

200 papers

Massive communication is one of key scenarios of 6G where two magnitude higher connection density would be required to serve diverse services. As a promising direction, unsourced multiple access has been proved to outperform significantly…

Information Theory · Computer Science 2024-11-18 Yifei Yuan , Yuhong Huang , Chunlin Yan , Sen Wang , Shuai Ma , Xiaodong Shen

We consider a frame asynchronous coded slotted ALOHA (FA-CSA) system for uncoordinated multiple access, where users join the system on a slot-by-slot basis according to a Poisson random process and, in contrast to standard frame synchronous…

Information Theory · Computer Science 2016-11-29 Erik Sandgren , Alexandre Graell i Amat , Fredrik Brännström

This paper addresses the unsourced/uncoordinated random access problem in an integrated sensing and communications (ISAC) system, with a focus on uplink multiple access code design. Recent theoretical advancements highlight that an ISAC…

Information Theory · Computer Science 2025-04-25 Zhentian Zhang , Jian Dang , Kai-Kit Wong , Zaichen Zhang , Christos Masouros

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 this work, we discuss the problem of unsourced random access (URA) over a Gaussian multiple access channel (GMAC). To address the challenges posed by emerging massive machine-type connectivity, URA reframes multiple access as a…

Information Theory · Computer Science 2025-05-06 Zhentian Zhang , Mohammad Javad Ahmadi , Jian Dang , Kai-Kit Wong , Zaichen Zhang , Christos Masouros

We present an unsourced multiple access (UMAC) scheme tailored to high-mobility wireless channels. The proposed construction is based on orthogonal time frequency space (OTFS) modulation and sparse interleaver division multiple access…

Signal Processing · Electrical Eng. & Systems 2026-01-21 Davide Bergamasco , Federico Clazzer , Paolo Casari

This paper investigates the unsourced random access (URA) problem for integrated sensing and commutations (ISAC). Recent results reveal that conventional multiple access strategies for ISAC such as treating interference as noise (TIN) and…

Information Theory · Computer Science 2025-09-22 Zhentian Zhang , Kai-Kit Wong , Jian Dang , Zaichen Zhang , Chan-Byoung Chae

An asynchronous $\ka$-active-user unsourced multiple access channel (AUMAC) is a key model for uncoordinated massive access in future networks. We focus on a scenario where each transmission is subject to the maximal delay constraint…

Information Theory · Computer Science 2025-01-28 Jyun-Sian Wu , Pin-Hsun Lin , Marcel A. Mross , Eduard A. Jorswieck

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

In this paper, we review the key figures of merit to assess the performance of advanced random access (RA) schemes exploiting physical layer coding, repetitions and collision resolution techniques. We then investigate RA modeling aspects…

Information Theory · Computer Science 2018-01-22 Alberto Mengali , Riccardo De Gaudenzi , Cedomir Stefanovic

We investigate fully asynchronous unsourced random access (URA), and propose a high-performing scheme that employs on-off division multiple access (ODMA). In this scheme, active users distribute their data over the transmit block based on a…

Signal Processing · Electrical Eng. & Systems 2025-04-16 Mert Ozates , Mohammad Kazemi , Gianluigi Liva , Deniz Gündüz

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, a simple variation of classical Slotted Aloha is introduced and analyzed. The enhancement relies on adding multiple receivers that gather different observations of the packets transmitted by a user population in one slot. For…

Networking and Internet Architecture · Computer Science 2014-01-16 Andrea Munari , Michael Heindlmaier , Gianluigi Liva , Matteo Berioli

In this paper, we investigate high-altitude platform station (HAPS) wireless networks for simultaneous non-orthogonal unicast and multicast transmissions. Specifically, stacked intelligent metasurface (SIM)-based wave-domain beamforming is…

Signal Processing · Electrical Eng. & Systems 2026-04-07 Ngoc Phuc Le , Mohamed-Slim Alouini

To relieve the traffic burden and improve the system capacity, licensed-assisted access (LAA) has been becoming a promising technology to the supplementary utilization of the unlicensed spectrum. However, due to the densification of small…

Signal Processing · Electrical Eng. & Systems 2018-02-07 Yu Gu , Qimei Cui , Yue Wang , Somayeh Soleimani

Due to the increasing demand on user data rates, future wireless communication networks require higher spectral efficiency. To reach higher spectral efficiencies, wireless network technologies collaborate and construct a seamless…

Information Theory · Computer Science 2015-08-11 Young Jin Chun , Aymen Omri , Mazen O. Hasna

In this paper, we introduce Multi-Slots Coded ALOHA (MuSCA) as a multiple random access method for satellite communications. This scheme can be considered as a generalization of the Contention Resolution Diversity Slotted Aloha (CRDSA)…

Information Theory · Computer Science 2015-03-19 Huyen-Chi Bui , Jérôme Lacan , Marie-Laure Boucheret

We address the problem of uncoordinated massive random-access in the Gaussian multiple access channel (MAC). The performance of low-complexity T-fold irregular repetition slotted ALOHA (IRSA) scheme is investigated and achievability bounds…

Information Theory · Computer Science 2018-11-20 Anton Glebov , Nikolay Matveev , Kirill Andreev , Alexey Frolov , Andrey Turlikov

This paper investigates the unsourced random access (URA) scheme to accommodate numerous machine-type users communicating to a base station equipped with multiple antennas. Existing works adopt a slotted transmission strategy to reduce…

Information Theory · Computer Science 2022-02-17 Xinyu Xie , Yongpeng Wu , Jianping An , Junyuan Gao , Wenjun Zhang , Chengwen Xing , Kai-Kit Wong , Chengshan Xiao

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
‹ Prev 1 2 3 10 Next ›