Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
EN  |  EL

Αναζήτηση

Πλοήγηση

Ο Χώρος μου

Efficient computation of the binary vector that maximizesa rank-deficient quadratic form

Liavas Athanasios, Karystinos,G.N

Απλή Εγγραφή

URIhttp://purl.tuc.gr/dl/dias/F03B2027-A451-4A0A-8F61-132FAB741B18-
Αναγνωριστικόhttp://www.telecom.tuc.gr/~karystinos/paper_TIT3.pdf-
Γλώσσαen-
Μέγεθος13 pagesen
ΤίτλοςEfficient computation of the binary vector that maximizes a rank-deficient quadratic formen
ΔημιουργόςLiavas Athanasiosen
ΔημιουργόςΛιαβας Αθανασιοςel
ΔημιουργόςKarystinos,G.Nen
ΠερίληψηThe maximization of a full-rank quadratic form over the binary alphabet can be performed through exponential-complexity exhaustive search. However, if the rank of the form is not a function of the problem size, then it can be maximized in polynomial time. By introducing auxiliary spherical coordinates, we show that the rank-deficient quadratic-form maximization problem is converted into a double maximization of a linear form over a multidimensional continuous set, the multidimensional set is partitioned into a polynomial-size set of regions which are associated with distinct candidate binary vectors, and the optimal binary vector belongs to the polynomial-size set of candidate vectors. Thus, the size of the candidate set is reduced from exponential to polynomial. We also develop an algorithm that constructs the polynomial-size candidate set in polynomial time and show that it is fully parallelizable and rank-scalable. Finally, we demonstrate the efficiency of the proposed algorithm in the context of adaptive spreading code design.en
ΤύποςΠλήρης Δημοσίευση σε Συνέδριοel
ΤύποςConference Full Paperen
Άδεια Χρήσηςhttp://creativecommons.org/licenses/by/4.0/en
Ημερομηνία2015-11-08-
Ημερομηνία Δημοσίευσης2008-
Βιβλιογραφική ΑναφοράG. N. Karystinos and A. P. Liavas.(2008).Efficient computation of the binary vector that maximizes a rank-deficient quadratic form.Presented at IEEE International Conference on Acoustics, Speech, and Signal Processing.[online].Available:http://www.telecom.tuc.gr/~karystinos/paper_TIT3.pdfen

Υπηρεσίες

Στατιστικά

 

Copyright © DIAS 2013