Paper
28 October 1994 Fast computation of critically sampled time frequency signal representations
Nenad M. Marinovic
Author Affiliations +
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.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Nenad M. Marinovic "Fast computation of critically sampled time frequency signal representations", Proc. SPIE 2296, Advanced Signal Processing: Algorithms, Architectures, and Implementations V, (28 October 1994); https://doi.org/10.1117/12.190836
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Time-frequency analysis

Fourier transforms

Algorithm development

Radar

Signal analysis

Analytical research

Direct methods

Back to Top