Dirty paper coding (DPC) - Fuhz Articles
Visually Impaired Edition.


Dirty paper coding (DPC) article, this Fuhz page will hopefully provide the answers to the who, what where and why on the Dirty paper coding (DPC) topic.
At the bottom of the page we often provide links to external documents relating to Dirty paper coding (DPC) which may also help your research. Every effort is made to ensure the content on this page is as accurate and error free as possible, however whenever researching information that requires the utmost accuracy such as a term paper it is always best to cross reference facts with numerous sources.

In telecommunications, dirty paper coding (DPC) is a technique for efficient transmission of digital data through a channel that is subject to some interference that is known to the transmitter. The technique consists of precoding the data so as to cancel the effect of the interference.

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

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

Contents

History

Instances of dirty paper coding include Costa precoding (1983) 1, 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, such as channel state and other user data. Hence, the design of a DPC-based system should include a procedure to feed side information to the transmitters.

Applications

Recently, there has been interest in DPC as a possible solution to optimize the efficiency of wireless networks, in particular multiuser MIMO networks 5 and into an interference aware coding technique for dynamic wireless networks 6.

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

See also

References

  1. ^ M. Costa (May 1983). "Writing on dirty paper". IEEE Trans. Information Theory 29: 439–441. doi:10.1109/TIT.1983.1056659. 
  2. ^ M. Tomlinson (March 1971). "New automatic equalizer employing modulo arithmetic". Electron. Lett. 7: 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: 537–544. doi:10.1109/TCOMM.2004.841997. 
  5. ^ 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. 
  6. ^ 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. 

Return to Fuhz Home - This article covering Dirty paper coding (DPC) is enhanced for the visually impaired.

Valid XHTML 1.0 Transitional Valid CSS!

Article from Wikipedia. All text is available under the terms of the GNU Free Documentation License - Our Privacy Policy - Thanks Auto Blog Commenter