Abstract: Alternating minimization and steepest descent are commonly used strategies to obtain interference alignment (IA) solutions in the K-user multiple-input multiple-output (MIMO) interference channel (IC). Although these algorithms are shown to converge monotonically, they experience a poor convergence rate, requiring an enormous amount of iterations which substantially increases with the size of the scenario. To alleviate this drawback, in this letter we resort to the Gauss-Newton (GN) method, which is well-known to experience quadratic convergence when the iterates are sufficiently close to the optimum. We discuss the convergence properties of the proposed GN algorithm and provide several numerical examples showing that it always converges to the optimum with quadratic rate, reducing dramatically the required computation time in comparison to other algorithms, hence paving a new way for the design of IA algorithms.

Autoría

Descargar referencia