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
Posted Content•
TL;DR: In this paper, the authors considered the single-mode bosonic channel with side information at the transmitter and showed that the effect of the classical interference can be canceled even when the decoder has no side information, and regardless of the input power constraint.
Abstract: The single-mode bosonic channel is addressed with classical interference in the modulation and with side information at the transmitter. This model can viewed as the quantum counterpart of the classical random-parameter Gaussian channel. Based on Costa's writing-on-dirty-paper result (1983), the effect of the channel parameter can be canceled even when the decoder has no side information, and regardless of the input power constraint. For both homodyne and heterodyne detection with a coherent-state protocol, the model reduces to a classical channel with either real or complex-valued Gaussian noise. Thereby, by applying Costa's dirty paper coding strategy, we observe that the effect of the classical interference can be canceled for those channels as well. Then, we consider the bosonic channel with joint detection, for which the classical results do not apply, and derive a dirty-paper coding lower bound. Furthermore, considering the special case of a pure-loss bosonic channel, we demonstrate that the optimal coefficient for dirty paper coding is not necessarily the MMSE estimator coefficient as in the classical setting.
11 May 2008
TL;DR: This work proposes a scheme that jointly reduces CSI feedback while approaching optimal DPC sum rates with smaller user-pool sizes, and offers the flexibility for spatial mode allocation to cater for individual transmission rate requirements.
Abstract: A major hindrance to the adoption of orthogonalized space-division multiplexing (SDM) via block diagonalization (BD) in multi-user MIMO downlinks is the need for channel state information (CSI) feedback from user terminals. Another drawback is lower than optimal sum rates, theoretically achievable with dirty paper coding (DPC). While multi-user diversity could be leveraged via user selection to narrow the sum- rate performance gap, it requires the presence of very large user pools. To help raise the practical feasibility of BD-SDM, we propose a scheme that jointly reduces CSI feedback while approaching optimal DPC sum rates with smaller user-pool sizes. Additionally, BD-SDM offers the flexibility for spatial mode allocation to cater for individual transmission rate requirements. This presents a challenging resource allocation problem because mode selection at one terminal affects the rates achieved at all other terminals and in turn, the overall sum rate. The proposed scheme offers a systematic means for resource allocation, while minimizing rate loss at the overall- and individual levels. It represents a streamlined process that simultaneously reduces CSI feedback while achieving sum rate maximization, user selection and systematic rate-loss minimizing resource allocation.
Patent•
23 Dec 2020
06 May 2015
TL;DR: It is demonstrated that a potentially suboptimal evaluation of the proposed lower bound can simultaneously outperform known state-of-art coding strategies including DPC with signal description or state description along with compress- and-forward, noisy network coding and decode-and-forward.
Abstract: We investigate the general relay channel with state that is noncausally known at the source We first present a multiletter characterization of the capacity using the Gelfand-Pinsker encoding scheme We then tailor the result to the general Gaussian relay channel with additive interference noncausally known at the source and compute a closed-form lower bound to the capacity using the joint dirty paper coding (DPC) and multidimensional linear relaying We finally demonstrate that a potentially suboptimal evaluation of the proposed lower bound can simultaneously outperform known state-of-art coding strategies including DPC with signal description or state description along with compress-and-forward, noisy network coding and decode-and-forward
24 Oct 2008
TL;DR: Simulation results indicate that the shaping gain of more than 3 dB is achieved by applying the different shaping codes for each user, and that frame error rate of the proposed scheme shows better performance than that of the conventional Tomlinson-Harashima precoding.
Abstract: Multiuser trellis shaping for space-time trellis codes (STTC) is proposed to realize dirty paper coding (DPC) in downlink multiuser channel, which is sometimes referred to as vector Gaussian broadcast channel. Our proposal considers not only the current transmit signal, but also the entire sequence of the signal for multiple users to achieve the higher capacity. In our proposal, the STTC is transmitted to each user and preceding is used to pre-subtract the interference among the users. An increase in transmit power due to the preceding is reduced by trellis shaping that adds trellis codewords to the information sequence for each user. The shaping code and the STTC are separated in order to systematically design both codes in our system. Simulation results indicate that the shaping gain of more than 3 dB is achieved by applying the different shaping codes for each user, and that frame error rate of the proposed scheme shows better performance than that of the conventional Tomlinson-Harashima precoding.