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

Αναζήτηση

Πλοήγηση

Ο Χώρος μου

Rank-deficient quadratic-form maximization over M-phase alphabet: Polynomialcomplexitysolvability and algorithmic developments

Kyrillidis Anastasios, Karystinos Georgios

Απλή Εγγραφή


URIhttp://purl.tuc.gr/dl/dias/58DFFAC4-8C48-4E54-A0EB-5725C486F8C3-
Αναγνωριστικόhttps://doi.org/10.1109/ICASSP.2011.5947193-
Γλώσσαen-
Μέγεθος3en
ΤίτλοςRank-deficient quadratic-form maximization over M-phase alphabet: Polynomialcomplexity solvability and algorithmic developmentsen
Δημιουργός Kyrillidis Anastasiosen
ΔημιουργόςKarystinos Georgiosen
ΔημιουργόςΚαρυστινος Γεωργιοςel
ΕκδότηςInstitute of Electrical and Electronics Engineersen
ΠερίληψηThe maximization of a positive (semi)definite complex quadratic form over a finite alphabet is NP-hard and achieved through exhaustive search when the form has full rank. However, if the form is rank-deficient, the optimal solution can be computed with only polynomial complexity in the length N of the maximizing vector. In this work, we consider the general case of a rank-D positive (semi)definite complex quadratic form and develop a method that maximizes the form with respect to a M-phase vector with polynomial complexity. The proposed method efficiently reduces the size of the feasible set from exponential to polynomial. We also develop an algorithm that constructs the polynomial-size candidate set in polynomial time and observe that it is fully parallelizable and rank-scalable.en
ΤύποςΠλήρης Δημοσίευση σε Συνέδριοel
ΤύποςConference Full Paperen
Άδεια Χρήσηςhttp://creativecommons.org/licenses/by-nc-nd/4.0/en
Ημερομηνία2015-11-10-
Ημερομηνία Δημοσίευσης2011-
Βιβλιογραφική Αναφορά A. T. Kyrillidis and G. N. Karystinos, “Rank-deficient quadratic-form maximization over M-phase alphabet: Polynomialcomplexity solvability and algorithmic developments,” in Proc. IEEE - Intern. Conf. Acoust., Speech and Signal Proc.,(ICASSP '11) pp. 3856-3859, doi: 10.1109/ICASSP.2011.5947193 en

Υπηρεσίες

Στατιστικά