A computationally efficient implementation of quadratic time-frequency distributions

O' Toole, John M., Mesbah, Mostefa and Boashash, Boualem (2007). A computationally efficient implementation of quadratic time-frequency distributions. In: Al-Mualla, M., 9th International Symposium on Signal Processing and its Applications. 9th International Symposium on Signal Processing and its Applications (ISSPA-07), Sharjah, United Arab Emirates, (290-293). 12-15 February 2007.

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads
otoolej_dtfd_isspa07.pdf otoolej_dtfd_isspa07.pdf application/pdf 99.60KB 222

Author O' Toole, John M.
Mesbah, Mostefa
Boashash, Boualem
Title of paper A computationally efficient implementation of quadratic time-frequency distributions
Conference Paper Type Fully Published Paper
Conference name 9th International Symposium on Signal Processing and its Applications (ISSPA-07)
DOI 10.1109/ISSPA.2007.4555346
Conference location Sharjah, United Arab Emirates
Conference dates 12-15 February 2007
Convener Professor Boualem Boashash
Proceedings title 9th International Symposium on Signal Processing and its Applications
Editor Al-Mualla, M.
Place published Sharjah, UAE
Publisher Suvisoft
Publication date 2007
Year available 2007
Volume number 1
ISBN 9781424407781; 1424407796
Start page 290
End page 293
Total pages 4
Collection year 2007
Language eng
Formatted Abstract/Summary 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.
©2007 IEEE
Subjects 280204 Signal Processing
280401 Analysis of Algorithms and Complexity
E1
780101 Mathematical sciences
700103 Information processing services
0906 Electrical and Electronic Engineering
Keyword Time-frequency analysis
Discrete time-frequency distributions (DTFD)
Discrete Wigner-Ville distribution (DWVD)
Analytic signal
Aliasing
Convolution
Computational complexity
Discrete-time signal processing (DSP)
References [1] B. Boashash, Ed., Time-Frequency Signal Analysis and Processing : A Comprehensive Reference. Oxford, UK: Elsevier, 2003. [2] B. Boashash, "Note on the use of the Wigner distribution for time-frequency signal analysis," IEEE Trans. Acoust., Speech, Signal Processing, vol. 36, no. 9, pp. 1518­1521, 1988. [3] T. Claasen and W. Mecklenbra¨ ker, "The Wigner distribution - a tool for time-frequency signal analysis - part 2: Discrete-time signals," Philips J. Research, vol. 35, pp. 276­350, 1980. [4] S. L. Marple, Jr., "Computing the discrete-time `analytic' signal via FFT," IEEE Trans. Signal Processing, vol. 47, no. 9, pp. 2600­2603, 1999. [5] A. V. Oppenheim and R. W. Schafer, Discrete-Time Signal Processing. Englewood Cliffs, NJ 07458: Prentice-Hall, 1999. [6] J. O' Toole, M. Mesbah, and B. Boashash, "A discrete time and frequency Wigner--Ville distribution: Properties and implementation," in Proc. Int. Conf. on Digital Signal Processing and Comm. Systems, vol. CD-ROM, Dec. 19­21, 2005.
Q-Index Code E1
Additional Notes The attached file is an author version of the conference paper.

 
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Access Statistics: 130 Abstract Views, 226 File Downloads  -  Detailed Statistics
Created: Wed, 27 Feb 2008, 15:38:04 EST by Dr John M. O' Toole on behalf of Faculty Of Health Sciences