Fast Convergence Algorithms for Coherence Optimization of Rank-1 Grassmannian Codebooks
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...
Main Authors: | F. Akram, I. Rashid, A. Ghafoor, A. M. Siddiqui |
---|---|
Format: | Article |
Language: | English |
Published: |
Spolecnost pro radioelektronicke inzenyrstvi
2019-06-01
|
Series: | Radioengineering |
Subjects: | |
Online Access: | https://www.radioeng.cz/fulltexts/2019/19_02_0456_0463.pdf |
Similar Items
-
Entanglement of Grassmannian Coherent States for Multi-Partite n-Level Systems
by: Ghader Najarbashi, et al.
Published: (2011-01-01) -
Restricted Grassmannian permutations
by: Juan B. Gil, et al.
Published: (2022-03-01) -
Non-Projected Supermanifolds and Embeddings in Super Grassmannians
by: Simone Noja
Published: (2018-11-01) -
Codebook Based Digital Speech Compression
by: Nazish Nawaz Hussaini, et al.
Published: (2007-12-01) -
Real Hypersurfaces in Complex Grassmannians of Rank Two
by: Dehe Li, et al.
Published: (2021-12-01)