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 | |
| State | Published - Sep 2017 |
Bibliographical note
Funding Information:Matthew D. Johnson (john5101@ umn.edu) is an associate professor of biomedical engineering at the University of Minnesota. He received his S.B. degree in engineering sciences from Harvard University, Cambridge, Massachusetts, in 2002 and his M.S. and Ph.D. degrees in biomedical engineering from the University of Michigan in 2003 and 2007, respectively. Between 2007 and 2009, he completed a postdoctoral fellowship at the Cleveland Clinic. His primary research interests are the application of signal processing, control engineering, and neural interface technology to neuromod-ulation therapies.
Publisher Copyright:
© 2017 IEEE.