Dirty paper coding

From Wikipedia, the free encyclopedia

In telecommunications, dirty paper coding (DPC) is a technique for efficient transmission of digital data through a channel subjected to some interference known to the transmitter. The technique consists of precoding the data in order to cancel the effect caused by the interference.

Dirty-paper coding achieves the channel capacity, without power penalty and without requiring the receiver to gain knowledge of the interference state.

Note that DPC at the encoder is an information-theoretic dual of Wyner-Ziv coding at the decoder [citation needed].

History

Instances of dirty paper coding include Costa precoding (1983).[1] Suboptimal approximations of dirty paper coding include Tomlinson-Harashima precoding (1971) [2][3] and the vector perturbation technique of Hochwald et al. (2005).[4]

Design considerations

DPC and DPC-like techniques requires knowledge of the interference state in a non causal manner, such as channel state information of all users and other user data. Hence, the design of a DPC-based system should include a procedure to feed side information to the transmitters.

Applications

In 2003, Caire and Shamai [5] applied DPC to the multi-antenna multi-user downlink, which is referred to as the 'broadcast channel' by information theorists. Since then, there has been widespread use of DPC in wireless networks[6] and into an interference aware coding technique for dynamic wireless networks.[7]

Recently, DPC has also been used for "informed digital watermarking".

See also

  • Multiple-input multiple-output communications
  • Advanced MIMO communications
  • Cognitive radio

References

  1. ↑ M. Costa (May 1983). "Writing on dirty paper". IEEE Trans. Information Theory 29 (3): 439–441. doi:10.1109/TIT.1983.1056659. 
  2. ↑ M. Tomlinson (March 1971). "New automatic equalizer employing modulo arithmetic". Electron. Lett. 7 (5–6): 138–139. doi:10.1049/el:19710089. 
  3. ↑ H. Harashima and H. Miyakawa (August 1972). "Matched-transmission technique for channels with intersymbol interference". IEEE Trans. Commun. COM-20: 774–780. 
  4. ↑ 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 (3): 537–544. doi:10.1109/TCOMM.2004.841997. 
  5. ↑ Caire, Guissepe; Shamai, Shlomo (July 2003). "On the Achievable Throughput of a Multiantenna Gaussian Broadcast Channel". IEEE TRANSACTIONS ON INFORMATION THEORY 49 (3). 
  6. ↑ 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. San Antonio, Texas. pp. 277–282. 
  7. ↑ 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. 
This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.