By Topic

Recursive Zak transforms and Weyl-Heisenberg expansions

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

1 Author(s)
Brodzik, A.K. ; Scientific Software, Woburn, MA, USA

We develop algorithms for computing block-recursive Zak transforms and Weyl-Heisenberg expansions, which achieve p/logL and (logM+p)/(logN+logL+1) multiplicative complexity reduction, respectively, over direct computations, where p'=pM, and N-p' is the number of overlapping samples in subsequent signal segments. For each transform we offer a choice of two algorithms based on two different implementations of the Zak transform of the time-evolving signal. These two algorithm classes exhibit typical trade-offs between computational complexity and memory requirements

Published in:

Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP '01). 2001 IEEE International Conference on  (Volume:6 )

Date of Conference: