Bounded-Magnitude Discrete Fourier Transform [Tips & Tricks]
Loading...
Access rights
openAccess
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal
View/Open full text file from the Research portal
Other link related to publication
View publication in the Research portal
View/Open full text file from the Research portal
Other link related to publication
Date
2023-05-01
Major/Subject
Mcode
Degree programme
Language
en
Pages
4
46-49
46-49
Series
IEEE Signal Processing Magazine, Volume 40, issue 3
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.Description
Publisher Copyright: © 1991-2012 IEEE.
Keywords
Other note
Citation
Schlecht, S J, Valimaki, V & Habets, E A P 2023, ' Bounded-Magnitude Discrete Fourier Transform [Tips & Tricks] ', IEEE Signal Processing Magazine, vol. 40, no. 3, pp. 46-49 . https://doi.org/10.1109/MSP.2022.3228526
