English
Related papers

Related papers: Dirty-paper Coding without Channel Information at …

200 papers

A scenario involving a source, a channel, and a destination, where the destination is interested in {\em both} reliably reconstructing the message transmitted by the source and estimating with a fidelity criterion the state of the channel,…

Information Theory · Computer Science 2011-08-30 Wenyi Zhang , Satish Vedantam , Urbashi Mitra

The problem of dirty paper coding (DPC) over the (multi-antenna) fading dirty paper channel (FDPC) Y = H(X + S) + Z is considered when there is imperfect knowledge of the channel state information H at the transmitter (CSIT). The case of…

Information Theory · Computer Science 2009-03-27 Chinmay S. Vaze , Mahesh K. Varanasi

A generalization of the Gaussian dirty-paper problem to a multiple access setup is considered. There are two additive interference signals, one known to each transmitter but none to the receiver. The rates achievable using Costa's…

Information Theory · Computer Science 2009-04-14 Tal Philosof , Ram Zamir , Uri Erez , Ashish Khisti

In the literature, it has been shown that feedback does not increase the optimal rate-distortion region of the dirty paper channel with state estimation at the receiver (SE-R). On the other hand, it is well-known that feedback helps to…

Information Theory · Computer Science 2025-07-02 Dengfeng Xia , Han Deng , Haonan Zhang , Fan Cheng , Bin Dai , Liuguo Yin

Imperfect Channel State Information at the Transmitter (CSIT) is inevitable in modern wireless communication networks, and results in severe multi-user interference in multi-antenna Broadcast Channel (BC). While the capacity of the…

Information Theory · Computer Science 2020-08-05 Yijie Mao , Bruno Clerckx

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

We analytically approximate the expected sum capacity loss between the optimal downlink precoding technique of dirty paper coding (DPC), and the sub-optimal technique of zero-forcing precoding, for multiuser channels. We also consider the…

Information Theory · Computer Science 2021-11-22 Harsh Tataria , Mansoor Shafi , Dino Pjanić

This paper studies second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and…

Information Theory · Computer Science 2013-11-13 Jonathan Scarlett

Dirty Paper Coding (DPC) is considered as the optimal precoding which achieves capacity for the Gaussian Multiple-Input Multiple-Output (MIMO) broadcast channel (BC). However, to find the optimal precoding order, it needs to repeat N! times…

Information Theory · Computer Science 2023-04-11 Zhibin Zou , Aveek Dutta

In this work we probe the impact of channel estimation on the performance of quantum LDPC codes. Our channel estimation is based on an optimal estimate of the relevant decoherence parameter via its quantum Fisher information. Using…

Information Theory · Computer Science 2012-02-03 Yixuan Xie , Jun Li , Robert Malaney , Jinhong Yuan

A message composed of packets is transmitted using erasure and channel coding over a fading channel with no feedback. For this scenario, the paper explores the trade-off between the redundancies allocated to the packet-level erasure code…

Information Theory · Computer Science 2016-02-03 Sudarsan V. S. Ranganathan , Tong Mu , Richard D. Wesel

In 6G systems, extremely large-scale antenna arrays operating at terahertz frequencies extend the near-field region to typical user distances from the base station, enabling near-field communication (NFC) with fine spatial resolution…

Information Theory · Computer Science 2025-11-21 Akash Kulkarni , Rajshekhar V Bhat

Inspired by Costa's pioneering work on dirty paper coding (DPC), this paper proposes a novel scheme for integrated communication and computing (ICC), named Computing on Dirty Paper, whereby the transmission of discrete data symbols for…

Signal Processing · Electrical Eng. & Systems 2025-10-03 Kuranage Roche Rayan Ranasinghe , Giuseppe Thadeu Freitas de Abreu , David González G. , Carlo Fischione

We consider the problem of adaptive modulation for wideband DS-CDMA Rayleigh fading channels with imperfect channel state information (CSI). We assume a multidimensional signal subspace spanned by a collection of random spreading codes…

Information Theory · Computer Science 2007-07-13 Richard J. Barton

In this paper, we first consider a channel that is contaminated by two independent Gaussian noises $S ~ N(0,Q)$ and $Z_0 ~ N(0,N_0)$. The capacity of this channel is computed when independent noisy versions of $S$ are known to the…

Information Theory · Computer Science 2009-01-21 Yong Peng , Dinesh Rajan

Decision-directed channel estimation (DDCE) is one kind of blind channel estimation method that tracks the channel blindly by an iterative algorithm without relying on the pilots, which can increase the utilization of wireless resource.…

Signal Processing · Electrical Eng. & Systems 2024-02-20 Xun Wang , Xin Xie , Cunqing Hua , Jianan Hong , Pengwenlong Gu

The "Carbon Copy onto Dirty Paper" (CCDP) channel is the compound "writing on dirty paper" channel in which the channel output is obtained as the sum of the channel input, white Gaussian noise and a Gaussian state sequence randomly selected…

Information Theory · Computer Science 2017-07-11 Stefano Rini , Shlomo Shamai

In this work, we adopt channel inversion power control (CIPC) to achieve covert communications aided by a full-duplex receiver. Specifically, the transmitter varies the power and phase of transmitted signals as per the channel to the…

Information Theory · Computer Science 2018-12-21 Jinsong Hu , Shihao Yan , Xiangyun Zhou , Feng Shu , Jun Li

In this paper, we study the achievable performance of dirty paper coding for the Gaussian broadcast channel (BC) with finite blocklength and we propose two different achievability bounds for this problem. We present the broadcast adaptation…

Information Theory · Computer Science 2026-02-20 Ayşe Ünsal , Jean-Marie Gorce

We study the MIMO broadcast channel and compare the achievable throughput for the optimal strategy of dirty paper coding to that achieved with sub-optimal and lower complexity linear precoding (e.g., zero-forcing and block diagonalization)…

Information Theory · Computer Science 2016-11-17 Juyul Lee , Nihar Jindal