Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/D70F328B-44A5-4A2E-B766-0F3A3918C94B | - |
| Αναγνωριστικό | https://doi.org/10.1109/GLOCOM.2003.1258561 | - |
| Γλώσσα | en | - |
| Μέγεθος | 4 | en |
| Τίτλος | Code division multiplexing performance of minimum total-squared-correlation binary signature sets | en |
| Δημιουργός | Karystinos Georgios | en |
| Δημιουργός | Καρυστινος Γεωργιος | el |
| Δημιουργός | Pados D. A. | en |
| Εκδότης | Institute of Electrical and Electronics Engineers | en |
| Περίληψη | The total-squared-correlation (TSC), maximum squared correlation (MSC), total asymptotic efficiency (TAE), and sum capacity (Csum) of underloaded signature sets as well as the TSC and Csum of overloaded signature sets are metrics that are optimized simultaneously over the real/complex field. We derive closed-form expressions for the MSC, TAE, and Csum of minimum-TSC binary signature sets. Our expressions disprove the general equivalence of these performance metrics over the binary field and establish conditions on the number of signatures and signature length under which simultaneous optimization can or cannot be possible. We comment that the sum capacity loss of the recently designed minimum-TSC binary sets is found to be rather negligible in comparison with minimum-TSC real/complex-valued (Welch-bound-equality) sets. | en |
| Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | el |
| Τύπος | Conference Full Paper | en |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by-nc-nd/4.0/ | en |
| Ημερομηνία | 2015-11-10 | - |
| Ημερομηνία Δημοσίευσης | 2003 | - |
| Βιβλιογραφική Αναφορά | G. N. Karystinos and D. A. Pados, “Code division multiplexing performance of minimum total-squared-correlation binary signature sets,” in Proc. IEEE , Communication Theory Symposium, (GLOBECOM '03)pp. 1862-1866, doi: 10.1109/GLOCOM.2003.1258561 | en |
Copyright © DIAS 2013
