A computationally efficient implementation of quadratic time-frequency distributions

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

نتاج البحث

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

ملخص

Time-frequency distributions (TFDs) are computationally intensive methods. A very common class of TFDs, namely quadratic TFDs, is obtained by time-frequency (TF) smoothing the Wigner Ville distribution (WVD). In this paper a computationally efficient implementation of this class of TFDs is presented. In order to avoid artifacts caused by circular convolution, linear convolution is applied in both the time and frequency directions. Four different kernel types are identified and separate optimised implementations are presented for each kernel type. The computational complexity is presented for the different kernel types.

اللغة الأصليةEnglish
عنوان منشور المضيف2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007, Proceedings
المعرِّفات الرقمية للأشياء
حالة النشرPublished - 2007
منشور خارجيًانعم
الحدث2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007 - Sharjah
المدة: فبراير ١٢ ٢٠٠٧فبراير ١٥ ٢٠٠٧

سلسلة المنشورات

الاسم2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007, Proceedings

Other

Other2007 9th International Symposium on Signal Processing and its Applications, ISSPA 2007
الدولة/الإقليمUnited Arab Emirates
المدينةSharjah
المدة٢/١٢/٠٧٢/١٥/٠٧

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1711???

بصمة

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

قم بذكر هذا