English
Related papers

Related papers: Fully Asynchronous Unsourced Random Access over Fa…

200 papers

A Han-Kobayashi based achievable scheme is presented for ergodic fading two-user Gaussian interference channels (IFCs) with perfect channel state information at all nodes and Gaussian codebooks with no time-sharing. Using max-min…

Information Theory · Computer Science 2010-01-19 Lalitha Sankar , Elza Erkip , H. Vincent Poor

This paper concerns the transmission of two independent Gaussian sources over a two-user decentralized interference channel, assuming that the transmitters are unaware of the instantaneous CSIs. The availability of the channel state…

Signal Processing · Electrical Eng. & Systems 2017-12-21 Mohammadreza Darabi

In this paper, we study grant-free, asynchronous control-to-control (C2C) communications in an indoor scenario with a shared wireless channel. Each communication node transmits command units, each consisting of a variable-length low-density…

Information Theory · Computer Science 2026-05-13 Massimo Battaglioni , Edoardo Carnevali , Dania De Crescenzo , Enrico Testi , Marco Baldi , Enrico Paolini

In this paper, we consider a two-user multiple access fading channel under quality-of-service (QoS) constraints. We initially formulate the transmission rates for both transmitters, where the transmitters have arbitrarily distributed input…

Information Theory · Computer Science 2016-08-08 Marwan Hammouda , Sami Akin , Jürgen Peissig

Lossy transmission over a relay channel in which the relay has access to correlated side information is considered. First, a joint source-channel decode-and-forward scheme is proposed for general discrete memoryless sources and channels.…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , Elza Erkip , Andrea J. Goldsmith , H. Vincent Poor

Communications in highly dynamic channels relying on training-based channel estimation experience a trade-off between increasing channel measurement accuracy by sending more frequent training sequences and increasing data rate by sending…

Information Theory · Computer Science 2026-05-04 Duschia Bodet , Muriel Médard , Muralidhar Rangaswamy , Ken Duffy

We consider a classical multiple access system with a single transmission channel, finite number of users (users), and randomized transmission protocol (ALOHA). We assume that every user sends messages to the base station with various…

Information Theory · Computer Science 2022-05-04 Dmitriy Kim , Georgi Georgiev , Natalya Markovskaya

Zero-delay transmission of a Gaussian source over an additive white Gaussian noise (AWGN) channel is considered with a one-bit analog-to-digital converter (ADC) front end and a correlated side information at the receiver. The design of the…

Information Theory · Computer Science 2019-12-18 Morteza Varasteh , Borzoo Rassouli , Osvaldo Simeone , Deniz Gunduz

We consider a system in which two nodes take correlated measurements of a random source with time-varying and unknown statistics. The observations of the source at the first node are to be losslessly replicated with a given probability of…

Information Theory · Computer Science 2016-10-27 Fangzhou Chen , Bin Li , Can Emre Koksal

A broadcast strategy for multiple access communication over slowly fading channels is introduced, in which the channel state information is known to only the receiver. In this strategy, the transmitters split their information streams into…

Information Theory · Computer Science 2017-12-27 Samia Kazemi , Ali Tajer

Traditionally, the capacity region of a coherent fading multiple access channel (MAC) is analyzed in two popular contexts. In the first, a centralized system with full channel state information at the transmitters (CSIT) is assumed, and the…

Information Theory · Computer Science 2014-09-17 Sreejith Sreekumar , Bikash K. Dey , Sibi Raj B. Pillai

The A-channel is a noiseless multiple access channel in which users simultaneously transmit Q-ary symbols and the receiver observes the set of transmitted symbols, but not their multiplicities. An A-channel is said to be unsourced if,…

Information Theory · Computer Science 2023-12-06 William W. Zheng , Jamison R. Ebert , Stefano Rini , Jean-Francois Chamberland

Demodulation in a random multiple access channel is considered where the signals are chosen uniformly randomly with unit energy, a model applicable to several modern transmission systems. It is shown that by lifting (replicating) the graph…

Information Theory · Computer Science 2015-03-19 Christian Schlegel , Dmitri Truhachev

A low-complexity coding scheme is developed to achieve the rate region of maximum likelihood decoding for interference channels. As in the classical rate-splitting multiple access scheme by Grant, Rimoldi, Urbanke, and Whiting, the proposed…

Information Theory · Computer Science 2017-01-11 Lele Wang , Young-Han Kim , Chiao-Yi Chen , Hosung Park , Eren Sasoglu

User cooperation is a well-known approach to achieve diversity without multiple antennas, however at the cost of inevitable loss of rate mostly due to the need of additional channels for relaying. A new collaborative diversity scheme is…

Information Theory · Computer Science 2011-03-01 Indu Shakya , Falah H. Ali , Elias Stipidis

We present finite-blocklength achievability bounds for the unsourced A-channel. In this multiple-access channel, users noiselessly transmit codewords picked from a common codebook with entries generated from a $q$-ary alphabet. At each…

Information Theory · Computer Science 2022-10-06 Alejandro Lancho , Alexander Fengler , Yury Polyanskiy

Sparse regression codes with approximate message passing (AMP) decoding have gained much attention in recent times. The concepts underlying this coding scheme extend to unsourced access with coded compressed sensing (CCS), as first pointed…

Information Theory · Computer Science 2020-01-14 Vamsi K. Amalladinne , Asit Kumar Pradhan , Cynthia Rush , Jean-Francois Chamberland , Krishna R. Narayanan

We consider a basic joint communication and sensing setup comprising a transmitter, a receiver and a sensor. The transmitter sends a codeword to the receiver through a discrete memoryless channel, and the receiver is interested in decoding…

Information Theory · Computer Science 2024-12-09 Han Wu , Hamdi Joudeh

The use of channel output feedback to improve the reliability of fading channels has received scant attention in the literature. In most work on feedback for fading channels, only channel state information (CSI) feedback has been exploited…

Information Theory · Computer Science 2012-04-12 Mayur Agrawal , David J. Love , Venkataramanan Balakrishnan

A sensor observes a random phenomenon and transmits updates about the observed phenomenon to a remote monitor. The sensor may experience intermittent failures in which case the monitor will not receive any updates until the sensor has…

Information Theory · Computer Science 2023-08-30 Ismail Cosandal , Sennur Ulukus