Algorithms for discrete quadratic time-frequency distributions

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

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Time-frequency distributions (TFDs) are computationally costly to compute. We address this problem by presenting algorithms to reduce the computational load for computing TFDs. Before we can compute the TFDs, however, we first must define a discrete version of the TFD. Defining a discrete TFD (DTFD) is, unfortunately, 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 DTFDC. 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 complexity and memory required to compute the DTFD-B.

Original languageEnglish
Pages (from-to)320-329
Number of pages10
JournalWSEAS Transactions on Signal Processing
Volume4
Issue number5
Publication statusPublished - May 2008

Fingerprint

Computational complexity
Data storage equipment

Keywords

  • Algorithms
  • Computational load
  • Discrete time-frequency distributions (DTFD)
  • Discrete Wigner-Ville distributions (DWVD)
  • Discrete-time signal processing (DSP)
  • Fast Fourier transforms (FFTs)
  • Time-frequency signal analysis

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Computer Networks and Communications

Cite this

Algorithms for discrete quadratic time-frequency distributions. / O'Toole, John M.; Mesbah, Mostefa; Boashash, Boualem.

In: WSEAS Transactions on Signal Processing, Vol. 4, No. 5, 05.2008, p. 320-329.

Research output: Contribution to journalArticle

O'Toole, John M. ; Mesbah, Mostefa ; Boashash, Boualem. / Algorithms for discrete quadratic time-frequency distributions. In: WSEAS Transactions on Signal Processing. 2008 ; Vol. 4, No. 5. pp. 320-329.
@article{006d40d592714cff9eca206ece712ecc,
title = "Algorithms for discrete quadratic time-frequency distributions",
abstract = "Time-frequency distributions (TFDs) are computationally costly to compute. We address this problem by presenting algorithms to reduce the computational load for computing TFDs. Before we can compute the TFDs, however, we first must define a discrete version of the TFD. Defining a discrete TFD (DTFD) is, unfortunately, 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 DTFDC. 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 complexity and memory required to compute the DTFD-B.",
keywords = "Algorithms, Computational load, Discrete time-frequency distributions (DTFD), Discrete Wigner-Ville distributions (DWVD), Discrete-time signal processing (DSP), Fast Fourier transforms (FFTs), Time-frequency signal analysis",
author = "O'Toole, {John M.} and Mostefa Mesbah and Boualem Boashash",
year = "2008",
month = "5",
language = "English",
volume = "4",
pages = "320--329",
journal = "WSEAS Transactions on Signal Processing",
issn = "1790-5022",
number = "5",

}

TY - JOUR

T1 - Algorithms for discrete quadratic time-frequency distributions

AU - O'Toole, John M.

AU - Mesbah, Mostefa

AU - Boashash, Boualem

PY - 2008/5

Y1 - 2008/5

N2 - Time-frequency distributions (TFDs) are computationally costly to compute. We address this problem by presenting algorithms to reduce the computational load for computing TFDs. Before we can compute the TFDs, however, we first must define a discrete version of the TFD. Defining a discrete TFD (DTFD) is, unfortunately, 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 DTFDC. 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 complexity and memory required to compute the DTFD-B.

AB - Time-frequency distributions (TFDs) are computationally costly to compute. We address this problem by presenting algorithms to reduce the computational load for computing TFDs. Before we can compute the TFDs, however, we first must define a discrete version of the TFD. Defining a discrete TFD (DTFD) is, unfortunately, 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 DTFDC. 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 complexity and memory required to compute the DTFD-B.

KW - Algorithms

KW - Computational load

KW - Discrete time-frequency distributions (DTFD)

KW - Discrete Wigner-Ville distributions (DWVD)

KW - Discrete-time signal processing (DSP)

KW - Fast Fourier transforms (FFTs)

KW - Time-frequency signal analysis

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

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

M3 - Article

VL - 4

SP - 320

EP - 329

JO - WSEAS Transactions on Signal Processing

JF - WSEAS Transactions on Signal Processing

SN - 1790-5022

IS - 5

ER -