Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/C240285C-6B1E-446F-A390-95E81BF2E727 | ||
| Έτος | 2001 | ||
| Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | ||
| Άδεια Χρήσης |
|
||
| Βιβλιογραφική Αναφορά | G. N. Karystinos and D. A. Pados, “Minimum total-squared-correlation design of DS-CDMA binary signature sets,” in Proc. IEEE , Communication Theory Symposium, (GLOBECOM '01) pp.801-805, doi: 10.1109/GLOCOM.2001.965529 https://doi.org/10.1109/GLOCOM.2001.965529 | ||
| Εμφανίζεται στις Συλλογές |
The Welch lower bound (see Welch, L.R., IEEE Trans. Inform. Theory, vol.20, p.397-9, 1974; Massey, J. L. and Mittelholzer, T., "Sequences II, Methods in Communication, Security, and Computer Sciences", p.63-78, Springer-Verlag, New York, 1993) on the total-squared-correlation (TSC) of signature sets is known to be tight for real-valued signatures and loose for binary signatures whose number is not a multiple of 4. We derive new bounds on the TSC of binary signature sets for any number of signatures K and any signature length L. For almost all K, L in {1, 2, ..., 200}, we develop simple algorithms for the design of optimum binary signature sets that achieve the new bound
Copyright © DIAS 2013
