Back to Search
Start Over
An Upper Bound on the Capacity of Vector Dirty Paper with Unknown Spin and Stretch
- Source :
- ISIT
- Publication Year :
- 2013
- Publisher :
- arXiv, 2013.
-
Abstract
- Dirty paper codes are a powerful tool for combating known interference. However, there is a significant difference between knowing the transmitted interference sequence and knowing the received interference sequence, especially when the channel modifying the interference is uncertain. We present an upper bound on the capacity of a compound vector dirty paper channel where although an additive Gaussian sequence is known to the transmitter, the channel matrix between the interferer and receiver is uncertain but known to lie within a bounded set. Our bound is tighter than previous bounds in the low-SIR regime for the scalar version of the compound dirty paper channel and employs a construction that focuses on the relationship between the dimension of the message-bearing signal and the dimension of the additive state sequence. Additionally, a bound on the high-SNR behavior of the system is established.<br />Comment: to be presented at ISIT 2013
- Subjects :
- 010302 applied physics
FOS: Computer and information sciences
business.industry
Gaussian
Computer Science - Information Theory
Information Theory (cs.IT)
Scalar (mathematics)
Significant difference
Transmitter
020206 networking & telecommunications
02 engineering and technology
Topology
01 natural sciences
Upper and lower bounds
Dirty paper
Channel capacity
symbols.namesake
0103 physical sciences
0202 electrical engineering, electronic engineering, information engineering
symbols
Zero-forcing precoding
Telecommunications
business
Mathematics
Computer Science::Information Theory
Subjects
Details
- Database :
- OpenAIRE
- Journal :
- ISIT
- Accession number :
- edsair.doi.dedup.....44e1cca07688b6336125d135889b9927
- Full Text :
- https://doi.org/10.48550/arxiv.1305.3934