English
Related papers

Related papers: Minimum Energy to Send $k$ Bits Over Multiple-Ante…

200 papers

Wireless fading channels suffer from both channel fadings and Additive White Gaussian Noise (AWGN). As a result, it is impossible for fading channels to support a constant rate data stream without using buffers. In this paper, we consider…

Information Theory · Computer Science 2017-12-15 Yunquan Dong , Pingyi Fan

An emerging trend of next generation communication systems is to provide network edges with additional capabilities such as storage resources in the form of caches to reduce file delivery latency. To investigate the impact of this technique…

Information Theory · Computer Science 2018-03-13 Jaber Kakar , Anas Chaaban , Aydin Sezgin , Arogyaswami Paulraj

We investigate the information-theoretic throughout achievable on a fading communication link when the receiver is equipped with one-bit analog-to-digital converters (ADCs). The analysis is conducted for the setting where neither the…

Information Theory · Computer Science 2015-05-06 Sven Jacobsson , Giuseppe Durisi , Mikael Coldrey , Ulf Gustavsson , Christoph Studer

In the setting of error-correcting codes with feedback, Alice wishes to communicate a $k$-bit message $x$ to Bob by sending a sequence of bits over a channel while noiselessly receiving feedback from Bob. It has been long known (Berlekamp,…

Information Theory · Computer Science 2022-12-14 Meghal Gupta , Venkatesan Guruswami , Rachel Yun Zhang

We study the throughput capacity region of the Gaussian multi-access (MAC) fading channel with perfect channel state information (CSI) at the receiver and at the transmitters, at low power regime. We show that it has a multidimensional…

Information Theory · Computer Science 2013-11-01 Zouheir Rezki , Mohamed-Slim Alouini

We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied -- dense random…

Information Theory · Computer Science 2009-05-26 Aman Jain , Sanjeev R. Kulkarni , Sergio Verdu

We consider spectrally-efficient communication over a Rayleigh N-block-fading channel with a K- sparse L-length discrete-time impulse response (for 0<K<L<N), where neither the transmitter nor receiver know the channel's coefficients nor its…

Information Theory · Computer Science 2011-06-01 Philip Schniter

The paper presents an analysis of the time reversal in multi-path Rayleigh-fading channels with $N$ inputs (transmitters) and $M$ outputs (receivers). The main issues addressed are the condition of statistical stability, the rate of…

Quantum Physics · Physics 2007-05-23 Albert Fannjiang

When data traffic in a wireless network is bursty, small amounts of data sporadically become available for transmission, at times that are unknown at the receivers, and an extra amount of energy must be spent at the transmitters to overcome…

Information Theory · Computer Science 2012-08-09 Ilan Shomorony , Raúl Etkin , Farzad Parvaresh , A. Salman Avestimehr

The performance of communication systems is fundamentally limited by the loss of energy through propagation and circuit inefficiencies. In this article, we show that it is possible to achieve ultra low energy communications at the…

We study channel capacity when a one-bit quantizer is employed at the output of the discrete-time average-power-limited Rayleigh-fading channel. We focus on the low signal-to-noise ratio regime, where communication at very low spectral…

Information Theory · Computer Science 2011-12-23 Tobias Koch , Amos Lapidoth

In this work, we investigate the problem of secure broadcasting over block-fading wiretap channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having a finite rate feedback on the…

Information Theory · Computer Science 2020-04-22 Amal Hyadi , Zouheir Rezki , Mohamed-Slim Alouini

Capacity gains from transmitter and receiver cooperation are compared in a relay network where the cooperating nodes are close together. Under quasi-static phase fading, when all nodes have equal average transmit power along with full…

Information Theory · Computer Science 2009-09-25 Chris T. K. Ng , Andrea J. Goldsmith

In this report, the fundamental limits of simultaneous information and energy transmission in the two-user Gaussian multiple access channel (G-MAC) with and without feedback are fully characterized. More specifically, all the achievable…

Information Theory · Computer Science 2017-03-14 Selma Belhadj Amor , Samir M. Perlaza , Ioannis Krikidis , H. Vincent Poor

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

Channel-state-information (CSI) feedback methods are considered, especially for massive or very large-scale multiple-input multiple-output (MIMO) systems. To extract essential information from the CSI without redundancy that arises from the…

Information Theory · Computer Science 2015-12-17 Jingon Joung , Ernest Kurniawan , Sumei Sun

We analyze and optimize a wireless system with energy transfer in the downlink and information transfer in the uplink, under quasi-static Nakagami-m fading. We consider ultra-reliable communication scenarios representative of the…

Information Theory · Computer Science 2017-02-22 Onel L. Alcaraz López , Hirley Alves , Richard Demo Souza , Evelio Martín García Fernández

In this paper we consider the capacity of the cognitive radio channel in different fading environments under a low interference regime. First we derive the probability that the low interference regime holds under shadow fading as well as…

Information Theory · Computer Science 2013-01-03 Muhammad Fainan Hanif , Peter J. Smith

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. Furthermore, it…

Information Theory · Computer Science 2017-10-25 Venkat Chandar , Aslan Tchamkerten

Discrete-time Rayleigh fading single-input single-output (SISO) and multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmitter or the receiver. The fading is assumed to be stationary…

Information Theory · Computer Science 2016-11-17 Vignesh Sethuraman , Ligong Wang , Bruce Hajek , Amos Lapidoth