DocumentCode
1779763
Title
Degrees of Freedom for multiple-multicast traffic
Author
Venkatakrishnan, Satheesh Bojja ; Viswanath, Pramod ; Kannan, S.
Author_Institution
Univ. of Illinois, Urbana, IL, USA
fYear
2014
fDate
June 29 2014-July 4 2014
Firstpage
836
Lastpage
840
Abstract
We propose a new coding scheme for interference alignment in a single hop fast fading wireless network with general message demands. For the X-Channel, the Degrees of Freedom (DoF) region achievable by the scheme is shown to touch a known outer-bound at several points. For multiple-multicast demands we show that the achievable region is at least half of the cut-set bound region. The key innovation in our scheme is the reduction of the vector space alignment problem to a combinatorial arrangement problem. Finally, we use the scheme to give a poly-logarithmic bound for the flow-cut gap in fast fading Gaussian wireless networks with multiple multicasts.
Keywords
Gaussian channels; combinatorial mathematics; encoding; fading channels; radiofrequency interference; telecommunication traffic; DoF region; X-Channel; coding scheme; combinatorial arrangement problem; degrees of freedom; fast fading Gaussian wireless networks; interference alignment; multiple-multicast traffic; poly-logarithmic bound; vector space alignment problem; Array signal processing; Information theory; Interference; Receivers; Transmitters; Vectors; Wireless networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory (ISIT), 2014 IEEE International Symposium on
Conference_Location
Honolulu, HI
Type
conf
DOI
10.1109/ISIT.2014.6874950
Filename
6874950
Link To Document