Fast Convergence Algorithms for Coherence Optimization of Rank-1 Grassmannian Codebooks
Loading...
Date
2019-06
ORCID
Advisor
Referee
Mark
Journal Title
Journal ISSN
Volume Title
Publisher
Společnost pro radioelektronické inženýrství
Altmetrics
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.
Description
Citation
Radioengineering. 2019 vol. 28, č. 2, s. 456-463. ISSN 1210-2512
https://www.radioeng.cz/fulltexts/2019/19_02_0456_0463.pdf
https://www.radioeng.cz/fulltexts/2019/19_02_0456_0463.pdf
Document type
Peer-reviewed
Document version
Published version
Date of access to the full text
Language of document
en