Bounded-Magnitude Discrete Fourier Transform [Tips & Tricks]
Autor: | Sebastian J. Schlecht, Vesa Välimäki, Emanuël A.P. Habets |
---|---|
Přispěvatelé: | Department of Art and Media, Audio Signal Processing, Friedrich-Alexander University Erlangen-Nürnberg, Department of Information and Communications Engineering, Aalto-yliopisto, Aalto University |
Rok vydání: | 2023 |
Předmět: | |
Zdroj: | IEEE Signal Processing Magazine. 40:46-49 |
ISSN: | 1558-0792 1053-5888 |
DOI: | 10.1109/msp.2022.3228526 |
Popis: | Publisher Copyright: © 1991-2012 IEEE. 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. |
Databáze: | OpenAIRE |
Externí odkaz: |