Efficient algorithms for discrete time-frequency distributions

QSpace/Manakin Repository

Efficient algorithms for discrete time-frequency distributions

Show simple item record


dc.contributor.author O'Toole, J
dc.contributor.author Mesbah, M
dc.contributor.author Boashash, B
dc.date.accessioned 2012-03-12T07:05:14Z
dc.date.available 2012-03-12T07:05:14Z
dc.date.issued 2008
dc.identifier.citation Computational Methods and Applied Computing: Proceedings of the Applied Computing Conference (ACC '08), pages 310-315 en_US
dc.identifier.isbn 9789606766671
dc.identifier.isbn 9606766671
dc.identifier.issn 1790-2769
dc.identifier.uri http://hdl.handle.net/10576/10804
dc.description This paper shows that a new discrete time version of TFDs the DTFD-C, has the clear advantage over the other definitions as it provides the signal analyst with a high performance tool, by retaining all useful properties, at a low computational cost. (Additional details can be found in the comprehensive book on Time-Frequency Signal Analysis and Processing (see http://www.elsevier.com/locate/isbn/0080443354). In addition, the most recent upgrade of the original software package that calculates Time-Frequency Distributions and Instantaneous Frequency estimators can be downloaded from the web site: www.time-frequency.net. This was the first software developed in the field, and it was first released publicly in 1987 at the 1st ISSPA conference held in Brisbane, Australia, and then continuously updated). en_US
dc.description.abstract 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. en_US
dc.language.iso en en_US
dc.publisher WSEAS Press en_US
dc.subject Discrete time–frequency distributions (DTFD) en_US
dc.subject discrete Wigner–Ville distributions (DWVD) en_US
dc.subject discrete-time signal processing (DSP) en_US
dc.subject time–frequency analysis en_US
dc.subject algorithms en_US
dc.subject computational efficiency en_US
dc.title Efficient algorithms for discrete time-frequency distributions en_US
dc.type Article en_US

Files in this item

Files Size Format View
Boashash-OToole ... rithms-4-discrete-TFDs.pdf 350.8Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search QSpace


Advanced Search

Browse

My Account