Share Email Print

Proceedings Paper

Fast computation of critically sampled time frequency signal representations
Author(s): Nenad M. Marinovic
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

An algorithm is proposed to compute samples of any bilinear joint time-frequency representation of the Cohen's class. The computation is performed on a decimated sampling grid, mapping N equals 3BD signal samples into N equals K X L critical samples of the joint representation in the time-frequency domain. This is in contrast with the usual approaches that perform the computation on a much denser grid, mapping N signal samples into N X N samples in the time-frequency plane. The algorithm is based on the discrete Zak transform and represents an extension of the work by Auslander et al. on fast computation of the ambiguity function. For a number of popular representations, the algorithm is shown to have computational complexity about the same as an ordinary FFT.

Paper Details

Date Published: 28 October 1994
PDF: 4 pages
Proc. SPIE 2296, Advanced Signal Processing: Algorithms, Architectures, and Implementations V, (28 October 1994); doi: 10.1117/12.190836
Show Author Affiliations
Nenad M. Marinovic, CUNY/City College and Graduate School (United States)

Published in SPIE Proceedings Vol. 2296:
Advanced Signal Processing: Algorithms, Architectures, and Implementations V
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top