On the Classification of Large Area Sequences
|Document type:||Conference Papers|
|Author(s):||Gregory Cresp, Hans-Jürgen Zepernick, Hai Huyen Dam|
|Title:||On the Classification of Large Area Sequences|
|Conference name:||IEEE Information Theory Workshop|
|Organization:||Blekinge Institute of Technology|
|Department:||School of Engineering - Dept. of Signal Processing (Sektionen för teknik – avd. för signalbehandling)
School of Engineering S- 372 25 Ronneby
+46 455 38 50 00
|Authors e-mail:||firstname.lastname@example.org, email@example.com, firstname.lastname@example.org|
|Abstract:||Large Area (LA) sequences form a class of ternary
spreading sequences which exhibit an interference free window.
In addition, these sequences have low correlation properties
outside this window. Work to date has concentrated on examining
the parameters and performance of LA sequences with reference
to only a small number of example families. In this paper we
develop general conditions which an LA family must satisfy.
The development of these conditions allows for the production
of computationally efficient tests to determine whether a given
family is an LA family. In particular, these tests can form the
basis for algorithms to construct LA families, allowing for a
larger number of families with the potential for higher energy
efficiency than those of previous work.