English
Related papers

Related papers: Soft Interference Cancellation for Random Coding i…

200 papers

The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem that is gaining relevance thanks to emerging applications in wireless communication networks. In this paper, we…

Information Theory · Computer Science 2019-03-12 Mustafa Cemil Coşkun , Giuseppe Durisi , Thomas Jerkovits , Gianluigi Liva , William Ryan , Brian Stein , Fabian Steiner

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

Minimum power required to achieve a distortion-noise profile, i.e., a function indicating the maximum allowed distortion value for each noise level, is studied for the transmission of Gaussian sources over Gaussian channels under a regime…

Information Theory · Computer Science 2020-01-22 Mohammadamin Baniasadi , Ertem Tuncel

Through refined asymptotic analysis based on the normal approximation, we study how higher-order coding performance depends on the mean power as well as on finer statistics of the input power. We introduce a multifaceted power model in…

Information Theory · Computer Science 2026-05-13 Adeel Mahmood , Aaron B. Wagner

We consider the Gaussian interference channel with an intermediate relay as a main building block for cooperative interference networks. On the achievability side, we consider compress-and-forward based strategies. Specifically, a…

Information Theory · Computer Science 2015-03-18 Ye Tian , Aylin Yener

This paper considers a general framework for massive random access based on sparse superposition coding. We provide guidelines for the code design and propose the use of constant-weight codes in combination with a dictionary design based on…

Information Theory · Computer Science 2022-07-27 Patrick Agostini , Zoran Utkovski , Alexis Decurninge , Maxime Guillaud , Slawomir Stanczak

We consider the arbitrarily varying Gaussian relay channel with sender frequency division. We determine the random code capacity, and establish lower and upper bounds on the deterministic code capacity. It is observed that when the channel…

Information Theory · Computer Science 2018-06-01 Uzi Pereg , Yossef Steinberg

Traditional communication theory focuses on minimizing transmit power. However, communication links are increasingly operating at shorter ranges where transmit power can be significantly smaller than the power consumed in decoding. This…

Information Theory · Computer Science 2011-02-17 Pulkit Grover , Kristen Ann Woyach , Anant Sahai

Randomized backoff protocols, such as exponential backoff, are a powerful tool for managing access to a shared resource, often a wireless communication channel (e.g., [1]). For a wireless device to transmit successfully, it uses a backoff…

Data Structures and Algorithms · Computer Science 2022-07-26 Michael A. Bender , Seth Gilbert , Fabian Kuhn , John Kuszmaul , Muriel Médard

The lower bound on the decoding error probability for the optimal code given a signal-to-noise ratio and a code rate are investigated in this letter for the reconfigurable intelligent surface (RIS) communication system over a Rician fading…

Information Theory · Computer Science 2023-06-28 Likun Sui , Zihuai Lin

We investigate Gaussian widely linear precoding known as improper Gaussian signaling for the cellular uplink with inter-cell interference, known as interference multiple access channel (IMAC). This transmission scheme provides extra degrees…

Information Theory · Computer Science 2018-05-31 Ali Kariminezhad , Stefan Roth , Aydin Sezgin , Anas Chaaban

We study the capacity of discrete memoryless many-to-one interference channels, i.e., K user interference channels where only one receiver faces interference. For a class of many-to-one interference channels, we identify a noisy…

Information Theory · Computer Science 2009-12-17 Viveck R. Cadambe , Syed A. Jafar

We obtain new outer bounds on the capacity regions of the two-user multiple access channel with generalized feedback (MAC-GF) and the two-user interference channel with generalized feedback (IC-GF). These outer bounds are based on the idea…

Information Theory · Computer Science 2016-11-18 Ravi Tandon , Sennur Ulukus

A multiple access channel and a point-to-point channel sharing the same medium for communications are considered. We obtain an outer bound for the capacity region of this setup, and we show that this outer bound is achievable in some cases.…

Information Theory · Computer Science 2010-11-01 Anas Chaaban , Aydin Sezgin

We present a natural and low-complexity technique for achieving the capacity of the Gaussian relay network in the high SNR regime. Specifically, we propose the use of end-to-end structured lattice codes with the amplify-and-forward…

Information Theory · Computer Science 2013-09-17 Yun Xu , Edmund Yeh , Muriel Medard

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

To account for the massive uncoordinated random access scenario, which is relevant for the Internet of Things, Polyanskiy (2017) proposed a novel formulation of the multiple-access problem, commonly referred to as unsourced multiple access,…

Information Theory · Computer Science 2023-02-23 Khac-Hoang Ngo , Alejandro Lancho , Giuseppe Durisi , Alexandre Graell i Amat

Future wireless access networks aim to simultaneously support a large number of devices with heterogeneous service requirements, including data rates, error rates, and latencies. While achievable rate and capacity results exist for Gaussian…

Information Theory · Computer Science 2022-06-15 Pin-Hsun Lin , Shih-Chun Lin , Peng-Wei Chen , Marcel Mross , Eduard A. Jorswieck

This paper adds to the understanding of the capacity region of the Gaussian interference channel. To this end, the capacity region of the one-sided Gaussian interference channel is first fully characterized. This is accomplished by…

Information Theory · Computer Science 2015-09-22 Mojtaba Vaezi , H. Vincent Poor

We analyze the performance of a system composed of two interfering point-to-point links where the transmitters can exploit a common relay to improve their individual transmission rate. When the relay uses the amplify-and-forward protocol we…

Information Theory · Computer Science 2009-04-20 Brice Djeumou , Elena Veronica Belmega , Samson Lasaulce