Low-complexity generation of scalable complete complementary sets of sequences

Darryn Lowe*, Xiaojing Huang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

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.

Original languageEnglish
Title of host publication2006 International Symposium on Communications and Information Technologies, ISCIT
Pages73-77
Number of pages5
DOIs
Publication statusPublished - 2006
Event2006 International Symposium on Communications and Information Technologies, ISCIT - Bangkok, Thailand
Duration: 18 Oct 200620 Oct 2006

Other

Other2006 International Symposium on Communications and Information Technologies, ISCIT
CountryThailand
CityBangkok
Period18/10/0620/10/06

Fingerprint Dive into the research topics of 'Low-complexity generation of scalable complete complementary sets of sequences'. Together they form a unique fingerprint.

Cite this