English
Related papers

Related papers: Capacity Achieving by Diagonal Permutation for MU-…

200 papers

We study the optimality of linear precoding for the two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel (BC) with confidential messages. Secret dirty-paper coding (SDPC) is optimal under an input covariance…

Information Theory · Computer Science 2013-04-18 Ali Fakoorian andA. Lee Swindlehurst

The downlink of a multiple-input multiple output (MIMO) broadcast channel (BC) is considered, where each receiver is equipped with a single antenna and the transmitter performs nonlinear Dirty-Paper Coding (DPC). We present an efficient…

Information Theory · Computer Science 2007-07-13 Thomas Michel , Gerhard Wunder

The dirty paper channel (DPC) under a peak amplitude constraint arises in an optical wireless broadcast channel (BC), where the state at one receiver is the transmitted signal intended for the other receiver(s). This paper studies a class…

Information Theory · Computer Science 2023-01-09 Zhenyu Charlus Zhang , Anas Chaaban

MIMO technology is one of the most significant advances in the past decade to increase channel capacity and has a great potential to improve network capacity for mesh networks. In a MIMO-based mesh network, the links outgoing from each node…

Information Theory · Computer Science 2007-07-13 Jia Liu , Y. Thomas Hou

A Dirty Paper Coding (DPC) based transmission scheme for the Gaussian multiple-input multiple-output (MIMO) cognitive radio channel (CRC) is studied when there is imperfect and perfect channel knowledge at the transmitters (CSIT) and the…

Information Theory · Computer Science 2009-06-15 Chinmay S. Vaze , Mahesh K. Varanasi

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

Recently, researchers showed that dirty paper coding (DPC) is the optimal transmission strategy for multiple-input multiple-output broadcast channels (MIMO-BC). In this paper, we study how to determine the maximum weighted sum of DPC rates…

Information Theory · Computer Science 2007-07-13 Jia Liu , Y. Thomas Hou

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ć

In this paper, we study the sum rate maximization for successive zero-forcing dirty-paper coding (SZFDPC) with per-antenna power constraint (PAPC). Although SZFDPC is a low-complexity alternative to the optimal dirty paper coding (DPC),…

Information Theory · Computer Science 2019-05-21 Thuy M. Pham , Ronan Farrell , Le-Nam Tran

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

In this paper, we consider precoder designs for multiuser multiple-input-single-output (MISO) broadcasting channels. Instead of using a traditional linear zero-forcing (ZF) precoder, we propose a generalized ZF (GZF) precoder in conjunction…

Information Theory · Computer Science 2017-09-07 Sha Hu , Fredrik Rusek

Dirty paper coding (DPC) refers to methods for pre-subtraction of known interference at the transmitter of a multiuser communication system. There are numerous applications for DPC, including coding for broadcast channels. Recently,…

Information Theory · Computer Science 2010-01-21 G Shilpa , Andrew Thangaraj , Srikrishna Bhashyam

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

The problem of Dirty Paper Coding (DPC) over the Fading Dirty Paper Channel (FDPC) Y = H(X + S)+Z, a more general version of Costa's channel, is studied for the case in which there is partial and perfect knowledge of the fading process H at…

Information Theory · Computer Science 2009-01-20 Chinmay S. Vaze , Mahesh K. Varanasi

We consider Gaussian multiple-input multiple-output (MIMO) channels with discrete input alphabets. We propose a non-diagonal precoder based on the X-Codes in \cite{Xcodes_paper} to increase the mutual information. The MIMO channel is…

Information Theory · Computer Science 2016-11-17 Saif Khan Mohammed , Emanuele Viterbo , Yi Hong , Ananthanarayanan Chockalingam

Dirty paper coding (DPC) is a classical problem in information theory that considers communication in the presence of channel state known only at the transmitter. While the theoretical impact of DPC has been substantial, practical…

Information Theory · Computer Science 2025-07-24 Ezgi Ozyilkan , Oğuzhan Kubilay Ülger , Elza Erkip

A Non-Orthogonal Unicast and Multicast (NOUM) transmission system allows a multicast stream intended to all receivers to be jointly transmitted with unicast streams in the same time-frequency resource blocks. While the capacity of the…

Information Theory · Computer Science 2020-12-15 Yijie Mao , Bruno Clerckx

In this paper, we consider a general K-user Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). We assume that the channel state is deterministic and known to all the nodes. While the private-message capacity region is…

Information Theory · Computer Science 2021-04-29 Zheng Li , Sheng Yang , Shlomo Shamai

We investigate the MIMO broadcast channel in the high SNR regime when linear filtering is applied instead of dirty paper coding. Using a user-wise rate duality where the streams of every single user are not treated as self-interference as…

Information Theory · Computer Science 2008-07-18 Raphael Hunger , Michael Joham

We propose a method to increase the capacity achieved by uniform prior in discrete memoryless channels (DMC) with high input cardinality. It consists in appropriately reducing the input set. Different design criteria of the input subset are…

Information Theory · Computer Science 2010-10-28 Amine Mezghani , Michel T. Ivrlac , Josef A. Nossek
‹ Prev 1 2 3 10 Next ›