z-logo
open-access-imgOpen Access
Parallel‐computing‐based implementation of fast algorithms for discrete Gabor transform
Author(s) -
Lin Chen,
Tao Liang,
Kwan Hon Keung
Publication year - 2015
Publication title -
iet signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.384
H-Index - 42
ISSN - 1751-9683
DOI - 10.1049/iet-spr.2014.0300
Subject(s) - computer science , parallel computing , parallel algorithm , algorithm , inter process communication , parallel processing , signal processing , block (permutation group theory) , process (computing) , overhead (engineering) , distributed computing , digital signal processing , computer hardware , mathematics , geometry , operating system
Parallel‐computing‐based implementation of the two recent fast parallel algorithms for the discrete Gabor transform (DGT) is presented in this paper. First of all, the first existing block time‐recursive DGT algorithm with parallel lattice structure is analysed, and then an improved implementation method under a parallel computing environment is presented. Each parallel channel (i.e. process in parallel computing) in the improved method is independent, thereby reducing the interprocess communication by 99.2% on average over the original algorithm. Second, the second existing fast parallel DGT algorithm based on multirate filtering is analysed. Through the use of parallel computing, the communication overhead of the multirate filtering‐based parallel DGT algorithm is optimised and its time efficiency is raised from 31.26 times to 54.52 times faster than the serial fast DGT algorithm in processing of long sequences. Finally, the experimental results are compared and analysed, which indicate that the proposed fast DGT implementation methods are attractive for real‐time signal processing.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here