## 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 language | English |
---|---|

Pages (from-to) | 320-329 |

Number of pages | 10 |

Journal | WSEAS Transactions on Signal Processing |

Volume | 4 |

Issue number | 5 |

Publication status | Published - May 2008 |

## 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