IEICE TRANSACTIONS on Fundamentals
Generalized Sliding Discrete Fourier Transform
Summary :
The sliding discrete Fourier transform (DFT) is a well-known algorithm for obtaining a few frequency components of the DFT spectrum with a low computational cost. However, the conventional sliding DFT cannot be applied to practical conditions, e.g., using the sine window and the zero-padding DFT, with preserving the computational efficiency. This paper discusses the extension of the sliding DFT to such cases. Expressing the window function by complex sinusoids, a recursive algorithm for computing a frequency component of the DFT spectrum using an arbitrary sinusoidal window function is derived. The algorithm can be easily extended to the zero-padding DFT. Computer simulations using very long signals show the validity of our algorithm.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E99-A No.1 pp.338-345
- Publication Date
- 2016/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E99.A.338
- Type of Manuscript
- PAPER
- Category
- Digital Signal Processing
Authors
Takahiro MURAKAMI
Meiji University
Yoshihisa ISHIDA
Meiji University
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
Takahiro MURAKAMI, Yoshihisa ISHIDA, "Generalized Sliding Discrete Fourier Transform" in IEICE TRANSACTIONS on Fundamentals,
vol. E99-A, no. 1, pp. 338-345, January 2016, doi: 10.1587/transfun.E99.A.338.
Abstract: The sliding discrete Fourier transform (DFT) is a well-known algorithm for obtaining a few frequency components of the DFT spectrum with a low computational cost. However, the conventional sliding DFT cannot be applied to practical conditions, e.g., using the sine window and the zero-padding DFT, with preserving the computational efficiency. This paper discusses the extension of the sliding DFT to such cases. Expressing the window function by complex sinusoids, a recursive algorithm for computing a frequency component of the DFT spectrum using an arbitrary sinusoidal window function is derived. The algorithm can be easily extended to the zero-padding DFT. Computer simulations using very long signals show the validity of our algorithm.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.338/_p
Copy
@ARTICLE{e99-a_1_338,
author={Takahiro MURAKAMI, Yoshihisa ISHIDA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Generalized Sliding Discrete Fourier Transform},
year={2016},
volume={E99-A},
number={1},
pages={338-345},
abstract={The sliding discrete Fourier transform (DFT) is a well-known algorithm for obtaining a few frequency components of the DFT spectrum with a low computational cost. However, the conventional sliding DFT cannot be applied to practical conditions, e.g., using the sine window and the zero-padding DFT, with preserving the computational efficiency. This paper discusses the extension of the sliding DFT to such cases. Expressing the window function by complex sinusoids, a recursive algorithm for computing a frequency component of the DFT spectrum using an arbitrary sinusoidal window function is derived. The algorithm can be easily extended to the zero-padding DFT. Computer simulations using very long signals show the validity of our algorithm.},
keywords={},
doi={10.1587/transfun.E99.A.338},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - Generalized Sliding Discrete Fourier Transform
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 338
EP - 345
AU - Takahiro MURAKAMI
AU - Yoshihisa ISHIDA
PY - 2016
DO - 10.1587/transfun.E99.A.338
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2016
AB - The sliding discrete Fourier transform (DFT) is a well-known algorithm for obtaining a few frequency components of the DFT spectrum with a low computational cost. However, the conventional sliding DFT cannot be applied to practical conditions, e.g., using the sine window and the zero-padding DFT, with preserving the computational efficiency. This paper discusses the extension of the sliding DFT to such cases. Expressing the window function by complex sinusoids, a recursive algorithm for computing a frequency component of the DFT spectrum using an arbitrary sinusoidal window function is derived. The algorithm can be easily extended to the zero-padding DFT. Computer simulations using very long signals show the validity of our algorithm.
ER -
English
