![Ιδρυματικό Αποθετήριο [SANDBOX]](images/dias.logo.png "Ιδρυματικό Αποθετήριο [SANDBOX]"){kind=logo}
Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/EB5104CD-A802-4127-9F12-43D0B6AFCD03 | - |
| Αναγνωριστικό | https://doi.org/10.1109/TIT.2010.2048450 | - |
| Γλώσσα | en | - |
| Μέγεθος | 12 | en |
| Τίτλος | Efficient computation of the binary vector that maximizes a rank-deficient quadratic form | en |
| Δημιουργός | Karystinos Georgios | en |
| Δημιουργός | Καρυστινος Γεωργιος | el |
| Δημιουργός | Liavas Athanasios | en |
| Δημιουργός | Λιαβας Αθανασιος | el |
| Εκδότης | Institute of Electrical and Electronics Engineers | en |
| Περίληψη | 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 Paper | en |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by-nc-nd/4.0/ | en |
| Ημερομηνία | 2015-11-10 | - |
| Ημερομηνία Δημοσίευσης | 2008 | - |
| Θεματική Κατηγορία | Binary sequences | en |
| Θεματική Κατηγορία | code-division multiple-access (CDMA) | en |
| Θεματική Κατηγορία | code-division multiplexing | en |
| Βιβλιογραφική Αναφορά | G. N. Karystinos and A. P. Liavas, “Efficient computation of the binary vector that maximizes a rank-deficient quadratic form,” in Proc. IEEE - Intern. Conf. Acoust., Speech and Signal Proc.,(ICASSP '08) pp.3577-3580, doi: 10.1109/TIT.2010.2048450 | en |
Copyright © DIAS 2013
