Low-Complexity Generation of Scalable Complete Complementary Sets of Sequences
Darryn Lowe, Xiaojing Huang · 2006
This paper presents extremely low-complexity boolean logic for the generation of coefficients suitable for filtering or correlation of scalable complete complementary sets of sequences (SCCSS). As the unique auto- and cross-correlation properties of SCCSS are of broad interest, the simplicity of the proposed coefficient generation technique allows arbitrarily long SCCSS to be used in resource constrained applications