Genie Chains: Exploring Outer Bounds on the Degrees of Freedom of MIMO Interference Networks

Abstract

In this paper, we propose a novel genie chains approach to obtain information theoretic degrees of freedom (DoF) outer bounds for MIMO wireless interference networks. This new approach creates a chain of mappings from genie signals provided to a receiver to the exposed signal spaces at that receiver, which then serve as the genie signals for the next receiver in the chain subject to certain linear independence requirements, essentially converting an information theoretic DoF outer bound problem into a linear algebra problem. Several applications of the genie chains approach are presented.

58 pages, 10 figures. This paper was presented in part at IEEE ISIT 2012

References in corpus (2)

• Interference alignment for the MIMO interference channel
• Settling the feasibility of interference alignment for the MIMO interference channel: the symmetric square case

Cited by in corpus (5)

• On the Generic Capacity of $K$-User Symmetric Linear Computation Broadcast
• Secure Groupcast: Extra-Entropic Structure and Linear Feasibility
• The DoF of the Asymmetric MIMO Interference Channel with Square Direct Link Channel Matrices
• The DoF of the 3-user ($p,p+1$) MIMO Interference Channel
• Replication-based Outer bounds and the Optimality of "Half the Cake" for Rank-Deficient MIMO Interference Networks