Low-complexity generation of scalable complete complementary sets of sequences

Darryn Lowe; Xiaojing Huang

doi:10.1109/ISCIT.2006.339890

Low-complexity generation of scalable complete complementary sets of sequences

Darryn Lowe^*, Xiaojing Huang

^*Corresponding author for this work

School of Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

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 language	English
Title of host publication	2006 International Symposium on Communications and Information Technologies, ISCIT
Pages	73-77
Number of pages	5
DOIs	https://doi.org/10.1109/ISCIT.2006.339890
Publication status	Published - 2006
Event	2006 International Symposium on Communications and Information Technologies, ISCIT - Bangkok, Thailand Duration: 18 Oct 2006 → 20 Oct 2006

Other

Other	2006 International Symposium on Communications and Information Technologies, ISCIT
Country/Territory	Thailand
City	Bangkok
Period	18/10/06 → 20/10/06

Access to Document

10.1109/ISCIT.2006.339890

Cite this

@inproceedings{510a84253e1c4ceb9f0349542316b48e,

title = "Low-complexity generation of scalable complete complementary sets of sequences",

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.",

author = "Darryn Lowe and Xiaojing Huang",

year = "2006",

doi = "10.1109/ISCIT.2006.339890",

language = "English",

pages = "73--77",

booktitle = "2006 International Symposium on Communications and Information Technologies, ISCIT",

note = "2006 International Symposium on Communications and Information Technologies, ISCIT ; Conference date: 18-10-2006 Through 20-10-2006",

}

TY - GEN

T1 - Low-complexity generation of scalable complete complementary sets of sequences

AU - Lowe, Darryn

AU - Huang, Xiaojing

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=50949097320&partnerID=8YFLogxK

U2 - 10.1109/ISCIT.2006.339890

DO - 10.1109/ISCIT.2006.339890

M3 - Conference proceeding contribution

AN - SCOPUS:50949097320

SP - 73

EP - 77

BT - 2006 International Symposium on Communications and Information Technologies, ISCIT

T2 - 2006 International Symposium on Communications and Information Technologies, ISCIT

Y2 - 18 October 2006 through 20 October 2006

ER -

Low-complexity generation of scalable complete complementary sets of sequences

Abstract

Other

Access to Document

Other files and links

Fingerprint

Cite this