English
Related papers

Related papers: Sampling Constrained Asynchronous Communication: H…

200 papers

This paper revisits the problem of sampling and transmitting status updates through a channel with random delay under a sampling frequency constraint \cite{sun_17_tit}. We use the Age of Information (AoI) to characterize the status…

Information Theory · Computer Science 2023-01-05 Haoyue Tang , Yuchao Chen , Jintao Wang , Pengkun Yang , Leandros Tassiulas

Data compression capability of "Compressed sensing (sampling)" in signal discretization is numerically evaluated and found to be far from the theoretical upper bound defined by signal sparsity. It is shown that, for the cases when ordinary…

Optics · Physics 2015-02-10 L. Yaroslavsky

A simple feedback control algorithm is presented for distributed beamforming in a wireless network. A network of wireless sensors that seek to cooperatively transmit a common message signal to a Base Station (BS) is considered. In this…

Information Theory · Computer Science 2007-07-16 R. Mudumbai , J. Hespanha , U. Madhow , G. Barriac

The central idea of compressed sensing is to exploit the fact that most signals of interest are sparse in some domain and use this to reduce the number of measurements to encode. However, if the sparsity of the input signal is not precisely…

In this paper, the required amount of feedback overhead for multiple-input multiple-output (MIMO) beamforming over time-varying channels is presented in terms of the entropy of the feedback messages. In the case that each transmit antenna…

Information Theory · Computer Science 2010-04-30 Jaewon Kim , Jonghyun Park

We study the energy performance of random linear network coding for time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data…

Information Theory · Computer Science 2009-01-05 Daniel E. Lucani , Milica Stojanovic , Muriel Médard

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

Information Theory · Computer Science 2022-05-11 Han Wu , Hamdi Joudeh

As conventional communication systems based on classic information theory have closely approached the limits of Shannon channel capacity, semantic communication has been recognized as a key enabling technology for the further improvement of…

Information Theory · Computer Science 2023-06-06 Jiancheng Tang , Qianqian Yang , Zhaoyang Zhang

There is a growing interest in signaling schemes that operate in the wideband regime due to the crowded frequency spectrum. However, a downside of the wideband regime is that obtaining channel state information is costly, and the capacity…

Signal Processing · Electrical Eng. & Systems 2022-06-01 Kathleen Yang , Diana C. Gonzalez , Yonina C. Eldar , Muriel Medard

A single input multiple output (SIMO) multiple access channel, with a large number of transmitters sending symbols from a constellation to the receiver of a multi-antenna base station, is considered. The fundamental limits of joint decoding…

Information Theory · Computer Science 2014-04-10 Mainak Chowdhury , Andrea Goldsmith

Exponential error bounds achievable by universal coding and decoding are derived for frame-asynchronous discrete memoryless %asynchronous multiple access channels with two senders, via the method of subtypes, a refinement of the method of…

Information Theory · Computer Science 2020-02-04 Lóránt Farkas , Tamás Kói

We present a novel closed-form lower bound on the Gaussian-input mutual information for noncoherent communication (i.e., in which neither transmitter nor receiver are cognizant of the fading state) over a frequency-flat fading channel with…

Information Theory · Computer Science 2018-04-20 Adriano Pastore

Energy efficiency of fixed-rate transmissions is studied in the presence of queueing constraints and channel uncertainty. It is assumed that neither the transmitter nor the receiver has channel side information prior to transmission. The…

Information Theory · Computer Science 2009-01-21 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

We study the problem of exact sampling under an exponential communication cost, specifically Campbell's average codeword length $L(t)$ of order $t$, and R\'enyi's entropy. We provide a lower bound on the Campbell cost of exact sampling that…

Information Theory · Computer Science 2026-04-03 Spencer Hill , Fady Alajaji , Tamás Linder

The energy cost of a sensor network is dominated by the data acquisition and communication cost of individual sensors. At each sampling instant it is unnecessary to sample and communicate the data at all sensors since the data is highly…

Signal Processing · Electrical Eng. & Systems 2019-12-17 Angshul Majumdar , Rabab Ward

Antenna selection (AS) is regarded as one of the most prospective technologies to reduce hardware cost but keep relatively high spectral efficiency in multi-antenna systems. By selecting a subset of antennas to transceive messages, AS…

Signal Processing · Electrical Eng. & Systems 2019-07-17 Chongjun Ouyang , Hongwen Yang

We study distribution testing with communication and memory constraints in the following computational models: (1) The {\em one-pass streaming model} where the goal is to minimize the sample complexity of the protocol subject to a memory…

Machine Learning · Computer Science 2019-06-12 Ilias Diakonikolas , Themis Gouleakis , Daniel M. Kane , Sankeerth Rao

The paper investigates the distributed estimation problem under low bit rate communications. Based on the signal-comparison (SC) consensus protocol under binary-valued communications, a new consensus+innovations type distributed estimation…

Systems and Control · Electrical Eng. & Systems 2025-03-25 Jieming Ke , Xiaodong Lu , Yanlong Zhao , Ji-Feng Zhang

For a general energy harvesting (EH) communication network, i.e., a network where the nodes generate their transmit power through EH, we derive the asymptotically optimal online power allocation solution which optimizes a general utility…

Information Theory · Computer Science 2017-02-01 Nikola Zlatanov , Robert Schober , Zoran Hadzi-Velkov

Iterative thresholding algorithms are well-suited for high-dimensional problems in sparse recovery and compressive sensing. The performance of this class of algorithms depends heavily on the tuning of certain threshold parameters. In…

Information Theory · Computer Science 2013-11-04 Ali Mousavi , Arian Maleki , Richard G. Baraniuk