English
Related papers

Related papers: IRSA-based Random Access over the Gaussian Channel

200 papers

Rate-splitting multiple access (RSMA) has emerged as a promising technique for efficient interference management in next-generation wireless networks. While most existing studies focus on downlink and single-cell designs, the modeling and…

Information Theory · Computer Science 2025-12-25 Xinyi Guo , Li You , Qiong Liu , Xiqi Gao , Xiang-Gen Xia

We consider the problem of unsourced random access (U-RA), a grant-free uncoordinated form of random access, in a wireless channel with a massive MIMO base station equipped with a large number $M$ of antennas and a large number of wireless…

Information Theory · Computer Science 2020-05-21 Alexander Fengler , Saeid Haghighatshoar , Peter Jung , Giuseppe Caire

To mitigate the residual interference from imperfect successive interference cancellation (SIC) in Rate-Splitting Multiple Access (RSMA), this paper incorporates improper Gaussian signaling (IGS) into the downlink RSMA framework. Unlike…

Signal Processing · Electrical Eng. & Systems 2026-04-17 Wanting Shi , Hao Cheng , Zhe Li , Yili Xia , Wenjiang Pei

The advent of Machine-to-Machine communication has sparked a new wave of interest to random access protocols, especially in application to LTE Random Access (RA). By analogy with classical slotted ALOHA, state-of-the-art models LTE RA as a…

Information Theory · Computer Science 2018-12-19 Mikhail Vilgelm , Sergio Rueda Linares , Wolfgang Kellerer

We propose a collision recovery scheme for symbol-synchronous slotted ALOHA (SA) based on physical layer network coding over extended Galois Fields. Information is extracted from colliding bursts allowing to achieve higher maximum…

Networking and Internet Architecture · Computer Science 2016-11-17 Giuseppe Cocco , Nader Alagha , Christian Ibars , Stefano Cioni

A multi-level random power transmit strategy that is used in conjunction with a random access protocol (RAP) (e.g. ALOHA, IRSA) is proposed to fundamentally increase the throughput in a distributed communication network. A SIR model is…

Information Theory · Computer Science 2020-10-20 Akshit Kumar , Parikshit Hegde , Rahul Vaze , Amira Alloum , Cédric Adjih

This paper considers the joint channel estimation and device activity detection in the grant-free random access systems, where a large number of Internet-of-Things devices intend to communicate with a low-earth orbit satellite in a sporadic…

Signal Processing · Electrical Eng. & Systems 2022-08-10 Boxiao Shen , Yongpeng Wu , Jianping An , Chengwen Xing , Lian Zhao , Wenjun Zhang

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

This article introduces a novel framework of multi-user detection (MUD) for K-repetition grant-free non-orthogonal multiple access (K-GF-NOMA), called $\alpha$ iterative interference cancellation diversity slotted aloha ($\alpha$-IIC-DSA).…

Information Theory · Computer Science 2024-01-10 Haoran Mei , Limei Peng , Pin-Han Ho

In this letter we motivate the need to revisit the MAC protocol used in Gen2 RFID system in order to leverage receiver structures with Collision Recovery capabilities at the PHY layer. To this end we propose to consider a simple variant of…

Networking and Internet Architecture · Computer Science 2012-09-24 Fabio Ricciato , Paolo Castiglione

In this paper, we design a new polar slotted ALOHA (PSA) protocol over the slot erasure channels, which uses polar coding to construct the identical slot pattern (SP) assembles within each active user and base station. A theoretical…

Information Theory · Computer Science 2020-02-27 Zhijun Zhang , Kai Niu , Jincheng Dai , Chao Dong

In next generation Internet-of-Things, the overhead introduced by grant-based multiple access protocols may engulf the access network as a consequence of the unprecedented number of connected devices. Grant-free access protocols are…

Signal Processing · Electrical Eng. & Systems 2023-05-16 Lorenzo Valentini , Marco Chiani , Enrico Paolini

This article considers the massive MIMO unsourced random access problem on a quasi-static Rayleigh fading channel. Given a fixed message length and a prescribed number of channel uses, the objective is to construct a coding scheme that…

Information Theory · Computer Science 2022-03-09 Michail Gkagkos , Krishna R. Narayanan , Jean-Francois Chamberland , Costas N. Georghiades

A random access scheme for the collision channel without feedback is proposed. The scheme is based on erasure correcting codes for the recovery of packet segments that are lost in collisions, and on successive interference cancellation for…

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

This paper presents finite-blocklength achievability bounds for the Gaussian multiple access channel (MAC) and random access channel (RAC) under average-error and maximal-power constraints. Using random codewords uniformly distributed on a…

Information Theory · Computer Science 2022-05-05 Recep Can Yavas , Victoria Kostina , Michelle Effros

To efficiently utilize the scarce wireless resource, the random access scheme has been attaining renewed interest primarily in supporting the sporadic traffic of a large number of devices encountered in the Internet of Things (IoT). In this…

Information Theory · Computer Science 2024-10-24 Dick Maryopi , Daud Al Adumy , Osman Musa , Peter Jung , Agus Virgono

The employment of intelligent reflecting surfaces (IRSs) is a potential and promising solution to increase the spectral and energy efficiency of wireless communication networks. Despite their many advantages, IRS-aided communications have…

Information Theory · Computer Science 2021-03-26 Constantinos Psomas , Ioannis Krikidis

We consider framed slotted Aloha where $m$ base stations cooperate to decode messages from $n$ users. Users and base stations are placed uniformly at random over an area. At each frame, each user sends multiple replicas of its packet…

Information Theory · Computer Science 2014-01-28 Dusan Jakovetic , Dragana Bajovic , Dejan Vukobratovic , Vladimir Crnojevic

In this paper, we design a novel high-throughput random access scheme for an indoor optical wireless communication (OWC) massive Internet of Things (IoT) scenario. Due to the large density of both IoT devices and OWC access points (APs), we…

Signal Processing · Electrical Eng. & Systems 2020-04-20 Dejan Vukobratovic , Francisco J. Escribano

This article presents a novel transmission scheme for the unsourced, uncoordinated Gaussian multiple access problem. The proposed scheme leverages notions from single-user coding, random spreading, minimum-mean squared error (MMSE)…

Information Theory · Computer Science 2019-11-05 Asit Kumar Pradhan , Vamsi K. Amalladinne , Krishna R. Narayanan , Jean-Francois Chamberland
‹ Prev 1 4 5 6 7 8 10 Next ›