English
Related papers

Related papers: Energy Efficiency of Unsourced Random Access over …

200 papers

In this work, lossy distributed compression of pairs of correlated sources is considered. Conventionally, Shannon's random coding arguments -- using randomly generated unstructured codebooks whose blocklength is taken to be asymptotically…

Information Theory · Computer Science 2020-10-21 Farhad Shirani , S. Sandeep Pradhan

In this paper we provide an achievable rate region for the discrete memoryless multiple access channel with correlated state information known non-causally at the encoders using a random binning technique. This result is a generalization of…

Information Theory · Computer Science 2008-12-31 Tal Philosof , Ram Zamir , Uri Erez

A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-rate capacity for noisy interference as defined in this…

Information Theory · Computer Science 2016-11-18 Xiaohu Shang , Gerhard Kramer , Biao Chen

Bayesian optimization has been successfully applied to optimize black-box functions where the number of evaluations is severely limited. However, in many real-world applications, it is hard or impossible to know in advance which designs are…

In this paper, pilot-assisted transmission over Gauss-Markov Rayleigh fading channels is considered. A simple scenario, where a single pilot signal is transmitted every T symbols and T-1 data symbols are transmitted in between the pilots,…

Information Theory · Computer Science 2016-11-17 Sami Akin , Mustafa Cenk Gursoy

A new problem formulation is presented for the Gaussian interference channels (GIFC) with two pairs of users, which are distinguished as primary users and secondary users, respectively. The primary users employ a pair of encoder and decoder…

Information Theory · Computer Science 2016-11-17 Xiujie Huang , Xiao Ma , Lei Lin , Baoming Bai

We characterize the symmetric capacity to within 1.7075 bits/s/Hz for the two-user Gaussian interference channel with feedback. The result makes use of a deterministic model to provide insights into the Gaussian channel. We derive a new…

Information Theory · Computer Science 2009-01-26 Changho Suh , David Tse

The paper derives the theoretical Cramer-Rao lower bound for parameter estimation of a source (of emitting energy, gas, aerosol), monitored by a network of sensors providing binary measurements. The theoretical bound is studied in the…

Applications · Statistics 2014-05-30 Branko Ristic , Ajith Gunatilaka , Ralph Gailis

Bayesian optimization (BO) based on Gaussian process models is a powerful paradigm to optimize black-box functions that are expensive to evaluate. While several BO algorithms provably converge to the global optimum of the unknown function,…

Machine Learning · Statistics 2019-04-03 Felix Berkenkamp , Angela P. Schoellig , Andreas Krause

In a bi-directional relay channel, a pair of nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of relays. Recent work has mostly considered information theoretic limits of the…

Information Theory · Computer Science 2010-02-02 Sang Joon Kim , Besma Smida , Natasha Devroye

This paper considers a random access system where each sender can be in two modes of operation, active or not active, and where the set of active users is available to a common receiver only. Active transmitters encode data into independent…

Information Theory · Computer Science 2016-11-18 Paolo Minero , Massimo Franceschetti , David N. C. Tse

This paper provides upper and lower bounds on the optimal guessing moments of a random variable taking values on a finite set when side information may be available. These moments quantify the number of guesses required for correctly…

Information Theory · Computer Science 2018-06-22 Igal Sason , Sergio Verdú

In this paper, the multiple access channel (MAC) with channel state is analyzed in a scenario where a) the channel state is known non-causally to the transmitters and b) there is perfect causal feedback from the receiver to the…

Information Theory · Computer Science 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis

In quantum computation with continous-variable systems, quantum advantage can only be achieved if some non-Gaussian resource is available. Yet, non-Gaussian unitary evolutions and measurements suited for computation are challenging to…

Quantum Physics · Physics 2017-06-13 Francesco Arzani , Nicolas Treps , Giulia Ferrini

In this paper, new techniques are presented to either simplify or improve most existing upper bounds on the maximum-likelihood (ML) decoding performance of the binary linear codes over additive white Gaussian noise (AWGN) channels. Firstly,…

Information Theory · Computer Science 2015-03-19 Xiao Ma , Jia Liu , Baoming Bai

An information measure based on fractional partitions of a set is used to derive a general dependence balance inequality for communication. This inequality is used to obtain new upper bounds on reliable and secret rates for multiterminal…

Information Theory · Computer Science 2026-04-14 Amin Gohari , Gerhard Kramer

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

This work considers distributed sensing and transmission of sporadic random samples. Lower bounds are derived for the reconstruction error of a single normally or uniformly-distributed finite-dimensional vector imperfectly measured by a…

Information Theory · Computer Science 2015-11-20 Ayşe Ünsal , Raymond Knopp

In the context of quantum technologies over continuous variables, Gaussian states and operations are typically regarded as freely available, as they are relatively easily accessible experimentally. In contrast, the generation of…

Quantum Physics · Physics 2022-07-13 Oliver Hahn , Patric Holmvall , Pascal Stadler , Giulia Ferrini , Alessandro Ferraro

Generating random bits from a source of biased coins (the biased is unknown) is a classical question that was originally studied by von Neumann. There are a number of known algorithms that have asymptotically optimal information efficiency,…

Information Theory · Computer Science 2012-09-05 Hongchao Zhou , Jehoshua Bruck