A coherence-based algorithm for optimizing rank-1 Grassmannian codebooks
Loading...
Date
Authors
Laue, Heinrich Edgar Arnold
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Electrical and Electronics Engineers
Abstract
An iterative algorithm for the numerical optimization of rank-1 Grassmannian codebooks is presented. This algorithm achieves the same results as the current state-of-the-art algorithm, but requires a median of 9.52 times less computation time. This improvement is achieved by reformulating the optimization problem to directly minimize coherence instead of maximizing the Euclidean distance between codewords, thereby removing the need to consider large numbers of complex antipodals. The runtime improvement achieved allows the optimization of the larger code-books required in many applications.
Description
Keywords
Sensing matrix, Rank-1 Grassmannian codebooks, Optimization, Coherence, Compressive sensing (CS)
Sustainable Development Goals
Citation
Laue, H.E.A. & Du Plessis, W.P. 2017, 'A coherence-based algorithm for optimizing rank-1 Grassmannian codebooks', IEEE Signal Processing Letters, vol.24, no. 6, pp. 823-827.