Institutional Repository [SANDBOX]
Technical University of Crete
EN  |  EL

Search

Browse

My Space

Polynomial-complexity computation of the M-phase vector that maximizes a rank-deficient quadratic form

Κυριλλίδης Αναστάσιος

Full record


URI: http://purl.tuc.gr/dl/dias/59E806A1-B5E7-42D6-906B-50DB588463C8
Year 2010
Type of Item Μεταπτυχιακή Διατριβή
License
Details
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
Appears in Collections

Summary

Introduction -- 2. Problem statement -- 3. Efficient maximization of rank-deficient quadratic form with a MPSK vector argument -- 4. Algorithmic developments

Available Files

Services

Statistics