English
Related papers

Related papers: Writing on Fading Paper and Causal Transmitter CSI

200 papers

The "writing dirty paper" capacity result crucially dependents on the perfect channel knowledge at the transmitter as the presence of even a small uncertainty in the channel realization gravely hampers the ability of the transmitter to…

Information Theory · Computer Science 2016-02-09 Stefano Rini , Shlomo Shamai Shitz

In next-generation wireless networks, low latency often necessitates short-length codewords that either do not use channel state information (CSI) or rely solely on CSI at the receiver (CSIR). Gaussian codes that achieve capacity for AWGN…

Information Theory · Computer Science 2024-09-16 Rishabh Sharad Pomaje , Rajshekhar V Bhat

In this paper, we examine the effects of imperfect channel estimation at the receiver and no channel knowledge at the transmitter on the capacity of the fading Costa's channel with channel state information non-causally known at the…

Information Theory · Computer Science 2007-07-13 Pablo Piantanida , Pierre Duhamel

A multiple-input multiple-output (MIMO) version of the dirty paper channel is studied, where the channel input and the dirt experience the same fading process and the fading channel state is known at the receiver (CSIR). This represents…

Information Theory · Computer Science 2017-06-22 Ahmed Hindy , Aria Nosratinia

The classical writing on dirty paper capacity result establishes that full interference pre-cancellation can be attained in Gelfand-Pinsker problem with additive state and additive white Gaussian noise. This result holds under the idealized…

Information Theory · Computer Science 2014-05-12 Stefano Rini , Shlomo Shamai

This paper investigates the limits of information transfer over a fast Rayleigh fading MIMO channel, where neither the transmitter nor the receiver has the knowledge of the channel state information (CSI) except the fading statistics. We…

Information Theory · Computer Science 2007-07-13 Rasika R Perera , Tony S Pollock , Thushara D Abhayapala

The scaling of coherent and non-coherent channel capacity is studied in a single-input multiple-output (SIMO) block Rayleigh fading channel as both the bandwidth and the number of receiver antennas go to infinity jointly with the transmit…

Information Theory · Computer Science 2020-02-21 Felipe Gomez-Cuba , Mainak Chowdhury , Alexandros Manolakos , Elza Erkip , Andrea J. Goldsmith

The capacity of a time-varying block-memoryless channel in which the transmitter and the receiver have access to (possibly different) noisy causal channel side information (CSI) is obtained. It is shown that the capacity formula obtained in…

Information Theory · Computer Science 2008-06-09 Hamid Farmanbar , Amir K. Khandani

We consider the problem of covert communication over a state-dependent channel, where the transmitter has causal or noncausal knowledge of the channel states. Here, "covert" means that a warden on the channel should observe similar…

Information Theory · Computer Science 2017-08-09 Si-Hyeon Lee , Ligong Wang , Ashish Khisti , Gregory W. Wornell

This paper investigates downlink transmission over a quasi-static fading Gaussian broadcast channel (BC), to model delay-sensitive applications over slowly time-varying fading channels. System performance is characterized by outage…

Information Theory · Computer Science 2007-11-13 Wenyi Zhang , Shivaprasad Kotagiri , J. Nicholas Laneman

Costa`s "writing on dirty paper" result establishes that full state pre-cancellation can be attained in the Gel`fand-Pinsker problem with additive state and additive white Gaussian noise. This result holds under the assumptions that full…

Information Theory · Computer Science 2015-06-16 Stefano Rini , Shlomo Shamai Shitz

The effect of Rician-ness on the capacity of multiple antenna systems is investigated under the assumption that channel state information (CSI) is available only at the receiver. The average-power-constrained capacity of such systems is…

Information Theory · Computer Science 2007-07-13 Sudharman K. Jayaweera , H. Vincent Poor

In many communication scenarios, such as in cellular systems, the energy cost is substantial and should be conserved, yet there is a growing need to support many real-time applications that require timely data delivery. To model such a…

Information Theory · Computer Science 2012-11-30 Chin Keong Ho , Peng Hui Tan , Sumei Sun

A generalization of the problem of writing on dirty paper is considered in which one transmitter sends a common message to multiple receivers. Each receiver experiences on its link an additive interference (in addition to the additive…

Information Theory · Computer Science 2007-07-13 Ashish Khisti , Uri Erez , Amos Lapidoth , Gregory Wornell

The coding problem for wiretap channels with causal channel state information (CSI) available at the encoder (Alice) and/or the decoder (Bob) is studied. We are concerned here particularily with the problem of achievable secret-message…

Information Theory · Computer Science 2021-08-10 Te Sun Han , Masahide Sasaki

This paper studies a variant of the classical problem of ``writing on dirty paper'' in which the sum of the input and the interference, or dirt, is multiplied by a random variable that models resizing, known to the decoder but not to the…

Information Theory · Computer Science 2016-11-17 Wenyi Zhang , Shivaprasad Kotagiri , J. Nicholas Laneman

Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with…

Information Theory · Computer Science 2014-06-24 Steven Herbert , Ian Wassell , Tian-Hong Loh

The use of channel output feedback to improve the reliability of fading channels has received scant attention in the literature. In most work on feedback for fading channels, only channel state information (CSI) feedback has been exploited…

Information Theory · Computer Science 2012-04-12 Mayur Agrawal , David J. Love , Venkataramanan Balakrishnan

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

This paper investigates the minimum energy required to transmit $k$ information bits with a given reliability over a multiple-antenna Rayleigh block-fading channel, with and without channel state information (CSI) at the receiver. No…

Information Theory · Computer Science 2016-05-23 Wei Yang , Giuseppe Durisi , Yury Polyanskiy
‹ Prev 1 2 3 10 Next ›