2020arXiv (Cornell University)Open access

Frequency-Undersampled Short-Time Fourier Transform

Daichi Kitahara

Open full text 1 citations

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Spectrogram, Short-time Fourier transform, Time–frequency analysis, Fourier transform, Computer science, Algorithm, SIGNAL (programming language), Speech recognition

Related papers

Back to paper searchBrowse research topicsOriginal source
Frequency-Undersampled Short-Time Fourier Transform — Research Paper | ScholarLens