Explicit and almost sure conditions for K/2 degrees of freedom

It is well known that in K-user constant single-antenna interference channels K/2 degrees of freedom (DoF) can be achieved for almost all channel matrices. Explicit conditions on the channel matrix to admit K/2 DoF are, however, not available. The purpose of this paper is to identify such explicit c...

Full description

Saved in:
Bibliographic Details
Published in2014 IEEE International Symposium on Information Theory pp. 471 - 475
Main Authors Stotz, David, Bolcskei, Helmut
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2014
Subjects
Entropy
Fractals
Information theory
Interference channels
Random variables
Vectors
Online AccessGet full text

Cover

More Information
Summary:It is well known that in K-user constant single-antenna interference channels K/2 degrees of freedom (DoF) can be achieved for almost all channel matrices. Explicit conditions on the channel matrix to admit K/2 DoF are, however, not available. The purpose of this paper is to identify such explicit conditions, which are satisfied for almost all channel matrices. We also provide a construction of corresponding asymptotically DoF-optimal input distributions. The main technical tool used is a recent breakthrough result by Hochman in fractal geometry [1].
ISSN:2157-8095
2157-8117
DOI:10.1109/ISIT.2014.6874877