Discrete Gabor transforms with complexity O(NlogN)

被引：33

作者：

Qiu, SG ^{[1
]}

Zhou, F ^{[1
]}

Crandall, PE ^{[1
]}

机构：

[1] Ambient Technol Inc, NCDC, Raleigh, NC 27615 USA

来源：

SIGNAL PROCESSING | 1999年 / 77卷 / 02期

关键词：

discrete Gabor transforms (DGT); Gabor analysis; Gabor synthesis; fast Fourier transform;

D O I：

10.1016/S0165-1684(99)00030-4

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

We develop fast computations of discrete Gabor transforms. We present algorithms for computations of both Gabor analysis and Gabor synthesis via the fast Fourier transform. The algorithms are performed with complexity O(N log N). In addition, we propose an algorithm for computing the dual Gabor wavelets with complexity less than O(N log N). (C) 1999 Elsevier Science B.V. All rights reserved.

引用

页码：159 / 170

页数：12