Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Simon Fraser University

$17,000.00

Aperiodic autocorrelation properties of sequences and arrays.

EF 2008-09

Résumé
The study of the aperiodic autocorrelation properties of binary sequences began in the 1950s and continues to be of central importance in diverse digital transmission systems, including radar information processing, power control for multicarrier wireless transmission, and optical time domain reflectometry. Sequences and arrays whose aperiodic autocorrelations are collectively small in relation to the sequence or array size correspond to signals whose transmission wastes very little energy and which can be recovered efficiently at the receiver. Traditionally, the analysis of autocorrelation properties has concentrated on the periodic case, where the presence of rich mathematical structure admits many theoretical techniques. But the aperiodic case is much more significant in practice, because it arises naturally in so many application contexts. Although conventional wisdom has long been that aperiodic autocorrelations display little structure, and that often the only realistic means of analysis is computer search, there have been several recent indications to the contrary. The short-term objectives of the program are to study particular classical problems in this area for which recent results have opened up new research directions. The long-term objective is to identify emerging methods, and develop new ones, for studying aperiodic autocorrelations of large sequences and arrays. This is becoming increasingly important as modern digital communications systems are less likely to be restricted to the use of smaller sequences and arrays. The general scientific approach will be to combine tools and insights from discrete mathematics, computing science, and digital communications engineering. Where appropriate, experimental computation will be used to reveal patterns, identify key examples, improve intuition, and so point the way to new theoretical results.
Programme
Discovery Grants Program - Individual
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
278420-2007
Name nom
Jedwab, Jonathan
Department département
Mathematics
Organization id
5
Institution établissement
Simon Fraser University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2007
Award amount
17000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2718
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Communication and information theory
Research subject fr
Théorie des télécommunications et de l'information
Partie
2
Nb partie
2
Application title
Aperiodic autocorrelation properties of sequences and arrays.
Keyword
NA
Application summary
The study of the aperiodic autocorrelation properties of binary sequences began in the 1950s and continues to be of central importance in diverse digital transmission systems, including radar information processing, power control for multicarrier wireless transmission, and optical time domain reflectometry. Sequences and arrays whose aperiodic autocorrelations are collectively small in relation to the sequence or array size correspond to signals whose transmission wastes very little energy and which can be recovered efficiently at the receiver. Traditionally, the analysis of autocorrelation properties has concentrated on the periodic case, where the presence of rich mathematical structure admits many theoretical techniques. But the aperiodic case is much more significant in practice, because it arises naturally in so many application contexts. Although conventional wisdom has long been that aperiodic autocorrelations display little structure, and that often the only realistic means of analysis is computer search, there have been several recent indications to the contrary. The short-term objectives of the program are to study particular classical problems in this area for which recent results have opened up new research directions. The long-term objective is to identify emerging methods, and develop new ones, for studying aperiodic autocorrelations of large sequences and arrays. This is becoming increasingly important as modern digital communications systems are less likely to be restricted to the use of smaller sequences and arrays. The general scientific approach will be to combine tools and insights from discrete mathematics, computing science, and digital communications engineering. Where appropriate, experimental computation will be used to reveal patterns, identify key examples, improve intuition, and so point the way to new theoretical results.