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 published on a yearly basis
Papers
More filters
01 Sep 2004
TL;DR: This work employs iterative quantization and decoding using systematically doped repeat-accumulate codes to materialize a significant portion of the promised “dirty paper”-capacity in Costa's "writing on dirty paper"-channel model.
Abstract: Costa's “writing on dirty paper”-channel model poses one of the remaining challenges to the coding community. Theory suggests that arbitrary interference on the channel (known at the transmitter) can be cancelled without a power penalty by appropriate precoding and shaping. We employ iterative quantization and decoding using systematically doped repeat-accumulate codes to materialize a significant portion of the promised “dirty paper”-capacity. Code design is done using the EXIT chart technique.
3 citations
01 Nov 2011
TL;DR: This paper considers Rayleigh fading environment when regularized vector perturbation precoding (R-VPP) method is used at the transmitter, and provides a closed form approximation for the mean squared error (MSE) which is shown to work well for the whole range of SNR.
Abstract: In this paper, we analyze the sum rate performance of multiuser multi-antenna downlink channel. We consider Rayleigh fading environment when regularized vector perturbation precoding (R-VPP) method is used at the transmitter. The sum rate characterization of R-VPP is difficult because of the correlation between the multiuser interference and the data symbols. We derive expressions for the sum rate in terms of the variance of the received signal. We also provide a closed form approximation for the mean squared error (MSE) which is shown to work well for the whole range of SNR. Further, we also propose a simpler expression for R-VPP sum rate based on MSE. The simulation results show that the proposed expressions for R-VPP sum rate closely match the sum rate found by the entropy estimation, and also confirm that R-VPP performs very close to dirty paper coding (DPC) for all SNR values.
3 citations
07 May 2014
TL;DR: For the Gaussian DD-TWC with noise/input-dependent interference, adaptation is useless from a capacity point of view and a capacity outer bound in the adaptive mode is obtained which is coincided with capacity inner bound derived in the non-adaptive mode.
Abstract: In this paper, we characterize the capacity regions of the Gaussian doubly dirty two-way channel (DD-TWC) in the presence of noise-dependent interference as well as input-dependent interference, and thereby we quantify the impact of such dependencies on the capacity region of the Gaussian DD-TWC. We also show that for the Gaussian DD-TWC with noise/input-dependent interference, adaptation (the use of formerly received signals in encoding process) is useless from a capacity point of view. The above-mentioned claims are proved by obtaining a capacity outer bound in the adaptive mode which is coincided with capacity inner bound derived in the non-adaptive mode.
3 citations
TL;DR: A two-hop multiple-input multiple-output (MIMO) relay network which comprises a multiple antenna source, an amplify-and-forward MIMO relay and many potential users is studied and it can be easily obtained how far away TDMA and BF are from being optimal in terms of the achievable sum rate.
Abstract: A two-hop multiple-input multiple-output (MIMO) relay network which comprises a multiple antenna source, an amplify-and-forward MIMO relay and many potential users are studied in this paper. Consider the achievable sum rate as the performance metric, a joint design method for the processing units of the BS and relay node is proposed. The optimal structures are given, which decompose the multiuser MIMO relay channel into several parallel single-input single-output relay channels. With these structures, the signal-to-noise ratio at the destination users is derived; and the power allocation is proved to be a convex problem. We also show that high sum rate can be achieved by pairing each link according to its magnitude. The sum rate of three broadcast strategies, time division multiple access (TDMA) to the strongest user, dirty paper coding (DPC), and beamforming (BF) are investigated. The sum rate bounds of these strategies and the sum capacity (achieved by DPC) gain over TDMA and BF are given. With these results, it can be easily obtained that how far away TDMA and BF are from being optimal in terms of the achievable sum rate.
3 citations
TL;DR: In this article, the authors proposed a user grouping based precoder which improves the sum rate performance of the zero-forcing (ZF) precoder specially when the channel is ill-conditioned.
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. Intra-group interference still remains, and is cancelled through successive interference pre-subtraction 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. Through analysis and simulations, the proposed user grouping based precoder is shown to achieve significant improvement in the achievable sum rate when compared to the ZF precoder. When users are paired (i.e., each group has two users), the complexity of the proposed precoder is $O(N_u^3) + O(N_u^2 N_t)$ which is the same as that of the ZF precoder.
3 citations