TY - JOUR
T1 - Bounded-Magnitude Discrete Fourier Transform [Tips & Tricks]
AU - Schlecht, Sebastian J.
AU - Valimaki, Vesa
AU - Habets, Emanuel A.P.
N1 - Publisher Copyright:
© 1991-2012 IEEE.
PY - 2023/5/1
Y1 - 2023/5/1
N2 - Analyzing the magnitude response of a finite-length sequence is a ubiquitous task in signal processing. However, the discrete Fourier transform (DFT) provides only discrete sampling points of the response characteristic. This work introduces bounds on the magnitude response, which can be efficiently computed without additional zero padding. The proposed bounds can be used for more informative visualization and inform whether additional frequency resolution or zero padding is required.
AB - Analyzing the magnitude response of a finite-length sequence is a ubiquitous task in signal processing. However, the discrete Fourier transform (DFT) provides only discrete sampling points of the response characteristic. This work introduces bounds on the magnitude response, which can be efficiently computed without additional zero padding. The proposed bounds can be used for more informative visualization and inform whether additional frequency resolution or zero padding is required.
UR - http://www.scopus.com/inward/record.url?scp=85159851591&partnerID=8YFLogxK
U2 - 10.1109/MSP.2022.3228526
DO - 10.1109/MSP.2022.3228526
M3 - Article
AN - SCOPUS:85159851591
SN - 1053-5888
VL - 40
SP - 46
EP - 49
JO - IEEE Signal Processing Magazine
JF - IEEE Signal Processing Magazine
IS - 3
ER -