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
05 May 2008
TL;DR: Lower bounds are derived on the achievable rate of communication by proposing a coding scheme that partially compensates for the imprecise channel knowledge, based on analyzing the performance achievable using extended Tomlinson-Harashima like coding schemes.
Abstract: A dirty paper channel is considered, where the transmitter knows the interference sequence up to a constant multiplicative factor, known only to the receiver We derive lower bounds on the achievable rate of communication by proposing a coding scheme that partially compensates for the imprecise channel knowledgeWe focus on a communication scenario where the Gaussian noise is small while the interference is strong Our approach is based on analyzing the performance achievable using extended Tomlinson-Harashima like coding schemes When the power of the interference is finite, we show that this may be achieved by a judicious choice of the scaling parameter at the receiver We further show that the communication rate may be improved, for finite as well as infinite interference power, by allowing randomized scaling at the transmitter

6 citations

Journal ArticleDOI
TL;DR: This paper investigates the required transmit power for Tomlinson-Harashima-precoding in two user broadcast systems, and extends the results to MIMO systems and determines the achievable user rates.
Abstract: Tomlinson-Harashima-precoding can be used as dirty-paper-coding method for transmissions over a broadcast channel. However, applying it to the individual user messages the final transmit power may vary from the sum of single user powers. This paper investigates the required transmit power for Tomlinson-Harashima-precoding in two user broadcast systems. Additionally, upper and lower bounds on the required power are derived. First our considerations are done in scalar channels. Then we extend the results to MIMO systems. In order to judge the performance of THP applied as broadcast technique we finally determine the achievable user rates.

6 citations

Proceedings ArticleDOI
30 Nov 2009
TL;DR: A new linear coordinated beamforming algorithm which is applicable to the systems with an arbitrary number of antennas and users and which exploits the orthogonalized effective channels to yield the transmit beamforming and receive combining vectors.
Abstract: Recently linear processing strategies have been developed to approach the optimum performance of dirty paper coding with low complexity in multiuser multiple-input multiple-output (MIMO) downlink systems. In this paper, we propose a new linear coordinated beamforming algorithm which is applicable to the systems with an arbitrary number of antennas and users. Unlike other conventional methods, our scheme exploits the orthogonalized effective channels to yield the transmit beamforming and receive combining vectors. As the proposed scheme generates a solution in a non-iterative fashion, it is more feasible than other iterative schemes. Simulation results show that the performance of our proposed scheme is very close to the conventional iterative scheme with significantly reduced complexity. For a system equipped with four transmit and four receive antennas with two users, the proposed scheme exhibits the bit error rate (BER) comparable to the conventional scheme with a complexity reduction of 79%.

6 citations

Proceedings ArticleDOI
28 Jun 2009
TL;DR: A rate-limited version of the well known problem of coding for channels with random parameters, in particular, a state-dependent channel when the transmitter is supplied with the state information at a rate Re, is studied and a new upper bound on the capacity, C(Re), is obtained.
Abstract: We study a rate-limited version of the well known problem of coding for channels with random parameters which was studied by Gelfand and Pinsker [1]. In particular, we consider a state-dependent channel when the transmitter is supplied with the state information at a rate R e . We obtain a new upper bound on the capacity, C(R e ), for this channel. We explicitly evaluate this upper bound for the rate-limited dirty paper coding (DPC) problem and show that it strictly improves upon the DPC capacity for certain values of R e .

6 citations

Proceedings ArticleDOI
01 Oct 2006
TL;DR: This paper looks at the throughput and rate ratio achieved by schemes based on the idea of opportunistic beam-forming and employing a rate back-off mechanism in order to maximize the throughput in the case of imperfect CSI and determines the optimal scheduling parameters.
Abstract: We consider the throughput of a MIMO Gaussian broadcast channel with two generalizing assumptions: (1) differentiated quality of service, in the sense that the rates required by different users must satisfy certain rational constraints, and (2) imperfect channel side information (CSI), where we assume that the estimate of the underlying channel has some error with known distribution Theoretically, with full and perfect CSI in hand, dirty paper coding (DPC) can achieve any point on the capacity region, including the non-symmetrical boundary points However, the full CSI requirement and the computational complexity of DPC motivates the development of simpler schemes which require little feedback from the users and can obtain a large portion of the capacity of the channel In this paper we will look at the throughput and rate ratio achieved by schemes based on the idea of opportunistic beam-forming and employing a rate back-off mechanism in order to maximize the throughput in the case of imperfect CSI We will determine the optimal scheduling parameters and will show the order optimality of these schemes in the regime of large number of users

6 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