Dirty paper coding
From Wikipedia, the free encyclopedia
Dirty paper coding (DPC) is a coding technique that pre-cancels a known interference where it is known at the transmitter before self-data transmission. DPC achieves the link capacity without power penalty as much as a capacity with no interference regardless of interference state information knowledge at the receiver. Examples of Dirty paper coding include Costa precoding [1], Tomlinson-Harashima precoding[2][3] and the vector perturbation technique[4].
Note that DPC at the encoder is an information-theoretic dual of Wyner-Ziv coding at the decoder.
[edit] Applications
Recently, DPC has been widely researched as a solution for optimizing future wireless networks. For example, it is essential to apply the DPC concept into a precoding technique for multiuser MIMO wireless networks [5] and into an interference aware coding technique for dynamic wireless networks[6]. One important remark for the practical use of DPC is that either DPC or a DPC-like technique requires the side information such as interference status information where interference status information includes channel state information and other user data information. Hence, to design DPC-based systems we should consider the procedure to feed the side information to the transmitter(s).
Recently, DPC has also been adopted in informed digital watermarking techniques.
[edit] See also
- Multiple-input multiple-output communications
- Advanced MIMO communications
- Precoding
- Computing
- Watermark - Digital watermarking
- Cognitive radio
- Information theory
[edit] References
- ^ M. Costa (May 1983). "Writing on dirty paper". IEEE Trans. Information Theory 29: 439–441. doi:.
- ^ M. Tomlinson (Mar. 1971). "New automatic equalizer employing modulo arithmetic". Electron. Lett. 7: 138–139. doi:.
- ^ H. Harashima and H. Miyakawa (Aug. 1972). "Matched-transmission technique for channels with intersymbol interference". IEEE Trans. Commun. COM-20: 774–780.
- ^ B. M. Hochwald, C. B. Peel, and A. L. Swindlehurst (March 2005.). "A vector-perturbation technique for near-capacity multiantenna multiuser communication - Part II: Perturbation". IEEE Trans. Commun. 53: 537–544. doi:.
- ^ C. T. K. Ng and A. Goldsmith (October 2004). "Transmitter Cooperation in Ad-Hoc Wireless Networks: Does Dirty-Paper Coding Beat Relaying?". IEEE Information Theory Workshop: 277-282.
- ^ Momin Uppal, Zhixin Liu, Vladimir Stankovic, Anders Høst-Madsen and Zixiang Xiong (February 2007). "Capacity Bounds and Code Designs for Cooperative Diversity". Information theory and applications.
