Journal
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS
Volume 35, Issue 2, Pages 350-358Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.acha.2013.01.003
Keywords
Algorithms; Computational efficiency; Fast Fourier transform; Nonstationary signals; Time-frequency analysis; Time-frequency distributions; Wigner-Ville distribution
Categories
Funding
- Qatar National Research Fund [NPRP 09-626-2-243]
Ask authors/readers for more resources
Algorithms for computing time-frequency distributions (TFDs) limit computation time by reducing numerical operations. But these fast algorithms do not reduce the memory load. This article presents four TFD algorithms to minimise both the computation and memory loads. Each algorithm is optimised for a specific kernel category. Three algorithms reduce memory by computing an exact TFD without oversampling; the fourth algorithm, for the nonseparable kernel, reduces memory by computing a decimated TFD. The separable-kernel algorithm, using a biomedical signal as an example, computes an exact TFD with only 12% of the computation load and 1% of the memory required by conventional algorithms. (C) 2013 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available