The Sliding Windowed Infinite Fourier Transform [Tips & Tricks]

Logan L. Grado; Matthew D. Johnson; Theoden I. Netoff

doi:10.1109/MSP.2017.2718039

The Sliding Windowed Infinite Fourier Transform [Tips & Tricks]

Logan L. Grado, Matthew D. Johnson, Theoden I. Netoff

Biomedical Engineering

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

Abstract

The discrete Fourier transform (DFT) is the standard tool for spectral analysis in digital signal processing, typically computed using the fast Fourier transform (FFT). However, for real-time applications that require recalculating the DFT at each sample or over only a subset of the N center frequencies of the DFT, the FFT is far from optimal.

Original language	English (US)
Article number	8026592
Pages (from-to)	183-188
Number of pages	6
Journal	IEEE Signal Processing Magazine
Volume	34
Issue number	5
DOIs	https://doi.org/10.1109/MSP.2017.2718039
State	Published - Sep 2017

Bibliographical note

Publisher Copyright:
© 2017 IEEE.

Access

10.1109/MSP.2017.2718039

OpenUrl availability

Full text

Cite this

@article{766cd06b67f14424b67bb4ebd36625d4,

title = "The Sliding Windowed Infinite Fourier Transform [Tips & Tricks]",

abstract = "The discrete Fourier transform (DFT) is the standard tool for spectral analysis in digital signal processing, typically computed using the fast Fourier transform (FFT). However, for real-time applications that require recalculating the DFT at each sample or over only a subset of the N center frequencies of the DFT, the FFT is far from optimal.",

author = "Grado, {Logan L.} and Johnson, {Matthew D.} and Netoff, {Theoden I.}",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.",

year = "2017",

month = sep,

doi = "10.1109/MSP.2017.2718039",

language = "English (US)",

volume = "34",

pages = "183--188",

journal = "IEEE Signal Processing Magazine",

issn = "1053-5888",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

T1 - The Sliding Windowed Infinite Fourier Transform [Tips & Tricks]

AU - Grado, Logan L.

AU - Johnson, Matthew D.

AU - Netoff, Theoden I.

PY - 2017/9

Y1 - 2017/9

N2 - The discrete Fourier transform (DFT) is the standard tool for spectral analysis in digital signal processing, typically computed using the fast Fourier transform (FFT). However, for real-time applications that require recalculating the DFT at each sample or over only a subset of the N center frequencies of the DFT, the FFT is far from optimal.

AB - The discrete Fourier transform (DFT) is the standard tool for spectral analysis in digital signal processing, typically computed using the fast Fourier transform (FFT). However, for real-time applications that require recalculating the DFT at each sample or over only a subset of the N center frequencies of the DFT, the FFT is far from optimal.

UR - http://www.scopus.com/inward/record.url?scp=85032757171&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85032757171&partnerID=8YFLogxK

U2 - 10.1109/MSP.2017.2718039

DO - 10.1109/MSP.2017.2718039

M3 - Article

AN - SCOPUS:85032757171

SN - 1053-5888

VL - 34

SP - 183

EP - 188

JO - IEEE Signal Processing Magazine

JF - IEEE Signal Processing Magazine

IS - 5

M1 - 8026592

ER -

The Sliding Windowed Infinite Fourier Transform [Tips & Tricks]

Abstract

Bibliographical note

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this