IEICE TRANSACTIONS on Information
Fast Algorithm for Computing Analysis Windows in Real-Valued Discrete Gabor Transform
Summary :
Based on the completeness of the real-valued discrete Gabor transform, a new biorthogonal relationship between analysis window and synthesis window is derived and a fast algorithm for computing the analysis window is presented for any given synthesis window. The new biorthogonal relationship can be expressed as a linear equation set, which can be separated into a certain number of independent sub-equation sets, where each of them can be fast and independently solved by using convolution operations and FFT to obtain the analysis window for any given synthesis window. Computational complexity analysis and comparison indicate that the proposed algorithm can save a considerable amount of computation and is more efficient than the existing algorithms.
- Publication
- IEICE TRANSACTIONS on Information Vol.E99-D No.6 pp.1682-1685
- Publication Date
- 2016/06/01
- Publicized
- 2016/02/29
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2016EDL8017
- Type of Manuscript
- LETTER
- Category
- Fundamentals of Information Systems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Rui LI, Liang TAO, "Fast Algorithm for Computing Analysis Windows in Real-Valued Discrete Gabor Transform" in IEICE TRANSACTIONS on Information,
vol. E99-D, no. 6, pp. 1682-1685, June 2016, doi: 10.1587/transinf.2016EDL8017.
Abstract: Based on the completeness of the real-valued discrete Gabor transform, a new biorthogonal relationship between analysis window and synthesis window is derived and a fast algorithm for computing the analysis window is presented for any given synthesis window. The new biorthogonal relationship can be expressed as a linear equation set, which can be separated into a certain number of independent sub-equation sets, where each of them can be fast and independently solved by using convolution operations and FFT to obtain the analysis window for any given synthesis window. Computational complexity analysis and comparison indicate that the proposed algorithm can save a considerable amount of computation and is more efficient than the existing algorithms.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2016EDL8017/_p
Copy
@ARTICLE{e99-d_6_1682,
author={Rui LI, Liang TAO, },
journal={IEICE TRANSACTIONS on Information},
title={Fast Algorithm for Computing Analysis Windows in Real-Valued Discrete Gabor Transform},
year={2016},
volume={E99-D},
number={6},
pages={1682-1685},
abstract={Based on the completeness of the real-valued discrete Gabor transform, a new biorthogonal relationship between analysis window and synthesis window is derived and a fast algorithm for computing the analysis window is presented for any given synthesis window. The new biorthogonal relationship can be expressed as a linear equation set, which can be separated into a certain number of independent sub-equation sets, where each of them can be fast and independently solved by using convolution operations and FFT to obtain the analysis window for any given synthesis window. Computational complexity analysis and comparison indicate that the proposed algorithm can save a considerable amount of computation and is more efficient than the existing algorithms.},
keywords={},
doi={10.1587/transinf.2016EDL8017},
ISSN={1745-1361},
month={June},}
Copy
TY - JOUR
TI - Fast Algorithm for Computing Analysis Windows in Real-Valued Discrete Gabor Transform
T2 - IEICE TRANSACTIONS on Information
SP - 1682
EP - 1685
AU - Rui LI
AU - Liang TAO
PY - 2016
DO - 10.1587/transinf.2016EDL8017
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E99-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2016
AB - Based on the completeness of the real-valued discrete Gabor transform, a new biorthogonal relationship between analysis window and synthesis window is derived and a fast algorithm for computing the analysis window is presented for any given synthesis window. The new biorthogonal relationship can be expressed as a linear equation set, which can be separated into a certain number of independent sub-equation sets, where each of them can be fast and independently solved by using convolution operations and FFT to obtain the analysis window for any given synthesis window. Computational complexity analysis and comparison indicate that the proposed algorithm can save a considerable amount of computation and is more efficient than the existing algorithms.
ER -
English
