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 2006
TL;DR: A multi-beam selection (MBS) scheme, which selects only the best subset of all the beams to maximize the sum-rate capacity under low SNR, and simulation results show that the proposed MBS scheme achieves great performance improvement when the SNR is low and the number of users is not very large.
Abstract: Previous work has shown that the capacity region of the Gaussian MIMO broadcast channels is achieved by dirty paper coding (DPC). However, due to high computation complexity of DPC and infeasibility of perfect channel state information (CSI) at the transmitter in many applications, this paper focuses on a reduced complexity transmission scheme named orthonormal random beamforming (ORBF) [16], which only requires partial CSI feedback at the transmitter. Different from the previous work, we analyze the performance of ORBF with moderate number of users and total transmit power constraint. The analysis results show that ORBF scheme is efficient under low SNR. Then we propose a multi-beam selection (MBS) scheme, which selects only the best subset of all the beams to maximize the sum-rate capacity under low SNR. The simulation results show that the proposed MBS scheme achieves great performance improvement when the SNR is low and the number of users is not very large.

23 citations

Journal ArticleDOI
TL;DR: A novel user grouping precoder is proposed which improves the sum rate performance of the zero-forcing (ZF) precoder specially when the channel is ill-conditioned and allows for tradeoff between performance and complexity.
Abstract: We consider the multiple input single output (MISO) Gaussian broadcast channel with $N_t$ antennas at the base station (BS) and $N_u$ single-antenna users in the downlink. We propose a novel user grouping precoder which improves the sum rate performance of the zero-forcing (ZF) precoder specially when the channel is ill-conditioned. The proposed precoder partitions all the users into small groups of equal size. Downlink beamforming is then done in such a way that, at each user’s receiver, the interference from the signal intended for users not in its group is nulled out. Intragroup interference still remains, and is cancelled through successive interference presubtraction at the BS using dirty paper coding (DPC). The proposed user grouping method is different from user selection, since it is a method for precoding of information to the selected (scheduled) users, and not for selecting which users are to be scheduled. The proposed precoder is a generalization of two special cases, one where each group has only one user (ZF precoder) and another where all users are in a single group (ZF-DP precoder). A larger group size helps improve the sum rate performance but at the cost of greater complexity. The proposed generalization, therefore, allows for tradeoff between performance and complexity.

23 citations

Journal ArticleDOI
09 Jul 2006
TL;DR: A DPC based code design for BCs in which there is an individual rate/signal-to-interference-plus-noise ratio (SINR) constraint for each user and the first limit-approaching code design using nested turbo codes for DPC is developed.
Abstract: Recent information-theoretic results show the optimality of dirty-paper coding (DPC) in achieving the full capacity region of the Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). This paper presents a DPC based code design for BCs. We consider the case in which there is an individual rate/signal-to-interference-plus-noise ratio (SINR) constraint for each user. For a fixed transmitter power, we choose the linear transmit precoding matrix such that the SINRs at users are uniformly maximized, thus ensuring the best bit-error rate performance. We start with Cover's simplest two-user Gaussian BC and present a coding scheme that operates 1.44 dB from the boundary of the capacity region at the rate of one bit per real sample (b/s) for each user. We then extend the coding strategy to a two-user MIMO Gaussian BC with two transmit antennas at the base-station and develop the first limit-approaching code design using nested turbo codes for DPC. At the rate of 1 b/s for each user, our design operates 1.48 dB from the capacity region boundary. We also consider the performance of our scheme over a slow fading BC. For two transmit antennas, simulation results indicate a performance loss of only 1.4 dB, 1.64 dB and 1.99 dB from the theoretical limit in terms of the total transmission power for the two, three and four user case, respectively.

23 citations

Proceedings ArticleDOI
23 Dec 2013
TL;DR: The results imply that the capacity region of a state-dependent Gaussian Z-interference channel with mismatched transmitter- side state cognition and receiver-side state interference is strictly less than that of the corresponding channel without state, which is in contrast to Costa type of dirty channels, for which dirty paper coding achieves the capacity of the corresponds channels without state.
Abstract: A state-dependent Gaussian Z-interference channel model is investigated in the regime of high state power, in which transmitters 1 and 2 communicate with receivers 1 and 2, and only receiver 2 is interfered by transmitter 1's signal and a random state sequence. The state sequence is known noncausally only to transmitter 1, not to the corresponding transmitter 2. A layered coding scheme is designed for transmitter 1 to help interference cancelation at receiver 2 (using a cognitive dirty paper coding) and to transmit its own message to receiver 1. Inner and outer bounds are derived, and are further analyzed to characterize the boundary of the capacity region either fully or partially for all Gaussian channel parameters. Our results imply that the capacity region of such a channel with mismatched transmitter-side state cognition and receiver-side state interference is strictly less than that of the corresponding channel without state, which is in contrast to Costa type of dirty channels, for which dirty paper coding achieves the capacity of the corresponding channels without state.

22 citations

Proceedings ArticleDOI
22 May 2011
TL;DR: Simulations show that block diagonalization combined with the algebraic norm-maximizing (ANOMAX) transmit strategy provides the best balance between complexity and performance, the zero-forcing dirty paper coding (ZFDPC) based design can perform well when the system is heavily loaded, and the channel inversion (CI)based design yields the lowest complexity.
Abstract: Relays represent a promising approach to extend the cell coverage, combat the strong shadowing effects as well as guarantee the QoS in dense networks. Among the numerous existing relaying techniques, two-way relaying uses the radio resource in a particular efficient manner. Moreover, amplify and forward (AF) relays cause less delays and require lower hardware complexity. Therefore, we consider multi-user two-way relaying with MIMO AF relays where a base station (BS) and multiple users (UT) exchange messages via the relay in this paper. We propose three sub-optimal algorithms for computing the transmit and receive beamforming matrices at the BS as well as the amplification matrix at the relay. Simulations show that block diagonalization (BD) combined with the algebraic norm-maximizing (ANOMAX) transmit strategy provides the best balance between complexity and performance, the zero-forcing dirty paper coding (ZFDPC) based design can perform well when the system is heavily loaded, and the channel inversion (CI) based design yields the lowest complexity. All three algorithms outperform a recently proposed technique from the literature.

22 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