Efficient algorithms for discrete time-frequency distributions

O' Toole, John M., Mesbah, Mostefa and Boashash, Boualem (2008). Efficient algorithms for discrete time-frequency distributions. In: Metin Demiralp, Wasfy B. Mikhael, Amaury A. Caballero, Nicolas Abatzoglou, M. Nasseh Tabrizi, Remi Leandre, Maria I. Garcia-Planas and Ryszard S. Choras, Computational Methods and Applied Computing: Proceedings of the Applied Computing Conference (ACC '08). WSEAS International Conference on Applied Computing Conference, Istanbul, Turkey, (310-315). 27 - 30 May 2008.

Author O' Toole, John M.
Mesbah, Mostefa
Boashash, Boualem
Title of paper Efficient algorithms for discrete time-frequency distributions
Conference name WSEAS International Conference on Applied Computing Conference
Conference location Istanbul, Turkey
Conference dates 27 - 30 May 2008
Convener World Scientific and Engineering Academy and Society
Proceedings title Computational Methods and Applied Computing: Proceedings of the Applied Computing Conference (ACC '08)   Check publisher's open access policy
Journal name Computational Methods and Applied Computing   Check publisher's open access policy
Place of Publication Stevens Point, U.S.A.
Publisher WSEAS Press
Publication Year 2008
Sub-type Fully published paper
ISBN 9789606766671; 9606766671
ISSN 1790-2769
Editor Metin Demiralp
Wasfy B. Mikhael
Amaury A. Caballero
Nicolas Abatzoglou
M. Nasseh Tabrizi
Remi Leandre
Maria I. Garcia-Planas
Ryszard S. Choras
Start page 310
End page 315
Total pages 6
Collection year 2008
Language eng
Abstract/Summary Time­-frequency distributions (TFDs) are computationally costly to compute. This paper presents algorithms to reduce this computational load. Before we can compute the TFDs, however, we must define a discrete version of the TFD. Defining a discrete TFD (DTFD) is not a straightforward process---for example, a popular DTFD definition does not satisfy all desirable mathematical properties that are inherent to the continuous TFD. In this paper, we define a new DTFD definition, the DTFD-C. This definition is closely related to another DTFD definition which we recently proposed, the DTFD-B. The DTFD-B and DTFD-C satisfy all desirable properties. We provide algorithms for both these definitions and show that the DTFD-C requires only 50% of the computational load required to compute the DTFD-B.
Subjects 0906 Electrical and Electronic Engineering
Keyword Time-frequency analysis
Time-frequency distribution
Time-frequency representation
Discrete signal processing
Discrete Fourier transform
Algorithms
Discrete time-frequency distributions (DTFD)
Discrete Wigner-Ville distribution (DWVD)
Computational complexity
Q-Index Code E1
Q-Index Status Provisional Code
Institutional Status Unknown
Additional Notes Series title: Mathematics and Computers in Science and Engineering

 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 1 times in Thomson Reuters Web of Science Article | Citations
Google Scholar Search Google Scholar
Created: Fri, 19 Jun 2009, 15:30:39 EST by Dr John M. O' Toole on behalf of Faculty Of Health Sciences