Author_Institution :
Dept. of Electr. Eng., State Univ. of New York, Buffalo, NY, USA
Abstract :
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
Keywords :
Hadamard matrices; binary codes; code division multiple access; correlation methods; set theory; spread spectrum communication; DS-CDMA; Hadamard matrix; Welch lower bound; binary signature sets; direct-sequence code-division-multiple-access; minimum total-squared-correlation; spreading codes; Algorithm design and analysis; Character generation; Communication channels; Frequency conversion; Gain measurement; Interference; Length measurement; Multiaccess communication; Signal design; System performance;