Characterizing degrees of freedom through additive combinatorics
AuthorsDavid Stotz and Helmut Bölcskei
ReferenceIEEE Transactions on Information Theory, Vol. 62, No. 11, pp. 6423-6435, Nov. 2016.
AbstractWe establish a formal connection between the problem of characterizing degrees of freedom (DoF) in constant single-antenna interference channels (ICs) with general channel matrix and the field of additive combinatorics. The theory we develop is based on a recent breakthrough result by Hochman in fractal geometry. Our first main contribution is an explicit condition on the channel matrix to admit full, i.e., K/2 DoF; this condition is satisfied for almost all channel matrices. We also provide a construction of corresponding full DoF-achieving input distributions. The second main result is a new DoF-formula exclusively in terms of Shannon entropy. This formula is more amenable to both analytical statements and numerical evaluations than the DoF-formula by Wu et al., which is in terms of Rényi information dimension. We then use the new DoF-formula to shed light on the hardness of finding the exact number of DoF in ICs with rational channel coefficients, and to improve the best known bounds on the DoF of a well-studied channel matrix.
Download this document:
Copyright Notice: © 2016 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.