A lower bound on the data rate of dirty paper coding in general noise and interference
| Autor: | Daniel Yellin, Itsik Bergel, Shlomo Shamai |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2015 |
| Předmět: |
FOS: Computer and information sciences
Computer science Information Theory (cs.IT) Gaussian Computer Science - Information Theory Transmitter Data_CODINGANDINFORMATIONTHEORY Upper and lower bounds Noise (electronics) symbols.namesake Distribution (mathematics) Interference (communication) Control and Systems Engineering symbols Probability distribution Dirty paper coding Electrical and Electronic Engineering Algorithm Computer Science::Information Theory |
| Popis: | Dirty paper coding (DPC) allows a transmitter to send information to a receiver in the presence of interference that is known (non-causally) to the transmitter. The original version of DPC was derived for the case where the noise and the interference are statistically independent Gaussian random sequences. More recent works extended this approach to the case where the noise and the interference are mutually independent and at least one of them is Gaussian. In this letter we further extend the DPC scheme by relaxing the Gaussian and statistical independence assumptions. We provide lower bounds on the achievable data rates in a DPC setting for the case of possibly dependent noise, interference and input signals. Also, the interference and noise terms are allowed to have arbitrary probability distributions. The bounds are relatively simple, are phrased in terms of second-order statistics, and are tight when the actual noise distribution is close to Gaussian. Published in the IEEE Wireless Communications Letters |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|