scispace - formally typeset
Search or ask a question
Topic

Dirty paper coding

About: Dirty paper coding is a research topic. Over the lifetime, 814 publications have been published within this topic receiving 37097 citations.


Papers
More filters
Proceedings ArticleDOI
11 Dec 2009
TL;DR: This paper focuses on Multi-User MIMO Broadcast Channels with few users feeding back their channel estimates, i.e. K linear in the number of transmitting antennas, and shows that the Zero Forcing beamformer, commonly accepted for practical implementations, can be easily outperformed by other schemes based on QR decomposition, approaching the channel capacity.
Abstract: In this paper, we focus on Multi-User MIMO Broadcast Channels with few users feeding back their channel estimates, i.e. K linear in the number M of transmitting antennas. Under this condition, the chance of finding a subset of users almost orthogonal vanishes when M gets large. For this reason, we show that the Zero Forcing (ZF) beamformer, commonly accepted for practical implementations, can be easily outperformed by other schemes based on QR decomposition, approaching the channel capacity. Our beamformer construction is less complex than ZF greedy algorithms and more robust than semi-orthogonal construction. At high SNR, we show that even the sub-optimal Tomlinson-Harashima encoding technique outperforms the ZF beamforming, halving the gap with respect to Dirty Paper Coding.

3 citations

Posted Content
TL;DR: In this paper, a digital scheme that combines ideas from the lossless version of the problem, i.e., Slepian-Wolf coding over broadcast channels, and dirty paper coding, is presented and analyzed.
Abstract: This paper addresses lossy transmission of a common source over a broadcast channel when there is correlated side information at the receivers, with emphasis on the quadratic Gaussian and binary Hamming cases. A digital scheme that combines ideas from the lossless version of the problem, i.e., Slepian-Wolf coding over broadcast channels, and dirty paper coding, is presented and analyzed. This scheme uses layered coding where the common layer information is intended for both receivers and the refinement information is destined only for one receiver. For the quadratic Gaussian case, a quantity characterizing the overall quality of each receiver is identified in terms of channel and side information parameters. It is shown that it is more advantageous to send the refinement information to the receiver with "better" overall quality. In the case where all receivers have the same overall quality, the presented scheme becomes optimal. Unlike its lossless counterpart, however, the problem eludes a complete characterization.

3 citations

Posted Content
TL;DR: The information theoretic limits of two types of state-dependent models that capture a wide range of wireless communication scenarios where there are interference cognition among transmitters are investigated and the correlation between states impacts the achievability of the channel capacity in a different way from that of the regular IC.
Abstract: We investigate the information theoretic limits of two types of state-dependent models in this dissertation. These models capture a wide range of wireless communication scenarios where there are interference cognition among transmitters. Hence, information theoretic studies of these models provide useful guidelines for designing new interference cancellation schemes in practical wireless networks. In particular, we first study the two-user state-dependent Gaussian multiple access channel (MAC) with a helper. Inner and outer bounds on the capacity region are first derived, which improve the state-of-the-art bounds given in the literature. Further comparison of these bounds yields either segments on the capacity region boundary or the full capacity region by considering various regimes of channel parameters. We then study the two-user Gaussian state-dependent Z-IC and state-dependent IC. Three interference regimes are studied, and the capacity region or the sum capacity boundary is characterized either fully or partially under various channel parameters. The impact of the correlation between the states on the cancellation of state and interference as well as the achievability of the capacity is demonstrated via numerical analysis. Numerical investigation indicates that for the regular IC, the correlation between states impacts the achievability of the channel capacity in a different way from that of the Z-IC.

3 citations

Journal ArticleDOI
TL;DR: A special case of Gaussian MIMO broadcast channel, wherein receive power constraints are also included, is investigated, and sum capacity, capacity region, and application examples for the PGMBC are discussed, and SINR-matching duality-based precoding is applied on the protection-implied channel.
Abstract: A Gaussian MIMO broadcast channel (GMBC) models the MIMO transmission of Gaussian signals from a transmitter to one or more receivers. Its capacity region and different precoding schemes for it have been well investigated, especially for the case wherein there are only transmit power constraints. In this paper, a special case of GMBC is investigated, wherein receive power constraints are also included. By imposing receive power constraints, the model, called protected GMBC (PGMBC), can be applied to certain scenarios in spatial spectrum sharing, secretive communications, mesh networks and base station cooperation. The sum capacity, capacity region, and application examples for the PGMBC are discussed in this paper. Sub-optimum precoding algorithms are also proposed for the PGMBC, where standard user precoding techniques are performed over a BC with a modified channel, which we refer to as the “protection-implied BC.” In the protection-implied BC, the receiver protection constraints have been implied in the channel, which means that by satisfying the transmit power constraints on the protection implied channel, receiver protection constraints are guaranteed to be met. Any standard single-user or multi-user MIMO precoding scheme may then be performed on the protection-implied channel. When SINR-matching duality-based precoding is applied on the protection-implied channel, sum-capacity under full protection constraints (zero receive power), and near-sum-capacity under partial protection constraints (limited non-zero receive power) are achieved, and were verified by simulations.

3 citations

Proceedings ArticleDOI
03 Apr 2012
TL;DR: This paper uses an approach based on iterative random orthogonal beamforming and correlation between the subcarriers which exploits orthogonality conditions of the scheduled users with reduced feedback and improves the throughput of the system with lower complexity.
Abstract: It has been shown in the literature that capacity region of the Gaussian broadcast channels is achieved by dirty paper coding but due to full channel state information requirement and high complexity, its application is limited. Several multiple-input multiple-output (MIMO) techniques have been proposed for the orthogonal frequency-division multiplexing (OFDM) systems. In this paper, we consider a cellular system employing MIMO-OFDM technique and beamforming with the goal of maximizing the system throughput. We use an approach based on iterative random orthogonal beamforming and correlation between the subcarriers which exploits orthogonality conditions of the scheduled users with reduced feedback. By simulation results, it is observed that this approach improves the throughput of the system with lower complexity.

3 citations

Network Information
Related Topics (5)
Fading
55.4K papers, 1M citations
89% related
Base station
85.8K papers, 1M citations
87% related
Wireless network
122.5K papers, 2.1M citations
86% related
Wireless
133.4K papers, 1.9M citations
84% related
Network packet
159.7K papers, 2.2M citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20236
202217
202121
202013
201926
201823