Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Frequency-Undersampled Short-Time Fourier Transform (2010.15029v1)

Published 28 Oct 2020 in eess.SP, cs.NA, eess.AS, and math.NA

Abstract: The short-time Fourier transform (STFT) usually computes the same number of frequency components as the frame length while overlapping adjacent time frames by more than half. As a result, the number of components of a spectrogram matrix becomes more than twice the signal length, and hence STFT is hardly used for signal compression. In addition, even if we modify the spectrogram into a desired one by spectrogram-based signal processing, it is re-changed during the inversion as long as it is outside the range of STFT. In this paper, to reduce the number of components of a spectrogram while maintaining the analytical ability, we propose the frequency-undersampled STFT (FUSTFT), which computes only half the frequency components. We also present the inversions with and without the periodic condition, including their different properties. In simple numerical examples of audio signals, we confirm the validity of FUSTFT and the inversions.

Summary

We haven't generated a summary for this paper yet.