![Ιδρυματικό Αποθετήριο [SANDBOX]](images/dias.logo.png "Ιδρυματικό Αποθετήριο [SANDBOX]"){kind=logo}
Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/E42C6777-9660-4ADA-81FB-0DEEAE7FCAED | ||
| Έτος | 2011 | ||
| Τύπος | Δημοσίευση σε Περιοδικό με Κριτές | ||
| Άδεια Χρήσης |
|
||
| Βιβλιογραφική Αναφορά | H. Ganapathy, D. A. Pados, and G. N. Karystinos, “New bounds and optimal binary signature sets-Part I: Periodic total squared correlation,” IEEE Transactions on Communications, vol. 59,no. 4, pp. 1123 - 1132, Apr. 2011. doi: 10.1109/TCOMM.2011.020411.090404 https://doi.org/10.1109/TCOMM.2011.020411.090404 | ||
| Εμφανίζεται στις Συλλογές |
We derive new bounds on the periodic (cyclic) total squared correlation (PTSC) of binary antipodal signature sets for any number of signatures K and any signature length L. Optimal designs that achieve the new bounds are then developed for several (K,L) cases. As an example, it is seen that complete (K = L + 2) Gold sets are PTSC optimal, but not, necessarily, Gold subsets of K <; L + 2 signatures. In contrast, arguably against common expectation, the widely used Kasami sets are not PTSC optimal in general. The optimal sets provided herein are in this sense better suited for asynchronous and/or multipath code-division multiplexing applications.
Copyright © DIAS 2013
