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
13 Jun 2010
TL;DR: A lattice-based DPC scheme that provides good shaping and coding gains with moderate complexity at both the encoder and the decoder and a design for superposition coding that provides rates better than time-sharing over a Gaussian broadcast channel.
Abstract: Dirty paper coding (DPC) refers to methods for pre-subtraction of known interference at the transmitter of a multiuser communication system. There are numerous applications for DPC, including coding for broadcast channels. Recently, lattice-based coding techniques have provided several designs for DPC. In lattice-based DPC, there are two codes - a convolutional code that defines a lattice used for shaping and an error correction code used for channel coding. Several specific designs have been reported in the recent literature using convolutional and graph-based codes for capacity-approaching shaping and coding gains. In most of the reported designs, either the encoder works on a joint trellis of shaping and channel codes or the decoder requires iterations between the shaping and channel decoders. This results in high complexity of implementation. In this work, we present a lattice-based DPC scheme that provides good shaping and coding gains with moderate complexity at both the encoder and the decoder. We use a convolutional code for sign-bit shaping, and a low-density parity check (LDPC) code for channel coding. The crucial idea is the introduction of a one-codeword delay and careful parsing of the bits at the transmitter, which enables an LDPC decoder to be run first at the receiver. This provides gains without the need for iterations between the shaping and channel decoders. Simulation results confirm that at high rates the proposed DPC method performs close to capacity with moderate complexity. As an application of the proposed DPC method, we show a design for superposition coding that provides rates better than time-sharing over a Gaussian broadcast channel.

11 citations

Proceedings ArticleDOI
01 Sep 2014
TL;DR: This work explains why flash memories are dirty due to ICI and shows that additive encoding can significantly improve the probability of decoding failure by using the side information.
Abstract: The most important challenge in the scaling down of flash memory is its increased inter-cell interference (ICI). If side information about ICI is known to the encoder, the flash memory channel can be viewed as similar to Costa's “writing on dirty paper (dirty paper coding).” We first explain why flash memories are dirty due to ICI. We then show that “dirty flash memory” can be changed into “memory with defective cells” model by using only one pre-read operation. The asymmetry between write and erase operations in flash memory plays an important role in this change. Based on the “memory with defective cells” model, we show that additive encoding can significantly improve the probability of decoding failure by using the side information.

11 citations

Proceedings ArticleDOI
06 Jul 2008
TL;DR: It is shown that when transmitting a Gaussian source over an average-power-constrained Gaussian channel with mismatched bandwidth, there exists an uncountable set of hybrid digital analog schemes which are optimal under the minimum mean squared error criterion, which generalizes the recent result by Bross et al.
Abstract: We show that when transmitting a Gaussian source over an average-power-constrained Gaussian channel with mismatched bandwidth, there exists an uncountable set of hybrid digital analog schemes which are optimal under the minimum mean squared error criterion. This generalizes the recent result by Bross et al. that for the bandwidth matched case, there exists an uncountable set of optimal schemes, with the uncoded transmission and the separation approach being the two extremes. The proposed schemes for bandwidth expansion and compression both require proper combination of various components such as power splitting, bandwidth splitting, rate splitting, Wyner-Ziv coding and dirty-paper coding. This set of schemes includes all the existing known optimal schemes as special cases. We show that this set of schemes can be applied to the broadcast scenario with three receivers, when the receiver with median channel SNR achieves optimal distortion, and it offers distortion tradeoff between of the good receiver and bad receiver. Interestingly, though continuous, this tradeoff curve is in fact concave, implying that its performance is worse than a direct time-sharing approach in this three user scenario. We further show even in a more general broadcast setting with a continuum of receivers the time sharing scheme is better than any given scheme in this set; somewhat surprisingly, there exists a unique time-sharing ratio for this to hold.

11 citations

Proceedings ArticleDOI
27 Aug 2007
TL;DR: It is shown that reducing the variability of allocated rates can have a significant reduction on mean scheduler queue sizes and affects the performance of weighted alpha rule schedulers, which trade-off efficiency with fairness.
Abstract: This paper considers wireless broadcast systems with multi-antenna base stations. Preceding at the transmitter reduces interference between users allowing independent data streams to be sent to multiple users simultaneously. With typically more users than transmit antennas, efficient selection of user subsets is important. The paper compares the effectiveness of several user selection algorithms and identifies situations where they are suboptimal. The impact of zero-forcing (ZF) and dirty paper coding (DPC) precoding are considered. A modification to two current algorithms is proposed that reduces computational time while retaining effectiveness. Simulation is used to assess the modifications and suggest methods of setting parameters. The paper examines the variability of allocated data rates and shows how it affects the performance of weighted alpha rule schedulers, which trade-off efficiency with fairness. It is shown that reducing the variability of allocated rates can have a significant reduction on mean scheduler queue sizes.

11 citations

Journal ArticleDOI
Sha Hu1, Fredrik Rusek1
TL;DR: In this paper, a generalized zero-forcing (GZF) precoder was proposed for multiuser multiple-input-single-output (MISO) broadcasting channels, where only the entries along the main diagonal and the first lower-diagonals can take nonzero values.
Abstract: In this paper, we consider precoder designs for multiuser multiple-input-single-output broadcasting channels. Instead of using a traditional linear zero-forcing (ZF) precoder, we propose a generalized ZF (GZF) precoder in conjunction with successive dirty-paper coding (DPC) for data transmissions, namely, the GZF-DP precoder, where the suffix “DP” stands for “dirty-paper.” The GZF-DP precoder is designed to generate a band-shaped and lower triangular effective channel ${F}$ , such that only the entries along the main diagonal and the $ u $ first lower-diagonals can take non-zero values. Utilizing the successive DPC, the known non-causal inter-user interferences from the other (up to) $ u $ users are canceled through successive encoding. We analyze optimal GZF-DP precoder designs both for sum-rate and minimum user-rate maximizations. Utilizing Lagrange multipliers, the optimal precoders for both cases are solved in closed-forms in relation to optimal power allocations. For the sum-rate maximization, the optimal power allocation can be found through water filling, but with modified water levels depending on the parameter $ u $ , while for the minimum user-rate maximization that measures the quality of the service, the optimal power allocation is directly solved in closed-form, which also depends on $ u $ . Moreover, we propose two low-complexity user-ordering algorithms for the GZF-DP precoder designs for both maximizations, respectively. We show, through numerical results, that the proposed GZF-DP precoder with a small $ u $ value (≤ 3) renders significant rate increments compared with the previous precoder designs, such as the linear ZF and the user-grouping-based DPC precoders.

11 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