Low-complexity generation of scalable complete complementary sets of sequences

Authors

Darryn Lowe, University of WollongongFollow
Xiaojing Huang, University of WollongongFollow

RIS ID

15451

Publication Details

This paper was originally published as: Lowe, D & Huang, X, Low-complexity generation of scalable complete complementary sets of sequences, 2006 International Symposium on Communications and Information Technologies (ISCIT), Bangkok, Thailand, 18-20 October 2006. Conference information is available here.

Abstract

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.