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

Convolution
Wigner-Ville distribution
Computational complexity

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

A computationally efficient implementation of quadratic time-frequency distributions. / O'Toole, John M.; Mesbah, Mostefa; Boashash, Boualem.

2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007, Proceedings. 2007. 4555346.

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

O'Toole, JM, 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, 2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007, Sharjah, United Arab Emirates, 2/12/07. https://doi.org/10.1109/ISSPA.2007.4555346
O'Toole JM, Mesbah M, Boashash B. A computationally efficient implementation of quadratic time-frequency distributions. In 2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007, Proceedings. 2007. 4555346 https://doi.org/10.1109/ISSPA.2007.4555346
O'Toole, John M. ; Mesbah, Mostefa ; Boashash, Boualem. / A computationally efficient implementation of quadratic time-frequency distributions. 2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007, Proceedings. 2007.
@inproceedings{81fbe7cef8e844b69654a904bc09d5e1,
title = "A computationally efficient implementation of quadratic time-frequency distributions",
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.",
author = "O'Toole, {John M.} and Mostefa Mesbah and Boualem Boashash",
year = "2007",
doi = "10.1109/ISSPA.2007.4555346",
language = "English",
isbn = "1424407796",
booktitle = "2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007, Proceedings",

}

TY - GEN

T1 - A computationally efficient implementation of quadratic time-frequency distributions

AU - O'Toole, John M.

AU - Mesbah, Mostefa

AU - Boashash, Boualem

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=51549112387&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51549112387&partnerID=8YFLogxK

U2 - 10.1109/ISSPA.2007.4555346

DO - 10.1109/ISSPA.2007.4555346

M3 - Conference contribution

AN - SCOPUS:51549112387

SN - 1424407796

SN - 9781424407798

BT - 2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007, Proceedings

ER -