By Topic

Bat Chirps With Good Properties: Zak Space Construction of Perfect Polyphase Sequences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Brodzik, A.K. ; MITRE Corp., Bedford, MA ; Tolimieri, R.

Previously, a discretization of the linear FM chirp of length N=KL 2, L and KL isin Z, was given and the conditions for its minimal Zak space support were derived. Chirps satisfying these conditions are known as finite chirps. In this work, subsets of finite chirps of length N=L 2, L a prime, are examined. The investigation leads to a new, Zak space construction of general polyphase sequence sets of size L-1 with optimal auto and cross-correlation properties, known as perfect sequence sets. It is shown that perfect sequence sets are closely related to sets of finite chirps and, in particular, include the sets of Zadoff-Chu sequences (which are identical with subsets of finite chirps) and the sets of generalized Frank sequences (which are identical with sets of modulations of finite chirps), as special cases. The entire collection of perfect sequence sets is then given by a partition of the set of perfect auto correlation sequences, obtained by right coset decomposition of the group of all permutations with respect to a certain cyclic group. The construction suggests several further generalizations that can be obtained by operating exclusively on subgroups of the permutation group.

Published in:

Information Theory, IEEE Transactions on  (Volume:55 ,  Issue: 4 )