Το work with title Polynomial-complexity computation of the M-phase vector that maximizes a rank-deficient quadratic form by Κυριλλίδης Αναστάσιος is licensed under Creative Commons Attribution 4.0 International
Bibliographic Citation
Αναστάσιος Κυριλλίδης, "Polynomial-complexity computation of the M-phase vector that maximizes a rank-deficient quadratic form", Μεταπτυχιακή Διατριβή, Τμήμα Ηλεκτρονικών Μηχανικών και Μηχανικών Υπολογιστών, Πολυτεχνείο Κρήτης, Χανιά, Ελλάς, 2010.
https://doi.org/10.26233/heallink.tuc.13274
Introduction -- 2. Problem statement -- 3. Efficient maximization of rank-deficient quadratic form with a MPSK vector argument -- 4. Algorithmic developments