English
Related papers

Related papers: Sampling Constrained Asynchronous Communication: H…

200 papers

In this paper, the fundamental limits on the rates at which information and energy can be simultaneously transmitted over an additive white Gaussian noise channel are studied under the following assumptions: $(a)$ the channel is memoryless;…

Information Theory · Computer Science 2021-10-06 Sadaf ul Zuhra , Samir M. Perlaza , Eitan Altman

Bayesian Neural Networks (BNNs) provide principled estimates of model and data uncertainty by encoding parameters as distributions. This makes them key enablers for reliable AI that can be deployed on safety critical edge systems. These…

Emerging Technologies · Computer Science 2024-11-13 Prabodh Katti , Bashir M. Al-Hashimi , Bipin Rajendran

To relax power consumption requirements in multigigabit/s communications systems low resolution quantization can be used. Information-theoretic results have shown that systems employing 1-bit quantization and oversampling are a viable…

Information Theory · Computer Science 2016-04-14 Tim Hälsig , Lukas Landau , Gerhard Fettweis

An uplink system with a single antenna transmitter and a single receiver with a large number of antennas is considered. We propose an energy-detection-based single-shot noncoherent communication scheme which does not use the instantaneous…

Information Theory · Computer Science 2015-07-20 Alexandros Manolakos , Mainak Chowdhury , Andrea J. Goldsmith

This paper concerns the problem of 1-bit compressed sensing, where the goal is to estimate a sparse signal from a few of its binary measurements. We study a non-convex sparsity-constrained program and present a novel and concise analysis…

Machine Learning · Computer Science 2020-07-10 Jie Shen

The field of compressed sensing has shown that a sparse but otherwise arbitrary vector can be recovered exactly from a small number of randomly constructed linear projections (or samples). The question addressed in this paper is whether an…

Information Theory · Computer Science 2010-01-26 Galen Reeves , Michael Gastpar

A noisy CDMA downlink channel operating under a strict complexity constraint on the receiver is introduced. According to this constraint, detected bits, obtained by performing hard decisions directly on the channel's matched filter output,…

Information Theory · Computer Science 2007-07-13 Ori Shental , Ido Kanter , Anthony J. Weiss

This paper investigates the optimization of memory sampling in status updating systems, where source updates are published in shared memory, and reader process samples the memory for source updates by paying a sampling cost. We formulate a…

Systems and Control · Electrical Eng. & Systems 2024-05-27 Vishakha Ramani , Ivan Seskar , Roy D. Yates

A practical and scalable multicast beamformer design in multi-input multi-output~(MIMO) coded caching~(CC) systems is introduced in this paper. The proposed approach allows multicast transmission to multiple groups with partially…

Information Theory · Computer Science 2023-12-06 Mohammad NaseriTehrani , MohammadJavad Salehi , Antti Tölli

This paper proposes a framework for fast signal acquisition based on deterministic non-uniform sampling, with emphasis on multi-coset architectures and receivers driven by known synchronization sequences, pilots, or preambles. Unlike…

Signal Processing · Electrical Eng. & Systems 2026-05-19 Alejandro Gonzalez Garrido , Carla Amatetti

We consider the on-time transmissions of a sequence of packets over a fading channel.Different from traditional in-time communications, we investigate how many packets can be received $\delta$-on-time, meaning that the packet is received…

Information Theory · Computer Science 2022-02-18 Yan Li , Yunquan Dong , Byonghyo Shim

The success of the compressed sensing paradigm has shown that a substantial reduction in sampling and storage complexity can be achieved in certain linear and non-adaptive estimation problems. It is therefore an advisable strategy for…

Information Theory · Computer Science 2014-08-27 Peter Jung , Philipp Walk

The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to decide whether the Hamming distance between their $n$-bit…

Computational Complexity · Computer Science 2009-02-17 Joshua Brody , Amit Chakrabarti

Mobile devices increasingly require the parallel execution of several computing tasks offloaded at the wireless edge. Existing communication systems only support parallel transmissions at the bit level, which fundamentally limits the number…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-11-19 Mohammad Abdi , Francesca Meneghello , Francesco Restuccia

A multiple antenna broadcast channel with perfect channel state information at the receivers is considered. If each receiver quantizes its channel knowledge to a finite number of bits which are fed back to the transmitter, the large…

Information Theory · Computer Science 2007-07-13 Nihar Jindal

Periodic nonuniform sampling is a known method to sample spectrally sparse signals below the Nyquist rate. This strategy relies on the implicit assumption that the individual samplers are exposed to the entire frequency range. This…

Information Theory · Computer Science 2009-01-27 Moshe Mishali , Yonina C. Eldar , Joel A. Tropp

The energy-optimal scheme is found for communicating one bit over a memoryless Gaussian channel with an ideal feedback channel. It is assumed that the channel is allowed to be used at most N times before decoding. The optimal…

Information Theory · Computer Science 2016-05-17 Bo Bernhardsson , Ather Gattami

For the additive white Gaussian noise channel with average codeword power constraint, sparse superposition codes are developed. These codes are based on the statistical high-dimensional regression framework. The paper [IEEE Trans. Inform.…

Information Theory · Computer Science 2012-07-11 Antony Joseph , Andrew Barron

This paper considers a deterministic physical model of massive multiple-input multiple-output (MIMO) systems with uniform linear antenna arrays. It is known that the maximum spatial degrees of freedom is achieved by spacing antenna elements…

Information Theory · Computer Science 2016-01-22 Keigo Takeuchi

This paper introduces a novel, fast atomic-snapshot protocol for asynchronous message-passing systems. In the process of defining what ``fast'' means exactly, we spot a few interesting issues that arise when conventional time metrics are…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-11-19 João Paulo Bezerra , Luciano Freitas , Petr Kuznetsov , Matthieu Rambaud