Bounded-Magnitude Discrete Fourier Transform [Tips & Tricks] | IEEE Journals & Magazine | IEEE Xplore

Bounded-Magnitude Discrete Fourier Transform [Tips & Tricks]


Abstract:

Analyzing the magnitude response of a finite-length sequence is a ubiquitous task in signal processing. However, the discrete Fourier transform (DFT) provides only discre...Show More

Abstract:

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.
Published in: IEEE Signal Processing Magazine ( Volume: 40, Issue: 3, May 2023)
Page(s): 46 - 49
Date of Publication: 01 May 2023

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.