English
Related papers

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

200 papers

This paper investigates the asymptotic expansion for the maximum rate of fixed-length codes over a parallel Gaussian channel with feedback under the following setting: A peak power constraint is imposed on every transmitted codeword, and…

Information Theory · Computer Science 2017-07-11 Silas L. Fong , Vincent Y. F. Tan

Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical delay constraints, is analyzed in a multiuser scenario. In particular, the effective capacity region…

Information Theory · Computer Science 2010-09-17 Deli Qiao , Mustafa Cenk Gursoy , Senem Velipasalar

The frequency selectivity of wireless communication channels can be characterized by the delay spread Ds of the channel impulse response. If the delay spread is small compared to the bandwidth W of the input signal, that is, Ds*W…

Information Theory · Computer Science 2008-08-07 Georg Böcherer , Daniel Bielefeld

Recent work has established that when transmitter Alice wishes to communicate reliably to recipient Bob without detection by warden Willie, with additive white Gaussian noise (AWGN) channels between all parties, communication is limited to…

Information Theory · Computer Science 2017-06-27 Tamara V. Sobers , Boulat A. Bash , Saikat Guha , Don Towsley , Dennis Goeckel

In this paper, we consider a two-user multiple access fading channel under quality-of-service (QoS) constraints. We initially formulate the transmission rates for both transmitters, where the transmitters have arbitrarily distributed input…

Information Theory · Computer Science 2016-08-08 Marwan Hammouda , Sami Akin , Jürgen Peissig

The capacity of a wireless network is the maximum possible amount of simultaneous communication, taking interference into account. Formally, we treat the following problem. Given is a set of links, each a sender-receiver pair located in a…

Data Structures and Algorithms · Computer Science 2012-03-15 Magnús Már Halldórsson , Pradipta Mitra

Channel uncertainty and co-channel interference are two major challenges in the design of wireless systems such as future generation cellular networks. This paper studies receiver design for a wireless channel model with both time-varying…

Information Theory · Computer Science 2009-10-15 Yan Zhu , Dongning Guo , Michael L. Honig

We consider a scenario where a base station (BS) attempts to collect fresh information from power constrained sensors over time-varying band-limited wireless channels. We characterize the data freshness through the recently proposed…

Information Theory · Computer Science 2019-10-15 Haoyue Tang , Jintao Wang , Philippe Ciblat , Jian Song

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

Interference between nodes directly limits the capacity of mobile ad hoc networks. This paper focuses on spatial interference cancelation with perfect channel state information (CSI), and analyzes the corresponding network capacity.…

Information Theory · Computer Science 2016-11-17 Kaibin Huang , Jeffrey G. Andrews , Robert W. Heath, , Dongning Guo , Randall A. Berry

In this paper, cognitive transmission under quality of service (QoS) constraints is studied. In the cognitive radio channel model, it is assumed that the secondary transmitter sends the data at two different average power levels, depending…

Information Theory · Computer Science 2009-06-23 Sami Akin , Mustafa Cenk Gursoy

We derive a new upper bound on the reliability function for channel coding over discrete memoryless channels. Our bounding technique relies on two main elements: (i) adding an auxiliary genie-receiver that reveals to the original receiver a…

Information Theory · Computer Science 2022-09-05 Anelia Somekh-Baruch

As shown by M\'edard, the capacity of fading channels with imperfect channel-state information (CSI) can be lower-bounded by assuming a Gaussian channel input $X$ with power $P$ and by upper-bounding the conditional entropy $h(X|Y,\hat{H})$…

Information Theory · Computer Science 2016-11-15 Adriano Pastore , Tobias Koch , Javier Rodríguez Fonollosa

Consider an energy-harvesting receiver that uses the same received signal both for decoding information and for harvesting energy, which is employed to power its circuitry. In the scenario where the receiver has limited battery size, a…

Information Theory · Computer Science 2015-06-02 Anshoo Tandon , Mehul Motani , Lav R. Varshney

In this paper, delay-limited transmission of quasi-stationary sources over block fading channels are considered. Considering distortion outage probability as the performance measure, two source and channel coding schemes with power adaptive…

Information Theory · Computer Science 2012-02-29 Roghayeh Joda , Farshad Lahouti

Communication over a broadband fading channel powered by an energy harvesting transmitter is studied. Assuming non-causal knowledge of energy/data arrivals and channel gains, optimal transmission schemes are identified by taking into…

Information Theory · Computer Science 2016-11-15 Oner Orhan , Deniz Gunduz , Elza Erkip

This paper presents finite-blocklength achievability bounds for the Gaussian multiple access channel (MAC) and random access channel (RAC) under average-error and maximal-power constraints. Using random codewords uniformly distributed on a…

Information Theory · Computer Science 2022-05-05 Recep Can Yavas , Victoria Kostina , Michelle Effros

In this paper, random coding error exponents and cutoff rate are studied for noncoherent Rician fading channels, where neither the receiver nor the transmitter has channel side information. First, it is assumed that the input is subject…

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

In this paper, the delay limited secrecy capacity of the flat fading channel is investigated under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of…

Information Theory · Computer Science 2016-11-15 Karim Khalil , Moustafa Youssef , O. Ozan Koyluoglu , Hesham El Gamal

For asynchronous transmission of short blocks, preambles for packet detection contribute a non-negligible overhead. To reduce the required preamble length, joint detection and decoding (JDD) techniques have been proposed that additionally…

Information Theory · Computer Science 2025-01-29 Simon Obermüller , Jannis Clausius , Marvin Geiselhart , Stephan ten Brink
‹ Prev 1 8 9 10 Next ›