Dirty paper coding
In telecommunications, dirty paper coding (DPC) is a good way to send digital data through a channel that is subject to some interference that is known to the sender. The sender does precoding of the data so as to cancel the effect of the interference.
Costa asked the following question: [1]
imagine we have a piece of paper covered with independent dirt spots ... and we write a message on it with a limited amount of ink.
The dirty paper, with the message on it, is then sent to someone else, and acquires more ... dirt along the way.
If the recipient cannot distinguish between the ink and the dirt, how much information can we reliably send?
When Costa asked his question, the Shannon–Hartley theorem (and the more general noisy-channel coding theorem) was well known. The Shannon–Hartley theorem tells us that, all else being equal, a paper sent along a path that picks up less dirt can reliably deliver more information than another paper sent along a path that picks up more dirt. People have also thought up many ways of dealing with such dirt added after the message is written—see error detection and correction for details.
Most people expected that the same thing would happen when dirt is added to the paper before the message was written—the more dirt, the less information can be reliably sent.
In 1983, Costa showed the surprising result that we can send just as much information on such a dirty piece of paper as we can when writing on a clean sheet of paper, and gave a way to get that capacity. [1] [2]
A dirty paper code is a way for the writer to adapt his message to the dirt already on the paper. The writer and the reader agree ahead of time on which dirty paper code they will use for the messages.
History
changePeople have thought up several dirty paper codes, including Costa precoding (1983),[3] Tomlinson-Harashima precoding (1971) [4][5] and the vector perturbation technique of Hochwald et al. (2005).[6]
A similar problem called "writing on dirty tape (WDT)" is more complicated. As of 2005, the capacity computation problem and the capacity-achieving problem for writing on dirty tape are unsolved .[2]
"Writing on wet paper" is a related problem in steganography .[7]
Applications
changeWireless networks
changeMany wireless networks use dirty paper coding, especially MIMO systems.[8]
In a wireless network, often a transmitter has many different messages, and each one needs to be sent to a different person.
The sum-rate capacity of a system that transmits all the messages at the same time—and uses dirty-paper codes to reduce the interference between messages—can be many times the sum-rate capacity of a similar system that only sends one message at a time (TDMA).[9]
Any one receiver is only concerned with the messages for that receiver—all the other messages the transmitter is simultaneously sending to everyone else are—to that receiver—irrelevant noise that only interferes with the desired message.
The "dirty paper" story can be seen as a parable for wireless communication.
- In both cases, a person wants to get a message to some other person.
- The limited amount of power at the radio transmitter is analogous to the limited amount of ink.
- The "other messages the transmitter is simultaneously sending" are analogous to the dirt is already on the paper.
- The transmitter—which knows exactly all the other messages it is simultaneously sending—is analogous to the writer—who knows where the dirt is on the paper.
- Other channel noise that the transmitter does not know about until after the message is sent—environmental noise, other transmitters, etc. -- is analogous to dirt added after the message is written.
Recently, there has been interest in DPC as a possible solution to optimize the efficiency of wireless networks, in particular multiuser MIMO networks [10] and into an interference aware coding technique for dynamic wireless networks.[11]
Digital watermarking
changePeople doing "informed digital watermarking" use dirty paper codes, using this analogy:[1]
- The "cover work" to be watermarked is analogous to the dirty paper.
- The person adding the watermark already knows what the cover work looks like, analogous to the writer who knows where the dirt is on the paper.
- The person adding the watermark wants the watermarked work to look the same as the original "cover work", so he makes only small modifications, analogous to the writer using only a limited amount of ink.
- Changes that happen during normal processing or malicious tampering are analogous to dirt added after the message is written.
- The person who tries to detect the watermark in the watermarked work is analogous to the reader.
- Trying to detect the watermark in the watermarked work, without seeing the original -- "blind detection"—is analogous to "cannot distinguish between dirt and ink".
Related pages
changeReferences
change- ↑ 1.0 1.1 1.2 Cox, Ingemar; Miller, Matthew; Bloom, Jeffrey (2001). Digital Watermarking. ISBN 978-0-08-050459-9.
- ↑ 2.0 2.1 "Writing on dirty paper with feedback" by Jialing Liu and Nicola Elia 2005 [1][2] Archived 2016-03-04 at the Wayback Machine
- ↑ M. Costa (May 1983). "Writing on dirty paper". IEEE Trans. Information Theory. 29: 439–441. doi:10.1109/TIT.1983.1056659.
- ↑ M. Tomlinson (March 1971). "New automatic equalizer employing modulo arithmetic". Electron. Lett. 7 (5–6): 138–139. doi:10.1049/el:19710089.
- ↑ H. Harashima and H. Miyakawa (August 1972). "Matched-transmission technique for channels with intersymbol interference". IEEE Trans. Commun. COM-20 (4): 774–780. doi:10.1109/TCOM.1972.1091221.
- ↑ 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. S2CID 2384238.
{{cite journal}}: CS1 maint: multiple names: authors list (link) - ↑ "Writing on Wet Paper" Jessica Fridrich, Miroslav Goljan, Petr Lisoněk, and David Soukal
- ↑ Scagliola, Michele; Perez-Gonzalez, Fernando; Guccione, Pietro (2011). "Gain-Invariant Dirty Paper Coding for Hierarchical OFDM". IEEE Transactions on Communications. 59 (12): 3323–3334. doi:10.1109/TCOMM.2011.101011.100544. S2CID 14824342.
- ↑ "Dirty Paper Coding vs. TDMA for MIMO Broadcast Channels" Archived 2007-06-14 at the Wayback Machine by Nihar Jindal & Andrea Goldsmith 2004
- ↑ 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.
- ↑ 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.
{{cite conference}}: CS1 maint: multiple names: authors list (link)