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.

A Low Complexity Precoding Transceiver Design for Double STBC System

Abstract: A precoding design for double space-time block coding (STBC) system is investigated in this paper, i.e., the joint processing of STBC and dirty paper coding (DPC) techniques. These techniques are used for avoiding dual spatial streams interference and improving the transmitter diversity. The DPC system is interference free on multi-user or multi-antenna. The STBC transceiver can provide the transmit diversity. Due to the benefits about the STBC and DPC system, we propose a new scheme called STBC-DPC system. The transceiver design involves the following procedures. First, the ordering QR decomposition of channel matrix and the maximum likelihood (ML) one-dimensional searching algorithm are proposed to acquire a reliable performance. Next, the channel on/off assignment using water filling algorithm is proposed to overcome the deep fading channel problem. Finally, the STBC-DPC system with the modulus operation to limit the transmit signal level, i.e., Tomlinson-Harashima precoding (THP) scheme, is proposed to retain low peak-to-average power ratio (PAPR) performance. Simulation results confirm that the proposed STBC-DPC/THP with water filling ML algorithm can provide the low PAPR and excellent bit error rate (BER) performances.

Cognitive Radio MIMO Gaussian Broadcast Channels with the Power Constraint

Abstract: The cognitive radio multiple-input multiple-output Gaussian broadcast channels are studied where multiple antennas are available for both primary users and secondary users in a spectrum sharing environment, and the sum-rate capacity is also obtained under both the SUs' transmit power constraint and interference power constraint at the primary receivers. The paper principally consists of two steps. First, a duality technique and dirty paper coding are adopted to simplify the channels. Second, we propose an iterative power allocation algorithm to obtain the maximum sum-rate capacity and examine the effects of the constraint parameters on the concerned quantities. Finally, numerical simulation results are presented to validate the proposed theoretical analysis.

Toward a Practical Scheme for Binary Broadcast Channels with Varying Channel Quality Using Dirty Paper Coding

Abstract: We consider practical schemes for binary dirty-paper channels and broadcast channels (BCs) with two receivers and varying channel quality. With the BC application in mind, this paper proposes a new design for binary dirty paper coding (DPC). By exploiting the concept of coset binning, the complexity of the system is greatly reduced when compared to the existing works. Some design challenges of the coset binning approach are identified and addressed. The proposed binary DPC system achieves similar performance to the state-of-the-art, superposition-coding-based system while demonstrating significant advantages in terms of complexity and flexibility of system design. For binary BCs, achieving the capacity generally requires the superposition of a normal channel code and a carefully designed channel code with non-uniform bit distribution. The non-uniform bit distribution is chosen according to the channel conditions. Therefore, to achieve the capacity for binary BCs with varying channel quality, it is necessary to use quantization codes of different rates, which significantly increases the implementation complexity. In this paper, we also propose a broadcast scheme that generalizes the concept of binary DPC, which we term soft DPC. By combining soft DPC with time sharing, we achieve a large percentage of the capacity for a wide range of channel quality with little complexity overhead. Our scheme uses only one fixed pair of codes for users 1 and 2, and a single quantization code, which possesses many practical advantages over traditional time sharing and superposition coding solutions and provides strictly better performance.

Performance evaluation of the cognitive piggyback overlay systems with dirty paper coding

Abstract: This manuscript considers a secondary system sharing the spectrum with the primary system at the same time and on teh same frequency. We propose a cognitive overlay system in which the secondary system relays the primary signal and piggybacks its own data on it. Furthermore, the secondary system uses the channel coding based on the dirty paper coding (DPC). The result of the analysis shows that the proposed scheme allows the secondary system to communicate at the same speed as the primary system without any harm to it.

A user selection criterion for vector-perturbation precoding in multiuser systems

Abstract: In order to support multiple users simultaneously in a multi-antenna downlink system, the zero-forcing (ZF) precoding and dirty paper coding (DPC) approaches have been proposed. It is well-known that the user selection plays a crucial role in improving the performance of multiuser precoding with ZF and DPC. While the user selection criteria based on the sum-rate maximization are extensively studied for ZF and DPC, it is relatively not well investigated for the vector perturbation (VP) approach, which is known to be near optimal. In this paper, we derive a user selection criterion for VP and a greedy algorithm for the user selection in a multiuser system.