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

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