A computationally efficient implementation of quadratic time-frequency distributions

John M. O'Toole, Mostefa Mesbah, Boualem Boashash

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

Time-frequency distributions (TFDs) are computationally intensive methods. A very common class of TFDs, namely quadratic TFDs, is obtained by time-frequency (TF) smoothing the Wigner Ville distribution (WVD). In this paper a computationally efficient implementation of this class of TFDs is presented. In order to avoid artifacts caused by circular convolution, linear convolution is applied in both the time and frequency directions. Four different kernel types are identified and separate optimised implementations are presented for each kernel type. The computational complexity is presented for the different kernel types.

Original languageEnglish
Title of host publication2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007, Proceedings
DOIs
Publication statusPublished - 2007
Event2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007 - Sharjah, United Arab Emirates
Duration: Feb 12 2007Feb 15 2007

Other

Other2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007
CountryUnited Arab Emirates
CitySharjah
Period2/12/072/15/07

    Fingerprint

ASJC Scopus subject areas

  • Signal Processing

Cite this

O'Toole, J. M., Mesbah, M., & Boashash, B. (2007). A computationally efficient implementation of quadratic time-frequency distributions. In 2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007, Proceedings [4555346] https://doi.org/10.1109/ISSPA.2007.4555346