53
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Interference Alignment as a Rank Constrained Rank Minimization

      Preprint
      ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          We show that the maximization of the sum degrees-of-freedom for the static flat-fading multiple-input multiple-output (MIMO) interference channel is equivalent to a rank constrained rank minimization problem (RCRM), when the signal spaces span all available dimensions. The rank minimization corresponds to maximizing interference alignment (IA) so that interference spans the lowest dimensional subspace possible. The rank constraints account for the useful signal spaces spanning all available spatial dimensions. That way, we reformulate all IA requirements to requirements involving ranks. Then, we present a convex relaxation of the RCRM problem inspired by recent results in compressed sensing and low-rank matrix completion theory that rely on approximating rank with the nuclear norm. We show that the convex envelope of the sum of ranks of the interference matrices is the normalized sum of their corresponding nuclear norms and introduce tractable constraints that are asymptotically equivalent to the rank constraints for the initial problem. We also show that our heuristic relaxation can be tuned for the multi-cell interference channel. Furthermore, we experimentally show that in many cases the proposed algorithm attains perfect interference alignment and in some cases outperforms previous approaches for finding precoding and zero-forcing matrices for interference alignment.

          Related collections

          Author and article information

          Journal
          2010-10-04
          2011-03-16
          Article
          1010.0476
          b4bfbb45-b01e-4353-b5bf-5f0d073a209b

          http://arxiv.org/licenses/nonexclusive-distrib/1.0/

          History
          Custom metadata
          27 pages, single column, 7 figures, TSP submission
          cs.IT cs.DC cs.NI math.IT

          Numerical methods,Information systems & theory,Networking & Internet architecture

          Comments

          Comment on this article