Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/240BC38D-0B75-4578-9FBA-F85D2FD1E5C1 | - |
| Αναγνωριστικό | 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 |
| Περιγραφή | Δημοσίευση σε επιστημονικό περιοδικό | el |
| Περίληψη | 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 |
| Τύπος | Peer-Reviewed Journal Publication | en |
| Τύπος | Δημοσίευση σε Περιοδικό με Κριτές | el |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
| Ημερομηνία | 2015-10-23 | - |
| Ημερομηνία Δημοσίευσης | 2010 | - |
| Θεματική Κατηγορία | Binary sequences | en |
| Θεματική Κατηγορία | code-division multiple-access (CDMA) | en |
| Θεματική Κατηγορία | code-division multiplexing | en |
| Θεματική Κατηγορία | maximization of quadratic forms | en |
| Θεματική Κατηγορία | optimization | en |
| Θεματική Κατηγορία | signal waveform design | en |
| Βιβλιογραφική Αναφορά | G. N. Karystinos and A. P. Liavas, “Efficient computation of the binary vector that maximizes a rank-deficient quadratic form,” IEEE Transactions on Information Theory, vol. 56, no. 7, pp. 3581 - 3593, Jul. 2010. doi: 10.1109/TIT.2010.2048450 | en |
Copyright © DIAS 2013
