Efficient computation of the M-phase vector that maximizes a rank-deficient quadratic formEfficient computation of the M-phase vector that maximizes a rank-deficient quadratic form Πλήρης Δημοσίευση σε Συνέδριο Conference Full Paper 2015-11-102008enThe 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.http://creativecommons.org/licenses/by-nc-nd/4.0/1086 - 1090Conf. on Inform. Sc. and Syst Proc. 2008 Conf. on Inform. Sc. and Syst. Papailiopoulos Dimitrios Karystinos Georgios Καρυστινος Γεωργιος Institute of Electrical and Electronics Engineers Quadratic form maximization multiple-input multiple-output