TY - GEN
T1 - An upper bound on the capacity of vector dirty paper with unknown spin and stretch
AU - Kao, David T.H.
AU - Sabharwal, Ashutosh
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84890372155&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84890372155&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2013.6620232
DO - 10.1109/ISIT.2013.6620232
M3 - Conference contribution
AN - SCOPUS:84890372155
SN - 9781479904464
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 281
EP - 285
BT - 2013 IEEE International Symposium on Information Theory, ISIT 2013
T2 - 2013 IEEE International Symposium on Information Theory, ISIT 2013
Y2 - 7 July 2013 through 12 July 2013
ER -