Show simple item record

AuthorO'Toole, J.M.
AuthorBoashash, B
Available date2013-09-17T15:56:03Z
Publication Date2013-09
Publication NameApplied and Computational Harmonic Analysis
Identifierhttp://dx.doi.org/10.1016/j.acha.2013.01.003
CitationJ.M. Oʼ Toole, B. Boashash, “Fast and memory-efficient algorithms for computing quadratic time–frequency distributions”, Applied and Computational Harmonic Analysis, Volume 35, Issue 2, September 2013, Pages 350-358
ISSN1063-5203
URIhttp://hdl.handle.net/10576/10894
DescriptionThis paper presents algorithms that compute DTFDs with minimal computation and memory loads. (Additional details can be found in the comprehensive book on Time-Frequency Signal Analysis and Processing (see http://www.elsevier.com/locate/isbn/0080443354). In addition, the most recent upgrade of the original software package that calculates Time-Frequency Distributions and Instantaneous Frequency estimators can be downloaded from the web site: www.time-frequency.net. This was the first software developed in the field, and it was first released publicly in 1987 at the 1st ISSPA conference held in Brisbane, Australia, and then continuously updated).
AbstractAlgorithms 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.
Languageen
PublisherElsevier Inc
SubjectAlgorithms
Computational efficiency
Fast Fourier transform
Nonstationary signals
Time–frequency analysis
Time–frequency distribution
Wigner–Ville distribution
quadratic TFDs
time-frequency signal processing
TitleFast and memory-efficient algorithms for computing quadratic time–frequency distributions
TypeArticle


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record