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
Journal ArticleDOI
TL;DR: In this paper, the capacity region of a Gaussian state-dependent multi-access channel with one informed encoder was derived for the general discrete memoryless case and for the binary noiseless case, where one of the encoders has noncausal access to the channel state.
Abstract: We consider a state-dependent multiaccess channel (MAC) with state noncausally known to some encoders. For simplicity of exposition, we focus on a two-encoder model in which one of the encoders has noncausal access to the channel state. The results can in principle be extended to any number of encoders with a subset of them being informed. We derive an inner bound for the capacity region in the general discrete memoryless case and specialize to a binary noiseless case. In binary noiseless case, we compare the inner bounds with trivial outer bounds obtained by providing the channel state to the decoder. In the case of maximum entropy channel state, we obtain the capacity region for binary noiseless MAC with one informed encoder. For a Gaussian state-dependent MAC with one encoder being informed of the channel state, we present an inner bound by applying a slightly generalized dirty paper coding (GDPC) at the informed encoder and a trivial outer bound by providing channel state to the decoder also. In particular, if the channel input is negatively correlated with the channel state in the random coding distribution, then GDPC can be interpreted as partial state cancellation followed by standard dirty paper coding. The uninformed encoders benefit from the state cancellation in terms of achievable rates, however, it seems that GDPC cannot completely eliminate the effect of the channel state on the achievable rate region, in contrast to the case of all encoders being informed. In the case of infinite state variance, we provide an inner bound and also provide a nontrivial outer bound for this case which is better than the trivial outer bound.

96 citations

Proceedings ArticleDOI
09 Jul 2006
TL;DR: The sum capacity loss of block diagonalization for a fixed channel is studied and an upper bound on the ergodic sum capacity gain of DPC over BD is derived, which can be evaluated with a few numerical integrations.
Abstract: The sum capacity of a Gaussian broadcast MIMO channel can be achieved with Dirty Paper Coding (DPC). Deploying DPC in real-time systems is, however, impractical. Block Diagonalization (BD) is an alternative precoding technique for downlink multiuser MIMO systems, which can eliminate inter-user interference at each receiver, at the expense of suboptimal sum capacity vs. DPC. In this paper, we study the sum capacity loss of BD for a fixed channel. We show that 1) if the user channels are orthogonal to each other, then BD achieves the complete sum capacity; and 2) if the user channels lie in a common row vector space, then the gain of DPC over BD can be bounded by the minimum of the number of transmit and receive antennas and the number of users. We also compare the ergodic sum capacity of DPC with that of BD in a Rayleigh fading channel. Simulations show that BD can achieve a significant part of the total throughput of DPC. An upper bound on the ergodic sum capacity gain of DPC over BD is derived, which can be evaluated with a few numerical integrations. With this bound, we can easily estimate how far away BD is from being optimal in terms of ergodic sum capacity, which is useful in directing practical system designs.

95 citations

Journal ArticleDOI
TL;DR: A coding scheme that collectively has advantages of cooperative coding, collaborative coding, and dirty paper coding, is developed for the interference channel with degraded message sets, and achievable rate regions of the IC-DMS in both discrete memoryless and Gaussian cases are derived.
Abstract: The interference channel with degraded message sets (IC-DMS) refers to a communication model, in which two senders attempt to communicate with their respective receivers simultaneously through a common medium, and one sender has complete and a priori (noncausal) knowledge about the message being transmitted by the other. A coding scheme that collectively has advantages of cooperative coding, collaborative coding, and dirty paper coding, is developed for such a channel. With resorting to this coding scheme, achievable rate regions of the IC-DMS in both discrete memoryless and Gaussian cases are derived. The derived achievable rate regions generally include several previously known rate regions as special cases. A numerical example for the Gaussian case further demonstrates that the derived achievable rate region offers considerable improvements over these existing results in the high-interference-gain regime.

95 citations

Journal ArticleDOI
TL;DR: It is proved that as the number of users K grows large, the ZFDPC-SUS approach can achieve the optimal sum rate scaling of the MIMO broadcast channel, and the interesting result that the semi-orthogonality constraint imposed by SUS, whilst facilitating a very low complexity user selection procedure, asymptotically does not reduce the multi-user diversity gain in either first ( K) or second-order (K) terms.
Abstract: This paper studies the sum rate performance of two low complexity eigenmode-based transmission techniques for the MIMO broadcast channel, employing greedy semi-orthogonal user selection (SUS). The first approach, termed ZFDPC-SUS, is based on zero-forcing dirty paper coding; the second approach, termed ZFBF-SUS, is based on zero-forcing beamforming. We first employ new analytical methods to prove that as the number of users K grows large, the ZFDPC-SUS approach can achieve the optimal sum rate scaling of the MIMO broadcast channel. We also prove that the average sum rates of both techniques converge to the average sum capacity of the MIMO broadcast channel for large K. In addition to the asymptotic analysis, we investigate the sum rates achieved by ZFDPC-SUS and ZFBF-SUS for finite K , and show that ZFDPC-SUS has significant performance advantages. Our results also provide key insights into the benefit of multiple receive antennas, and the effect of the SUS algorithm. In particular, we show that whilst multiple receive antennas only improves the asymptotic sum rate scaling via the second-order behavior of the multi-user diversity gain; for finite K, the benefit can be very significant. We also show the interesting result that the semi-orthogonality constraint imposed by SUS, whilst facilitating a very low complexity user selection procedure, asymptotically does not reduce the multi-user diversity gain in either first ( K) or second-order (K) terms.

92 citations

Posted Content
TL;DR: In this article, a coding scheme that combines cooperative coding, collaborative coding, and dirty paper coding for the interference channel with degraded message sets (IC-DMS) was proposed.
Abstract: The interference channel with degraded message sets (IC-DMS) refers to a communication model in which two senders attempt to communicate with their respective receivers simultaneously through a common medium, and one of the senders has complete and a priori (non-causal) knowledge about the message being transmitted by the other. A coding scheme that collectively has advantages of cooperative coding, collaborative coding, and dirty paper coding, is developed for such a channel. With resorting to this coding scheme, achievable rate regions of the IC-DMS in both discrete memoryless and Gaussian cases are derived, which, in general, include several previously known rate regions. Numerical examples for the Gaussian case demonstrate that in the high-interference-gain regime, the derived achievable rate regions offer considerable improvements over these existing results.

89 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