Generalized Sliding Discrete Fourier Transform

• MURAKAMI Takahiro

  Department of Electronics and Bioinformatics, Meiji University

• ISHIDA Yoshihisa

  Department of Electronics and Bioinformatics, Meiji University

抄録

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.

収録刊行物

• IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E99.A (1), 338-345, 2016

  一般社団法人 電子情報通信学会

キーワード

• sliding DFT
• window function
• zero-padding

詳細情報

• CRID: 1390282681287569664
• NII論文ID: 130005115264
• DOI: 10.1587/transfun.e99.a.338
• ISSN: 17451337
• ISSN: 09168508
• Web Site: https://www.jstage.jst.go.jp/article/transfun/E99.A/1/E99.A_338/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • Crossref
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可