English
Related papers

Related papers: Unsourced Random Access with Threshold$-$Based Fee…

200 papers

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

In all applications in digital communications, it is crucial for an estimator to be unbiased. Although so-called soft feedback is widely employed in many different fields of engineering, typically the biased estimate is used. In this paper,…

Information Theory · Computer Science 2018-02-21 Susanne Sparrer , Robert F. H. Fischer

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

The future wireless networks envision ultra-reliable communication with efficient use of the limited wireless channel resources. Closed-loop repetition protocols where retransmission of a packet is enabled using a feedback channel has been…

Information Theory · Computer Science 2017-10-03 Saeed R. Khosravirad , Harish Viswanathan

In this paper, we study and analyze cognitive radio networks in which secondary users (SUs) are equipped with Energy Harvesting (EH) capability. We design a random spectrum sensing and access protocol for the SU that exploits the primary…

Information Theory · Computer Science 2014-06-25 Mahmoud Ashour , Ahmed El Shafie , Amr Mohamed , Tamer Khattab

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

We consider a scalable user-centric cell-free massive MIMO network with distributed remote radio units (RUs), enabling macrodiversity and joint processing. Due to the limited uplink (UL) pilot dimension, multiuser interference in the UL…

Information Theory · Computer Science 2022-06-09 Fabian Göttsch , Noboru Osawa , Takeo Ohseki , Kosuke Yamazaki , Giuseppe Caire

Cell-Free Massive MIMO systems aim to expand the coverage area of wireless networks by replacing a single high-performance Access Point (AP) with multiple small, distributed APs connected to a Central Processing Unit (CPU) through a…

Information Theory · Computer Science 2023-11-13 Michail Gkagkos , Jean-Francois Chamberland , Costas N. Georghiades , Krishna R. Narayanan

We study the effects of introducing a feedback channel in the erasure source-broadcast problem for the case of three receivers. In our problem formulation, we wish to transmit a binary source to three users over the erasure broadcast…

Information Theory · Computer Science 2021-05-04 Louis Tan , Kaveh Mahdaviani , Ashish Khisti Member

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

A high success rate of grant-free random access scheme is proposed to support massive access for machine-to-machine communications in massive multipleinput multiple-output systems. This scheme allows active user equipments (UEs) to transmit…

Information Theory · Computer Science 2020-12-29 Huimei Han , Lushun Fang , Weidang Lu , Wenchao Zhai , Ying Li , Jun Zhao

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

This paper proposes a unified semi-blind detection framework for sourced and unsourced random access (RA), which enables next-generation ultra-reliable low-latency communications (URLLC) with massive devices. Specifically, the active…

Information Theory · Computer Science 2023-03-21 Malong Ke , Zhen Gao , Mingyu Zhou , Dezhi Zheng , Derrick Wing Kwan Ng , H. Vincent Poor

In this paper, a downlink communication system, in which a Base Station (BS) equipped with $M$ antennas communicates with $N$ users each equipped with $K$ receive antennas, is considered. An efficient suboptimum algorithm is proposed for…

Information Theory · Computer Science 2007-07-13 Alireza Bayesteh , Amir Keyvan Khandani

The paper treats uplink scenario where M user equipments (UEs) send to a Base Station (BS), possibly via a common Relay Station (RS) that is equipped with a buffer. This is a multiple-access relay channel (MARC) aided by a buffer. We devise…

Information Theory · Computer Science 2016-11-17 Rongkuan Liu , Petar Popovski , Gang Wang

Novel bitwise retransmission schemes are devised which retransmit only the bits received with small reliability. The retransmissions are used to accumulate the reliabilities of individual bits. Unlike the conventional automatic repeat…

Information Theory · Computer Science 2017-08-01 Mohamed A. M. Hassanien , Pavel Loskot , Salman M. Al-Shehri , Tolga Numanoglu , Mehmet Mert

The tremendous capacity gains promised by space division multiple access (SDMA) depend critically on the accuracy of the transmit channel state information. In the broadcast channel, even without any network interference, it is known that…

Information Theory · Computer Science 2016-11-17 Marios Kountouris , Jeffrey G. Andrews

Unsourced random access is a novel communication paradigm designed for handling a large number of uncoordinated users that sporadically transmit very short messages. Under this model, coded compressed sensing (CCS) has emerged as a…

Information Theory · Computer Science 2021-07-22 Jamison R. Ebert , Vamsi K. Amalladinne , Stefano Rini , Jean-Francois Chamberland , Krishna R. Narayanan

Narrow beams are key to wireless communications in millimeter wave frequency bands. Beam alignment (BA) allows the base station (BS) to adjust the direction and width of the beam used for communication. During BA, the BS transmits a number…

Information Theory · Computer Science 2021-02-05 Abbas Khalili , Shahram Shahsavari , Mohammad A. Amir Khojastepour , Elza Erkip

We propose an improvement of the random spreading approach with polar codes for unsourced multiple access. Each user encodes its message by a polar code, and the coded bits are then spread using a random spreading sequence. The proposed…

Information Theory · Computer Science 2021-08-30 Mohammad Javad Ahmadi , Tolga M. Duman