A close-to-capacity dirty paper coding scheme

Stephan Ten Brink, Uri Erez

Research output: Contribution to journalConference articlepeer-review

Abstract

Various aspects of the dirty paper coding scheme are discussed. The dirty paper channel model is given by Y = X+S+N, where S is arbitrary interference and N is a statistically independent Gaussian random variables. Though, the link to precoding was made, the full capacity is expected to be achieved using lattices and MMSE scaling for arbitrary interference. Code design is done using the EXIT chart, achieving an improvement of 2dB over optimal scalar quantization.

Original languageEnglish
Pages (from-to)533
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - 2004
Externally publishedYes
EventProceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States
Duration: 27 Jun 20042 Jul 2004

Fingerprint

Dive into the research topics of 'A close-to-capacity dirty paper coding scheme'. Together they form a unique fingerprint.

Cite this