English
Related papers

Related papers: Second Order and Moderate Deviation Analysis of a …

200 papers

We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requirement on the packet error probability. We focus on the…

Information Theory · Computer Science 2017-12-19 Johan Östman , Giuseppe Durisi , Erik G. Ström , Mustafa C. Coşkun , Gianluigi Liva

Upper bounds on the capacity of vector Gaussian channels affected by fading are derived under peak amplitude constraints at the input. The focus is on constraint regions that can be decomposed in a Cartesian product of sub-regions. This…

Information Theory · Computer Science 2022-07-05 Antonino Favano , Marco Ferrari , Maurizio Magarini , Luca Barletta

This is the second part of a two-part paper that studies the problem of jamming in a fixed-rate transmission system with fading. In the first part, we studied the scenario with a fast fading channel, and found Nash equilibria of mixed…

Information Theory · Computer Science 2008-08-27 George T. Amariucai , Shuangqing Wei , Rajgopal Kannan

We first consider an energy harvesting channel with fading, where only the transmitter harvests energy from natural sources. We bound the optimal long term throughput by a constant for a class of energy arrival distributions. The proposed…

Information Theory · Computer Science 2015-01-28 Jainam Doshi , Rahul Vaze

We investigate the limits of communication over the discrete-time Additive White Gaussian Noise (AWGN) channel, when the channel output is quantized using a small number of bits. We first provide a proof of our recent conjecture on the…

Information Theory · Computer Science 2008-05-15 Jaspreet Singh , Onkar Dabeer , Upamanyu Madhow

A new converse bound is presented for the two-user multiple-access channel under the average probability of error constraint. This bound shows that for most channels of interest, the second-order coding rate -- that is, the difference…

Information Theory · Computer Science 2021-10-04 Oliver Kosut

This paper considers the problem of communication over a discrete memoryless channel (DMC) or an additive white Gaussian noise (AWGN) channel subject to the constraint that the probability that an adversary who observes the channel outputs…

Information Theory · Computer Science 2016-11-17 Ligong Wang , Gregory Wornell , Lizhong Zheng

We consider a continuous-time bandlimited additive white Gaussian noise channel with 1-bit output quantization. On such a channel the information is carried by the temporal distances of the zero-crossings of the transmit signal. The set of…

Information Theory · Computer Science 2017-09-25 Sandra Bender , Meik Dörpinghaus , Gerhard Fettweis

This paper considers the use of energy harvesters, instead of conventional time-invariant energy sources, in wireless cooperative communication. For the purpose of exposition, we study the classic three-node Gaussian relay channel with…

Information Theory · Computer Science 2016-11-17 Chuan Huang , Rui Zhang , Shuguang Cui

We present nonasymptotic bounds on the maximum coding rate achievable over a Rician block-fading channel for a fixed packet size and a fixed packet error probability. Our bounds, which apply to the scenario where no a priori channel state…

Information Theory · Computer Science 2017-05-24 Johan Östman , Giuseppe Durisi , Erik G. Ström

We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free and uncoordinated uplink for densely packed wireless nodes. Specifically, we study random-access codes, previously introduced for…

Information Theory · Computer Science 2019-07-23 Suhas S Kowshik , Kirill Andreev , Alexey Frolov , Yury Polyanskiy

Motivated by the current interest in ultra-reliable, low-latency, machine-type communication systems, we investigate the tradeoff between reliability, throughput, and latency in the transmission of information over multiple-antenna Rayleigh…

Information Theory · Computer Science 2016-11-17 Giuseppe Durisi , Tobias Koch , Johan Östman , Yury Polyanskiy , Wei Yang

The inherent nature of polar codes being channel specific makes it difficult to use them in a setting where the communication channel changes with time. In particular, to be able to use polar codes in a wireless scenario, varying…

Information Theory · Computer Science 2017-04-04 P. K. Deekshith , K. R. Sahasranand

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 investigate the maximal achievable rate for a given blocklength and error probability over quasi-static single-input multiple-output (SIMO) fading channels. Under mild conditions on the channel gains, it is shown that the channel…

Information Theory · Computer Science 2013-05-17 Wei Yang , Giuseppe Durisi , Tobias Koch , Yury Polyanskiy

We consider the problem of Simultaneous Wireless Information and Power Transfer (SWIPT) over a fading multiple access channel with additive Gaussian noise. The transmitters as well as the receiver harvest energy from ambient sources. We…

Information Theory · Computer Science 2016-12-14 P K Deekshith , Trupthi Chougule , Shreya Turmari , Ramya Raju , Rakshitha Ram , Vinod Sharma

Energy harvesting is a promising solution to prolong the operation of energy-constrained wireless networks. In particular, scavenging energy from ambient radio signals, namely wireless energy harvesting (WEH), has recently drawn significant…

Information Theory · Computer Science 2012-11-01 Liang Liu , Rui Zhang , Kee-Chaing Chua

The goal of this paper is to obtain a better knowledge of the achievable data rate over noncoherent Rician fading channel with time and frequency memory. We assume that the average-power as well as the peak-power of the input signal are…

Information Theory · Computer Science 2012-07-13 Jean-Michel Passerieux , Francois-Xavier Socheleau , Christophe Laot

The central design challenge in next generation wireless systems is to have these systems operate at high bandwidths and provide high data rates while being cognizant of the energy consumption levels especially in mobile applications. Since…

Information Theory · Computer Science 2016-11-15 Mustafa Cenk Gursoy

In this paper, a lower bound on the capacity of wireless ad hoc erasure networks is derived in closed form in the canonical case where $n$ nodes are uniformly and independently distributed in the unit area square. The bound holds almost…

Information Theory · Computer Science 2009-01-15 Rayyan G. Jaber , Jeffrey G. Andrews