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
Book ChapterDOI
23 May 2004
TL;DR: In this article, a new informed image watermarking technique is proposed incorporating perceptual factors into dirty paper coding, and the maximum admissible distortion level is computed on a block by block basis, by using Watson's model of the Human Visual System (HVS).
Abstract: A new informed image watermarking technique is proposed incorporating perceptual factors into dirty paper coding. Due to the equi-energetic nature of the adopted codewords and to the use of a correlation-based decoder, invariance to constant value-metric scaling (gain attack) is automatically achieved. By exploiting the simple structure of orthogonal and Gold codes, an optimal informed embedding technique is developed, permitting to maximize the watermark robustness while keeping the embedding distortion constant. The maximum admissible distortion level is computed on a block by block basis, by using Watson’s model of the Human Visual System (HVS). The performance of the watermarking algorithm are improved by concatenating dirty paper coding with a turbo coding (decoding) step. The validity of the assumptions underlying the theoretical analysis is evaluated by means of numerical simulations. Experimental results confirm the effectiveness of the proposed approach.

7 citations

Journal ArticleDOI
TL;DR: It is demonstrated that MACBC duality holds, and iterative algorithms to compute the SR and WSR of the BC are presented, making use of duality.
Abstract: Linear relaying (LR) is the extension of amplify-and-forward to full-duplex operation, and consists of relay nodes transmitting (on every channel use) a linear combination of previously received signals. From a practical standpoint, it is one of the most profitable and easily deployed forwarding techniques, as only requires buffering and amplifying capabilities. In this paper, we propose to use it at multiple relays in order to enlarge the capacity region of single-antenna multiple-access (MAC) and broadcast channels (BC). Relays are assumed to be fixed, and without own data to transmit. The first part of our contribution is devoted to the MAC. Assuming channel awareness at the users and destination, the achievable rate region with LR is derived, and iterative algorithms are devised to compute the maximum sum-rate (SR) and weighted sum-rate (WSR). From both maximizations, the sources' temporal correlation to attain the boundary points of the region is obtained. In the second part, the BC with LR is studied. Its rate region, achievable through dirty paper coding, is shown to be equal to that of the MAC with a sum-power constraint. As a result, we demonstrate that MACBC duality holds. Making use of duality, iterative algorithms to compute the SR and WSR of the BC are presented.

7 citations

Journal ArticleDOI
TL;DR: The use of clean relaying by the secondary transmitter and/or receiver is proposed to improve the quality of the relayed signal and, thereby, increases the rate achievable by the primary user (SU).
Abstract: In this work, we consider an interference-mitigation based cognitive radio system where a secondary transmitter is to communicate with its corresponding receiver without affecting the communication between a primary transmitter-receiver pair. In this case, the secondary transmitter must satisfy a coexistence constraint which requires that no rate degradation occurs at the primary user (PU), even when the latter utilizes only a single-user decoder. To achieve a non-zero rate of the secondary user (SU) under this constraint, Jovicic and Viswanath previously proposed a scheme (referred to as the JV scheme) that utilizes relaying by the secondary transmitter to overcome the interference caused by the simultaneous transmission of the SU's message. In this case, the interference caused by the signals corresponding to PU's message at the secondary receiver (from both the direct and the relay links) is mitigated by employing dirty paper coding (DPC) at the secondary transmitter. However, the interference caused by the SU's message at the primary receiver is not eliminated in this case and, thus, will limit the power (and, hence, the rate) that can be used by the secondary transmitter to transmit its own message. In our work, the use of clean relaying by the secondary transmitter and/or receiver (i.e., relaying without simultaneous transmission of SU's own message) is proposed to improve the quality of the relayed signal and, thereby, increases the rate achievable by the SU. Two improved transmission schemes are proposed: (i) clean relaying by secondary transmitter (CT) and (ii) clean relaying by secondary transmitter and receiver (CTR). The CT scheme utilizes DPC to mitigate interference at the secondary receiver whereas the CTR scheme utilizes coding for multiple access channels with common messages to enable decoding of both PU's and SU's messages at the secondary receiver. The CT scheme can be viewed as a generalization of the JV scheme and, therefore, performs at least as well as the latter. The CTR scheme, on the other hand, is shown to outperform the CT scheme in terms of the multiplexing gain achievable under full channel state information at the transmitter (CSIT) and in terms of the rate achievable with statistical CSIT. Numerical simulations are provided to illustrate these advantages.

7 citations

Proceedings ArticleDOI
24 Jun 2007
TL;DR: Lower bounds on the capacity and explicit coding schemes for the binary-input dirty- paper channel are provided and the case of causal as well as non-causal side information is examined.
Abstract: We study a dirty paper channel model where the input is constrained to belong to a PAM constellation. In particular, we provide lower bounds on the capacity as well as explicit coding schemes for the binary-input dirty- paper channel. We examine the case of causal as well as non-causal side information.

7 citations

Proceedings ArticleDOI
27 Jun 2010
TL;DR: This paper proposes a new modulation method for an uncoded cognitive transmission (secondary user transmission) in presence of a Primary User (PU) for the AWGN channel and shows it has a remarkable performance with low amount of complexity.
Abstract: This paper proposes a new modulation method for an uncoded cognitive transmission (secondary user transmission) in presence of a Primary User (PU) for the AWGN channel Interference of the PU is assumed to be known at the transmitter of Cognitive User (CU) non-causally Based on this knowledge, for the design of the modulator and demodulator of the CU, a symbol by symbol approach is studied which can fulfill the coexistence conditions of the CU and the PU of the band In this scheme, the modulator and demodulator of CU are designed jointly by solving an optimization problem to mitigate the interference of the PU and minimize the symbol error probability (P e ) in CU's communication link without increasing the symbol error probability (P e ) of the PU The proposed method is a modulation approach in a single (complex-valued) dimension rather than a high dimensional coding scheme Although this one-dimensional method is not capacity achieving, we show it still has a remarkable performance with low amount of complexity An implementation algorithm for our modulation method is also presented and the performance of this method is evaluated by experimental results

7 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