Institutional Repository [SANDBOX]
Technical University of Crete
EN  |  EL

Search

Browse

My Space

Code division multiplexing performance of minimum total-squared-correlationbinary signature sets

Karystinos Georgios, Pados D. A.

Simple record


URIhttp://purl.tuc.gr/dl/dias/D70F328B-44A5-4A2E-B766-0F3A3918C94B-
Identifierhttps://doi.org/10.1109/GLOCOM.2003.1258561-
Languageen-
Extent4en
TitleCode division multiplexing performance of minimum total-squared-correlation binary signature setsen
CreatorKarystinos Georgiosen
CreatorΚαρυστινος Γεωργιοςel
Creator Pados D. A.en
PublisherInstitute of Electrical and Electronics Engineersen
Content SummaryThe 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
Type of ItemΠλήρης Δημοσίευση σε Συνέδριοel
Type of ItemConference Full Paperen
Licensehttp://creativecommons.org/licenses/by-nc-nd/4.0/en
Date of Item2015-11-10-
Date of Publication2003-
Bibliographic CitationG. 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

Services

Statistics