کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4605221 | 1337555 | 2013 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Fast and memory-efficient algorithms for computing quadratic time–frequency distributions
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
آنالیز ریاضی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Fast and memory-efficient algorithms for computing quadratic time–frequency distributions Fast and memory-efficient algorithms for computing quadratic time–frequency distributions](/preview/png/4605221.png)
چکیده انگلیسی
Algorithms for computing time–frequency distributions (TFDs) limit computation time by reducing numerical operations. But these fast algorithms do not reduce the memory load. This article presents four TFD algorithms to minimise both the computation and memory loads. Each algorithm is optimised for a specific kernel category. Three algorithms reduce memory by computing an exact TFD without oversampling; the fourth algorithm, for the nonseparable kernel, reduces memory by computing a decimated TFD. The separable-kernel algorithm, using a biomedical signal as an example, computes an exact TFD with only 12% of the computation load and 1% of the memory required by conventional algorithms.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied and Computational Harmonic Analysis - Volume 35, Issue 2, September 2013, Pages 350–358
Journal: Applied and Computational Harmonic Analysis - Volume 35, Issue 2, September 2013, Pages 350–358
نویسندگان
J.M. Oʼ Toole, B. Boashash,