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.

Fading Broadcast Channels with One-Sided Feedback

Abstract: In this paper, we study the fading broadcast channel with perfect CSIR and one-sided feedback. One important scenario for multiuser wireless communications is the broadcast channel (BC) where a single transmitter sends independent information to many receivers, for example in the downlink of a cellular system. The capacity region of a fading BC with perfect channel state information at the transmitter (CSIT) and the receivers (CSIR) along with the capacity-achieving transmission strategy was found. However, knowing the channel perfectly at the transmitter requires 1) perfect channel measurements at the receiver and 2) a perfect feedback link to send the estimates to the transmitter. The second requirement is usually harder to meet than the former in a practical system, especially for all the users in the system. For the two-user broadcast channel, this means that only one user may be able to feedback its channel values instantaneously to the transmitter and so the feedback is one-sided. We find achievable rate regions for the fading BC with one-sided feedback for three possible broadcast transmission strategies-1) super-position coding (SPC), 2) dirty-paper coding (DPC) and 3) time-division multiplexing (TDM).

Generalized degrees of freedom for network-coded cognitive interference channel

Abstract: We study a two-user cognitive interference channel (CIC) where one of the transmitters (primary) has knowledge of a linear combination (over an appropriate finite-field) of the two information messages. We refer to this channel model as Network-Coded CIC, since the linear combination may be the result of some linear network coding scheme implemented in the backbone wired network. In this paper, we characterize the generalized degrees of freedom (GDoF) for the Gaussian Network-Coded CIC. For achievability, we use the novel Precoded Compute-and-Forward (PCoF) and Dirty Paper Coding (DPC), based on nested lattice codes. Through the GDoF characterization, we show that knowing “mixed data” (a linear combination of the information messages) provides an unbounded spectral efficiency gain over the classical CIC counterpart, if the ratio (in dB) of signal-to-noise (SNR) to interference-to-noise (INR) is larger than ceratin threshold. For example, when SNR = INR, the Network-Coded cognition yields a 100% gain over the classical Gaussian CIC.

Research on Achievable Rate of Interference Channel with Cooperative Transmission

Abstract: This paper studies the achievable data rate of the two-transmitter and two-receiver interference channel model with cooperative transmission. To implement the cooperation, a finite rate conferencing link is deployed at the transmitters side in order to share the message. A new transmit scheme with private message sharing is proposed based on the dirty paper coding. The achievable rate region is established in both strong interference regime and weak interference regime. In weak interference regime, the asymptotically rate region shows the conferencing link can improve the achievable rate region for cooperative receiver. In strong interference regime, the conferencing link not only improves the achievable rate for cooperative receiver but also improves the sum rate of the cooperative network. Numerical results demonstrate these theories in a Gaussian interference channel.

A Multi-Beam Forward Link Precoding Algorithm for Dirty Paper Zero-Forcing

Abstract: This article considers the severe co-channel interference caused by the efficient use of spectrum by multiple beams combined with full-frequency multiplexing. After establishing a forward link model that considers severe rainfall attenuation in higher frequency bands such as Ka, the classic low-complexity precoding algorithm for zero-forcing is improved, and a regularized zero-forcing precoding algorithm considering the influence of system noise is proposed. Based on the dirty paper coding idea, a low-complexity dirty paper regularization zero-forcing precoding algorithm is proposed, which maximizes the signal-to-interference and noise ratio, thereby increasing throughput.

Power optimization of link protocol in mimo based on cognitive radio

Abstract: The achievable rate of MIMO cognitive radio network when one primary user (PU) and multiple secondary users (SU) are present, where the latter adopt dirty paper coding (DPC) to cancel the interference of PU’s transmission at their receivers. We formulate an optimization problem to maximize the achievable rate of the system under the constraints of power limits of each transmitter, where the requirement of not affecting PU’s transmission rate is also incorporated. An algorithm is proposed to jointly determine the inflation factors in DPC method and the input covariance matrix of each SU. Simulations show that the proposed problem achieves better achievable rate when compared with the existing results without compromising PU’s transmission rate. Using location base protocols try to improve avaibility rate of SU (secondary user).and use threshold approach to allow certain node which take a part in CR.