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 2011
TL;DR: This paper studies the state-dependent symmetric Gaussian interference channel, where the additive Gaussian state is non-causally known at both transmitters but unknown to either of the receivers, and characterize the theoretical gap between the achievable symmetric rate and the upper bound.
Abstract: In this paper, we study the state-dependent symmetric Gaussian interference channel, where the additive Gaussian state is non-causally known at both transmitters but unknown to either of the receivers. We apply the coding scheme in [5] with different dirty paper coding parameters. We study both strong and weak interference scenarios and characterize the theoretical gap between the achievable symmetric rate and the upper bound, which is shown to be less than 1/4 bit for the strong interference case and less than 3/4 bit for the weak interference case. Finally, we provide numerical evaluations of the achievable rates against the upper bound, which validates the theoretical analysis for both cases.
12 citations
02 Feb 2006
TL;DR: Robustness tests against different attacks, such as low-pass filtering, image scaling, and lossy compression, show that the scheme is a good candidate for high-rate image data-hiding applications.
Abstract: We present an image data-hiding scheme based on near-capacity dirty-paper codes. The scheme achieves high embedding rates by "hiding" information into mid-frequency DCT coefficients among each DCT block of the host image. To reduce the perceptual distortion due to data-hiding, the mid-frequency DCT coefficients are first perceptually scaled according to Watson's model. Then a rate-1/3 projection matrix in conjunction with a rate-1/5 capacity-approaching dirty-paper code is applied. We are able to embed 1500 information bits into 256×256 images, outperforming, under a Gaussian noise attack, currently the best known data-hiding scheme by 33%. Robustness tests against different attacks, such as low-pass filtering, image scaling, and lossy compression, show that our scheme is a good candidate for high-rate image data-hiding applications.
12 citations
09 Jul 2006
TL;DR: This paper compares the downlink user capacity of dirty paper coding and time-division multiple access in a single cell of a cellular network with single antennas at the transmitter and each of the receivers and suggests that TDMA may be an attractive alternative to DPC.
Abstract: Dirty paper coding has been shown to achieve the capacity region of a Gaussian broadcast channel. However, it is a complicated scheme and assumes knowledge of the interfering signals at the transmitter. In this paper, we compare the downlink user capacity of dirty paper coding and time-division multiple access (TDMA) in a single cell of a cellular network with single antennas at the transmitter and each of the receivers. Here we define user capacity as the expected value of the number of users/receivers to which the transmitter can simultaneously transmit at an equal rate. The system that we consider selects the users to which it will transmit from a population of mobile users. We derive closed-form expressions for the downlink user capacity using dirty paper coding and TDMA under a total transmit power constraint and a common target information rate at all the mobile users, as the user population tends to infinity. The results indicate that DPC provides a gain of at most 12% in user capacity over TDMA for the scenarios that we consider. Thus TDMA may be an attractive alternative to DPC because of the complexity of the latter.
12 citations
05 May 2008
TL;DR: It is shown that these coding schemes for lossy transmission of a source over a broadcast channel when there is correlated side information at the receivers can outperform both separate source and channel coding, and uncoded transmission.
Abstract: This paper deals with the design of coding schemes for lossy transmission of a source over a broadcast channel when there is correlated side information at the receivers. Using ideas from Slepian-Wolf coding over broadcast channels and dirty paper coding, new schemes are presented and their rate-distortion performance is derived. For the binary Hamming and quadratic Gaussian scenarios, when the source and the channel bandwidths are equal, it is shown that these schemes are sometimes optimal and that they can outperform both separate source and channel coding, and uncoded transmission.
11 citations
05 Jun 2011
TL;DR: An achievable secrecy capacity region is developed using secret dirty-paper coding scheme under the problem of secret communication over Nakagami-m fading multiple-input single-output (MISO) broadcast channel.
Abstract: We consider the problem of secret communication over Nakagami-m fading multiple-input single-output (MISO) broadcast channel, where transmitter sends messages to the destination users following two different transmission protocols. In the first transmission protocol, transmitter sends a confidential message to user 1, and user 2 acts as an eavesdropper. In this protocol, at first, we define the ergodic secrecy capacity for the full channel state information (CSI) case and then we consider the case of only main channel CSI at the transmitter. Finally, we define the secrecy capacity in case of open-loop spatial multiplexing transmission scheme and present the analytical expression for the lower bound of ergodic secrecy capacity. In the second transmission protocol, we consider the transmission of two independent messages to user 1 and user 2 with informationtheoretic secrecy, where each user would like to obtain its own confidential message in a reliable and safe manner. Under this communication scenario, an achievable secrecy capacity region is developed using secret dirty-paper coding scheme.
11 citations