English
Related papers

Related papers: Sampling Constrained Asynchronous Communication: H…

200 papers

The minimum energy, and, more generally, the minimum cost, to transmit one bit of information has been recently derived for bursty communication when information is available infrequently at random times at the transmitter. This result…

Information Theory · Computer Science 2013-03-25 Aslan Tchamkerten , Venkat Chandar , Giuseppe Caire

The capacity per unit cost, or equivalently minimum cost to transmit one bit, is a well-studied quantity. It has been studied under the assumption of full synchrony between the transmitter and the receiver. In many applications, such as…

Information Theory · Computer Science 2012-10-25 Venkat Chandar , Aslan Tchamkerten , David Tse

Several aspects of the problem of asynchronous point-to-point communication without feedback are developed when the source is highly intermittent. In the system model of interest, the codeword is transmitted at a random time within a…

Information Theory · Computer Science 2012-07-10 Aslan Tchamkerten , Venkat Chandar , Gregory Wornell

We consider asynchronous communication over point-to-point discrete memoryless channels. The transmitter starts sending one block codeword at an instant that is uniformly distributed within a certain time period, which represents the level…

Information Theory · Computer Science 2007-08-01 Aslan Tchamkerten , Venkat Chandar , Gregory Wornell

The robust beamforming problem in multiple-input single-output (MISO) downlink networks of simultaneous wireless information and power transfer (SWIPT) is studied in this paper. Adopting the time switching fashion to perform energy…

Signal Processing · Electrical Eng. & Systems 2018-03-22 Yinglei Teng , Wanxin Zhao , Mei Yan , Yong Zhang , Mei Song

This work analyzes the high-SNR asymptotic error performance of outage-limited communications with fading, where the number of bits that arrive at the transmitter during any time slot is random but the delivery of bits at the receiver must…

Information Theory · Computer Science 2016-11-17 Somsak Kittipiyakul , Petros Elia , Tara Javidi

In this paper, Bayesian quickest change detection problems with sampling right constraints are considered. Specifically, there is a sequence of random variables whose probability density function will change at an unknown time. The goal is…

Information Theory · Computer Science 2014-07-16 Jun Geng , Erhan Bayraktar , Lifeng Lai

In the first part of the series papers, we set out to answer the following question: given specific restrictions on a set of samplers, what kind of signal can be uniquely represented by the corresponding samples attained, as the foundation…

Information Theory · Computer Science 2021-08-25 Hanshen Xiao , Yaowen Zhang , Guoqiang Xiao

We consider the problem of estimating the states of weakly coupled linear systems from sampled measurements. We assume that the total capacity available to the sensors to transmit their samples to a network manager in charge of the…

Systems and Control · Computer Science 2016-10-25 Xudong Chen , M. -A. Belabbas , Tamer Basar

Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with…

Information Theory · Computer Science 2014-06-24 Steven Herbert , Ian Wassell , Tian-Hong Loh

The capacity under strong asynchronism was recently shown to be essentially unaffected by the imposed output sampling rate $\rho$ and decoding delay $d$---the elapsed time between when information is available at the transmitter and when it…

Information Theory · Computer Science 2017-10-20 Longguang Li , Aslan Tchamkerten

Distributed signal processing has attracted widespread attention in the scientific community due to its several advantages over centralized approaches. Recently, graph signal processing has risen to prominence, and adaptive distributed…

Signal Processing · Electrical Eng. & Systems 2020-08-07 Daniel G. Tiglea , Renato Candido , Magno T. M. Silva

This paper gives performance limits of the segmented compressive sampling (CS) which collects correlated samples. It is shown that the effect of correlation among samples for the segmented CS can be characterized by a penalty term in the…

Information Theory · Computer Science 2016-03-03 Hao Fang , Sergiy A. Vorobyov , Hai Jiang

We introduce a simple time-triggered protocol to achieve communication-efficient non-Bayesian learning over a network. Specifically, we consider a scenario where a group of agents interact over a graph with the aim of discerning the true…

Systems and Control · Electrical Eng. & Systems 2019-09-05 Aritra Mitra , John A. Richards , Shreyas Sundaram

A traditional assumption underlying most data converters is that the signal should be sampled at a rate exceeding twice the highest frequency. This statement is based on a worst-case scenario in which the signal occupies the entire…

Information Theory · Computer Science 2015-05-13 Yonina C. Eldar

A parameter estimation problem is considered, in which dispersed sensors transmit to the statistician partial information regarding their observations. The sensors observe the paths of continuous semimartingales, whose drifts are linear…

Methodology · Statistics 2013-02-01 Georgios Fellouris

The first terms of the low-signal-energy asymptotics for the mutual information in the discrete-time Poisson channel are derived and compared to an asymptotic expression of the capacity. In the presence of non-zero additive noise (either…

Information Theory · Computer Science 2008-08-21 Alfonso Martinez

Recently, communication systems that are both spectrum and energy efficient have attracted significant attention. Different from the existing research, we investigate the throughput and energy efficiency of a general class of multiple-input…

Information Theory · Computer Science 2017-12-05 Marwan Hammouda , Sami Akın , M. Cenk Gursoy , Jürgen Peissig

Consider a sensor network made of remote nodes connected to a common fusion center. In a recent work Blum and Sadler [1] propose the idea of ordered transmissions -sensors with more informative samples deliver their messages first- and…

Information Theory · Computer Science 2011-03-29 Paolo Braca , Stefano Marano , Vincenzo Matta

We consider the classic joint source-channel coding problem of transmitting a memoryless source over a memoryless channel. The focus of this work is on the long-standing open problem of finding the rate of convergence of the smallest…

Information Theory · Computer Science 2019-08-27 Yuval Kochman , Or Ordentlich , Yury Polyanskiy
‹ Prev 1 2 3 10 Next ›