Fast Convergence Algorithms for Coherence Optimization of Rank-1 Grassmannian Codebooks

Abstract

Best Complex Antipodal Spherical Codes (BCASC) and Coherence Based Grassmannian Codebooks (CBGC) are state of the art algorithms to produce minimal coherence codebooks, however have high running time (relatively more in BCASC search than CBGC algorithm) which restricts their wider application. BCASC and CBGC algorithms are modified in a novel way by incorporating additional parameters adapted to three categories of codebooknovercompleteness to check stagnance of optimization and divergent behaviour to achieve faster convergence. The proposed algorithms are compared with BCASC and CBGC algorithms to achieve similar coherence results in much less time.