English
Related papers

Related papers: Sampling Constrained Asynchronous Communication: H…

200 papers

Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sensing literature have focused on characterizing the achievable…

Information Theory · Computer Science 2015-05-18 Dmitry Malioutov , Sujay Sanghavi , Alan Willsky

The secrecy rate represents the amount of information per unit time that can be securely sent on a communication link. In this work, we investigate the achievable secrecy rates in an energy harvesting communication system composed of a…

Information Theory · Computer Science 2016-11-17 Alessandro Biason , Nicola Laurenti , Michele Zorzi

Advances of information-theoretic understanding of sparse sampling of continuous uncoded signals at sampling rates exceeding the Landau rate were reported in recent works. This work examines sparse sampling of coded signals at sub-Landau…

Information Theory · Computer Science 2013-03-04 Michael Peleg , Shlomo Shamai

In this paper, we show that by investigating inherent time delays between different users in a multiuser scenario, we are able to cancel interference more efficiently. Time asynchrony provides another tool to cancel interference which…

Information Theory · Computer Science 2016-09-23 Mehdi Ganji , Hamid Jafarkhani

The minimum average signal-to-noise ratio (SNR) per bit required for error-free transmission over a fading channel is derived, and is shown to be equal to that of the additive white Gaussian noise (AWGN) channel, which is $-1.6$ dB.…

Information Theory · Computer Science 2017-11-29 K. Vasudevan

This paper investigates the problem of the minimilization of energy consumption in reallocation of wireless mobile sensors network (WMSN) to assure good communication without interference. Fix $d\in\mathbb{N}\setminus\{0\}.$ Assume $n$…

Data Structures and Algorithms · Computer Science 2019-05-07 Rafał Kapelko

We consider the problem of broadcast with common messages, and focus on the case that the common message rate $R_{\mathcal{A}}$, i.e., the rate of the message intended for all the receivers in the set $\mathcal{A}$, is the same for all the…

Information Theory · Computer Science 2016-11-17 Chao Tian

We consider a wireless node that randomly receives data from different sensor units. The arriving data must be compressed, stored, and transmitted over a wireless link, where both the compression and transmission operations consume power.…

Optimization and Control · Mathematics 2008-07-25 Michael J. Neely , Abhishek Sharma

We consider the problem of minimizing the time average cost of sampling and transmitting status updates by users over a wireless channel subject to average Age of Information constraints (AoI). Errors in the transmission may occur and the…

Networking and Internet Architecture · Computer Science 2020-03-06 Emmanouil Fountoulakis , Nikolaos Pappas , Marian Codreanu , Anthony Ephremides

In this paper, we consider the problem of detecting signals in multiple, sequentially observed data streams. For each stream, the exact distribution is unknown, but characterized by a parameter that takes values in either of two disjoint…

Methodology · Statistics 2025-07-30 Yiming Xing , Anamitra Chaudhuri , Yifan Chen

This paper studies the receive antenna selection in massive multiple-input multiple-output (MIMO) system. The receiver, equipped with a large-scale antenna array whose size is much larger than that of the transmitter, selects a subset of…

Signal Processing · Electrical Eng. & Systems 2018-10-30 Chongjun Ouyang , Zeliang Ou , Lu Zhang , Hongwen Yang

When transmitting information over a noisy channel, two approaches, dating back to Shannon's work, are common: assuming the channel errors are independent of the transmitted content and devising an error-correcting code, or assuming the…

Information Theory · Computer Science 2015-01-22 Ohad Elishco , Tom Meyerovitch , Moshe Schwartz

The energy used to transmit a single bit of data between the devices in wireless networks is equal to the energy for performing hundreds of instructions in those devices. Thus the reduction of the data necessary to transmit, while keeping…

Information Theory · Computer Science 2020-02-14 Danilo Gligoroski , Katina Kralevska , Harald Oeverby

A multiplicity of autonomous terminals simultaneously transmits data streams to a compact array of antennas. The array uses imperfect channel-state information derived from transmitted pilots to extract the individual data streams. The…

Information Theory · Computer Science 2012-05-23 Hien Quoc Ngo , Erik G. Larsson , Thomas L. Marzetta

This paper considers efficient sampling of simultaneously sparse and correlated (S$\&$C) signals. Such signals arise in various applications in array processing. We propose an implementable sampling architecture for the acquisition of…

Information Theory · Computer Science 2023-01-19 Ali Ahmed , Fahad Shamshad , Humera Hameed

We investigate the maximum coding rate for a given average blocklength and error probability over a K-user discrete memoryless broadcast channel for the scenario where a common message is transmitted using variable-length stop-feedback…

Information Theory · Computer Science 2018-09-03 Kasper Fløe Trillingsgaard , Wei Yang , Giuseppe Durisi , Petar Popovski

Reliable spectrum sensing is a key functionality of a cognitive radio network. Cooperative spectrum sensing improves the detection reliability of a cognitive radio system but also increases the system energy consumption which is a critical…

Systems and Control · Computer Science 2015-03-19 Sina Maleki , Geert Leus

We consider an unslotted primary channel with alternating on/off activity and provide a solution to the problem of finding the optimal secondary transmission power and duration given some sensing outcome. The goal is to maximize a weighted…

Information Theory · Computer Science 2009-11-11 Ahmed Ahmedin , Marwa Ali , Ahmed Sultan , Mohammed Nafie

We derive an information-theoretic lower bound for sample complexity in sparse recovery problems where inputs can be chosen sequentially and adaptively. This lower bound is in terms of a simple mutual information expression and unifies many…

Information Theory · Computer Science 2014-04-30 Cem Aksoylar , Venkatesh Saligrama

We consider communication over binary-input memoryless output-symmetric channels using low-density parity-check codes and message-passing decoding. The asymptotic (in the length) performance of such a combination for a fixed number of…

Information Theory · Computer Science 2008-02-12 Satish Babu Korada , Ruediger Urbanke
‹ Prev 1 4 5 6 7 8 10 Next ›