New Bounds and Optimal Binary Signature Sets - Part I: Periodic Total Squared Correlation

Abstract

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.

DOI: 10.1109/TCOMM.2011.020411.090404

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@article{Ganapathy2011NewBA, title={New Bounds and Optimal Binary Signature Sets - Part I: Periodic Total Squared Correlation}, author={Harish Ganapathy and Dimitris A. Pados and George N. Karystinos}, journal={IEEE Trans. Communications}, year={2011}, volume={59}, pages={1123-1132} }