.png){kind=icon}
.png){kind=icon}
Return
A Quadratically Convergent Method for Interference Alignment in MIMO Interference Channels
.png){kind=icon}
OA
AI
DOI：10.1109/LSP.2014.2338132.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Alternating minimization
Gauss-Newton
interference alignment
interference channel
steepest descent
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W