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.

Beamformer designs for zero-forcing dirty paper coding

Abstract: We consider the beamformer design for zero-forcing dirty paper coding (ZF-DPC), a suboptimal transmission technique for MISO broadcast channels (MISO BCs). For the sum rate maximization problem under a total power constraint, the existing beamformer designs in the literature are based on the QR decomposition (QRD), which is used to satisfy the ZF constraints. However, the optimality of the QRD-based design has been unknown previously. In this paper, we prove that the QRD-based design is optimal for ZF-DPC for any performance measure under a sum power constraint. For the per-antenna power constraints, the QRD-based designs become suboptimal, and we propose an optimal design, using a convex optimization framework. Low-complexity suboptimal designs are also presented, and numerically shown to achieve a significant fraction of the sum rate provided by the optimal design.

Heuristic resource allocation for sum rate optimization in MIMO-OFDM systems using eigenvalue updates

Abstract: In this paper a heuristic resource allocation algorithm for sum rate maximization is presented. We consider an orthogonal frequency division multiplexing channel with multiple antennas at the base station as well as at the mobile stations. Our algorithm uses eigen-beamforming and dirty paper coding. The user interference is estimated and the eigenvalues of the affected beams are updated. Our algorithm is compared to the optimal but more complex solution. It is shown that the performance of the suggested algorithm is very close to the optimum.

Structured dirty-paper coding using low-density lattices

Abstract: This paper studies dirty-paper coding in a Gaussian broadcast channel with two receivers. It finds that an approximate version of dirty-paper coding using low-density lattices can be implemented with a complexity that is polynomial-time on average in the block length. The main difference between this paper and prior work is that a non-binary LDPC-based lattice codebook is used for each user, and one codebook is aligned with the other. The low-density nature enables tractable encoding and decoding algorithms, and the alignment gives structure to the overall signal transmitted and it enables us to perform the encoding and decoding efficiently.1

PAPR Reduction of OFDM Signals Based on Dirty Paper Coding

Abstract: We propose a new technique based on DPC (Dirty Paper Coding) to effectively reduce the PAPR (Peakto-Average Power Ratio) of OFDM (Orthogonal Frequency Division Multiplexing) signals without large computational overhead. At transmitter, the proposed scheme is composed of an antenna transmitting the original information signal and additional antenna transmitting the interference signal generated for the DPC decoding. In the encoding procedure of the information signal, the dither signal is fixed to the bit stream having the lowest PAPR so that the proposed scheme ensures the lowest PAPR and provides almost equal bit error rate performance of the conventional OFDM without any PAPR reduction schemes.