DocumentCode :
112439
Title :
Interference Networks With no CSIT: Impact of Topology
Author :
Naderializadeh, Navid ; Avestimehr, Amir Salman
Author_Institution :
Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA
Volume :
61
Issue :
2
fYear :
2015
fDate :
Feb. 2015
Firstpage :
917
Lastpage :
938
Abstract :
We consider partially connected K -user interference networks, where the transmitters have no knowledge about the channel gain values, but they are aware of network topology. We introduce several linear algebraic and graph theoretic concepts to derive new topology-based outer bounds and inner bounds on the symmetric degrees-of-freedom of these networks. We evaluate our bounds for two classes of networks to demonstrate their tightness for most networks in these classes, quantify the gain of our inner bounds over benchmark interference management strategies, and illustrate the effect of network topology on these gains.
Keywords :
graph theory; interference suppression; linear algebra; telecommunication network topology; benchmark interference management strategy; channel gain value; gain quantification; graph theoretic concept; linear algebraic theoretic concept; network topology; partially-connected K-user interference networks; symmetric degrees-of-freedom; topology-based inner bound; topology-based outer bounds; Generators; Interference; Network topology; Noise; Receivers; Transmitters; Vectors; Network topology; channel state information; interference management; structured repetition coding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2014.2387162
Filename :
7000600
Link To Document :
بازگشت