Paper Info
Title
Design of High-Dimensional Grassmannian Frames via Block Minorization Maximization
Abstract
In this letter, we present an iterative algorithm for constructing high-dimensional incoherent Grassmannian Frames (GFs) which are sets of unit-norm vectors that are minimax optimal: the maximum absolute value of their inner products is a minimum. We formulate the GF design as a nonconvex optimization problem and solve it via an efficient iterative algorithm. The bulk of each iteration of the prop...
Year
DOI
Venue
2021
10.1109/LCOMM.2021.3113308
IEEE Communications Letters
Keywords
DocType
Volume
Approximation algorithms,Optimization,Linear programming,Coherence,Convergence,Receivers,Minimization
Journal
25
Issue
ISSN
Citations 
11
1089-7798
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
R. Jyothi101.35
Prabhu Babu236525.37
Petre Stoica37959915.30