Algorithms for discrete quadratic time-frequency distributions

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

*المؤلف المقابل لهذا العمل

نتاج البحث: المساهمة في مجلةمراجعة النظراء

3 اقتباسات (Scopus)

ملخص

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.

اللغة الأصليةEnglish
الصفحات (من إلى)320-329
عدد الصفحات10
دوريةWSEAS Transactions on Signal Processing
مستوى الصوت4
رقم الإصدار5
حالة النشرPublished - مايو 2008
منشور خارجيًانعم

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1712???
  • ???subjectarea.asjc.1700.1711???
  • ???subjectarea.asjc.1700.1707???
  • ???subjectarea.asjc.1700.1705???

بصمة

أدرس بدقة موضوعات البحث “Algorithms for discrete quadratic time-frequency distributions'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا