Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/DD27E75E-3E4F-4177-8D79-B3FABA179F1A | - |
| Αναγνωριστικό | https://doi.org/10.1109/CISS.2008.4558680 | - |
| Γλώσσα | en | - |
| Μέγεθος | 4 | en |
| Τίτλος | Efficient computation of the M-phase vector that maximizes a rank-deficient quadratic form | en |
| Δημιουργός | Papailiopoulos Dimitrios | en |
| Δημιουργός | Karystinos Georgios | en |
| Δημιουργός | Καρυστινος Γεωργιος | el |
| Εκδότης | Institute of Electrical and Electronics Engineers | en |
| Περίληψη | The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a function of it, then it can be maximized in polynomial time. An algorithm for the efficient computation of the M-phase vector that maximizes a rank-deficient quadratic form is developed based on an analytic procedure. Auxiliary hyperspherical coordinates are introduced and the multi-dimensional space is partitioned into a polynomial-size set of regions; each region corresponds to a unique M-phase vector. The M-phase vector that maximizes the rank-deficient quadratic form is shown to belong to the polynomial-size set of candidate vectors. Thus, the size of the feasible set is efficiently reduced from exponential to polynomial. | en |
| Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | el |
| Τύπος | Conference Full Paper | en |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by-nc-nd/4.0/ | en |
| Ημερομηνία | 2015-11-10 | - |
| Ημερομηνία Δημοσίευσης | 2008 | - |
| Θεματική Κατηγορία | Quadratic form | en |
| Θεματική Κατηγορία | maximization | en |
| Θεματική Κατηγορία | multiple-input multiple-output | en |
| Βιβλιογραφική Αναφορά | D. S. Papailiopoulos and G. N. Karystinos, “Efficient computation of the M-phase vector that maximizes a rank-deficient quadratic form,” in Proc. Conf. on Inform. Sc. and Syst. (CISS '08), pp. 1086-1090 doi: 10.1109/CISS.2008.4558680 | en |
Copyright © DIAS 2013
