Laue, Heinrich Edgar ArnoldDu Plessis, Warren Paul2017-09-052017-09-052017-06Laue, 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.1070-9908 (online)1558-2361 (print)10.1109/LSP.2017.2690466http://hdl.handle.net/2263/62182An 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.en© 2017 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.Sensing matrixRank-1 Grassmannian codebooksOptimizationCoherenceCompressive sensing (CS)Postprint Article