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.

Practical Dirty Paper Coding Schemes Using One Error Correction Code With Syndrome

Abstract: Dirty paper coding (DPC) offers an information-theoretic result for pre-cancellation of known interference at the transmitter. In this letter, we propose practical DPC schemes that use only one error correction code. Our designs focus on practical use from the viewpoint of complexity. For fair comparison with previous schemes, we compute the complexity of proposed schemes by the number of operations used. Simulation results show that compared to previous DPC schemes, the proposed schemes require lower transmission power to maintain the bit error rate to be within $10^{-5}$ .

Capacity bounds for MIMO shared relay channel with half-duplex constraint

Abstract: We consider a shared relay channel (SRC) where a single relay assists the communications between multiple source-destination links under the half-duplex (HD) constraint. Specifically, we derive lower and upper bounds on the capacity of 2-user AWGN MIMO SRC with two source-destination pairs. Two different coding strategies are presented based on super-position coding and on dirty paper coding, respectively. We compare the performance of the proposed SRC coding schemes with that of a TDMA strategy where each source-destination pair communicates in alternative time slots with the assistance of the relay. The proposed coding schemes for SRC results in significant performance improvement over TDMA strategy in terms of both ergodic capacity and outage probability.

Coded Cooperation Protocol Utilizing Superposition Modulation for Half-Duplex Scenario

Abstract: In this paper, we design a new turbo-based coded cooperation scheme for half-duplex scenario utilizing superposition modulation. The cooperative diversity utilizing superposition modulation which is classified into decode-and-forward protocol has been proposed. We extend this system to coded-cooperation protocol in order to improve the performance. In the proposed system, the transmitting node encodes the information based on a multiple-turbo code and transmits the signal superposed its own information with other node's one. While, using the signals at two continuous time slots, the destination node can iteratively decode the signal. Moreover, we apply the iterative detection to this system. As the results, the proposed system achieves better performance and can get closer to the dirty paper coding theory.

Trellis shaping based dirty paper coding scheme for the overlay cognitive radio channel

Abstract: In this paper, we propose a dirty paper coding (DPC) scheme that uses trellis shaping for the overlay cognitive radio channel, where a cognitive user and a primary user transmit concurrently in the same spectrum. Interference of the primary user is assumed to be known at the cognitive transmitter non-causally. Based on this knowledge, the shaping code selection, as a key feature of the proposal, is introduced which enables the constellation to be self adaptively changed. The performance of our proposed scheme is compared using simulations with that based on the conventional trellis shaping and it achieves excellent tradeoff between performance and complexity.

Throughput analysis in wideband MIMO broadcast channels with partial feedback

Abstract: It has been recently shown that opportunistic transmit beamforming using partial channel state information (CSI) achieves the same throughput scaling obtained from dirty paper coding for a broadcast channel with fixed number of transmit antennas and many receivers M. Sharif et al., (2005). In this paper, we study the generalization of this scheme to wideband broadcast channels. By using orthogonal frequency division multiplexing, an L-tap wideband channel can be decomposed to N parallel narrowband channels, where N is larger than L. Neighboring subchannels are therefore highly correlated, and it is intuitive to say that each group of neighboring subchannels (forming a cluster) can be characterized by one channel quality. We show in this paper that users need only feedback the best signal-to-noise-plus-interference ratio at the center of each cluster. Our results indicate that for cluster size of order N/L/spl radic/K, where K is the number of users, this feedback scheme maintains the same throughput scaling as when full CSI is known. Simulation results show that larger cluster sizes (N/2L) can also be implemented for a small throughput hit.