Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Ganapathy et al. (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: