scholarly journals From Time–Frequency to Vertex–Frequency and Back

Mathematics ◽  
2021 ◽  
Vol 9 (12) ◽  
pp. 1407
Author(s):  
Ljubiša Stanković ◽  
Jonatan Lerga ◽  
Danilo Mandic ◽  
Miloš Brajović ◽  
Cédric Richard ◽  
...  
Keyword(s):  
Fourier Transform ◽  
Frequency Analysis ◽  
Large Time ◽  
Signal Reconstruction ◽  
Spectral Domain ◽  
Computationally Efficient ◽  
Spectral Window ◽  
Time Frequency Analysis ◽  
Time Frequency ◽  
Short Time

The paper presents an analysis and overview of vertex–frequency analysis, an emerging area in graph signal processing. A strong formal link of this area to classical time–frequency analysis is provided. Vertex–frequency localization-based approaches to analyzing signals on the graph emerged as a response to challenges of analysis of big data on irregular domains. Graph signals are either localized in the vertex domain before the spectral analysis is performed or are localized in the spectral domain prior to the inverse graph Fourier transform is applied. The latter approach is the spectral form of the vertex–frequency analysis, and it will be considered in this paper since the spectral domain for signal localization is well ordered and thus simpler for application to the graph signals. The localized graph Fourier transform is defined based on its counterpart, the short-time Fourier transform, in classical signal analysis. We consider various spectral window forms based on which these transforms can tackle the localized signal behavior. Conditions for the signal reconstruction, known as the overlap-and-add (OLA) and weighted overlap-and-add (WOLA) methods, are also considered. Since the graphs can be very large, the realizations of vertex–frequency representations using polynomial form localization have a particular significance. These forms use only very localized vertex domains, and do not require either the graph Fourier transform or the inverse graph Fourier transform, are computationally efficient. These kinds of implementations are then applied to classical time–frequency analysis since their simplicity can be very attractive for the implementation in the case of large time-domain signals. Spectral varying forms of the localization functions are presented as well. These spectral varying forms are related to the wavelet transform. For completeness, the inversion and signal reconstruction are discussed as well. The presented theory is illustrated and demonstrated on numerical examples.

scholarly journals Time-frequency analysis on gong timor music using short-time fourier transform and continuous wavelet transform

2017 ◽  
Vol 3 (3) ◽  
pp. 146
Author(s):  
Yovinia Carmeneja Hoar Siki ◽  
Natalia Magdalena Rafu Mamulak
Keyword(s):  
Fourier Transform ◽  
Wavelet Transform ◽  
Frequency Analysis ◽  
Continuous Wavelet Transform ◽  
Continuous Wavelet ◽  
Short Time Fourier Transform ◽  
Time Frequency Analysis ◽  
Time Frequency ◽  
Music Signal ◽  
Short Time

Time-Frequency Analysis on Gong Timor Music has an important role in the application of signal-processing music such as tone tracking and music transcription or music signal notation. Some of Gong characters is heard by different ways of forcing Gong himself, such as how to play Gong based on the Player’s senses, a set of Gong, and by changing the tempo of Gong instruments. Gong's musical signals have more complex analytical criteria than Western music instrument analysis. This research uses a Gong instrument and two notations; frequency analysis of Gong music frequency compared by the Short-time Fourier Transform (STFT), Overlap Short-time Fourier Transform (OSTFT), and Continuous Wavelet Transform (CWT) method. In the STFT and OSTFT methods, time-frequency analysis Gong music is used with different windows and hop size while CWT method uses Morlet wavelet. The results show that the CWT is better than the STFT methods.

scholarly journals A simple Spectral Observer

2018 ◽  
Author(s):  
Lizeth Torres ◽  
Javier Jiménez-Cabas ◽  
José Francisco Gómez-Aguilar ◽  
Pablo Pérez-Alcazar
Keyword(s):  
Fourier Transform ◽  
Frequency Analysis ◽  
Online Algorithm ◽  
Duffing Oscillator ◽  
Design Procedure ◽  
Recursive Identification ◽  
Time Frequency Analysis ◽  
Time Frequency ◽  
The Fourier Transform ◽  
Short Time

The principal aim of a spectral observer is twofold: the reconstruction of a signal of time via state estimation and the decomposition of such a signal into the frequencies that make it up. A spectral observer can be catalogued as an online algorithm for time-frequency analysis because is a method that can compute on the fly the Fourier transform (FT) of a signal, without having the entire signal available from the start. In this regard, this paper presents a novel spectral observer with an adjustable constant gain for reconstructing a given signal by means of the recursive identification of the coefficients of a Fourier series. The reconstruction or estimation of a signal in the context of this work means to find the coefficients of a linear combination of sines a cosines that fits a signal such that it can be reproduced. The design procedure of the spectral observer is presented along with the following applications: (1) the reconstruction of a simple periodical signal, (2) the approximation of both a square and a triangular signal, (3) the edge detection in signals by using the Fourier coefficients, (4) the fitting of the historical Bitcoin market data from 2014-12-01 to 2018-01-08 and (5) the estimation of a input force acting upon a Duffing oscillator. To round out this paper, we present a detailed discussion about the results of the applications as well as a comparative analysis of the proposed spectral observer vis-à-vis the Short Time Fourier Transform (STFT), which is a well-known method for time-frequency analysis.

scholarly journals Area-Efficient Short-Time Fourier Transform Processor for Time–Frequency Analysis of Non-Stationary Signals

2020 ◽  
Vol 10 (20) ◽  
pp. 7208
Author(s):  
Hohyub Jeon ◽  
Yongchul Jung ◽  
Seongjoo Lee ◽  
Yunho Jung
Keyword(s):  
Fourier Transform ◽  
Real Time ◽  
Frequency Analysis ◽  
Path Delay ◽  
Window Length ◽  
Short Time Fourier Transform ◽  
Time Frequency Analysis ◽  
Time Frequency ◽  
Stationary Signals ◽  
Short Time

In this paper, we propose an area-efficient short-time Fourier transform (STFT) processor that can perform time–frequency analysis of non-stationary signals in real time, which is essential for voice or radar-signal processing systems. STFT processors consist of a windowing module and a fast Fourier transform processor. The length of the window function is related to the time–frequency resolution, and the required window length varies depending on the application. In addition, the window function needs to overlap the input data samples to minimize the data loss in the window boundary, and overlap ratios of 25%, 50%, and 75% are generally used. Therefore, the STFT processor should ideally support a variable window length and overlap ratio and be implemented with an efficient hardware architecture for real-time time–frequency analysis. The proposed STFT processor is based on the radix-4 multi-path delay commutator (R4MDC) pipeline architecture and supports a variable length of 16, 64, 256, and 1024 and overlap ratios of 25%, 50%, and 75%. Moreover, the proposed STFT processor can be implemented with very low complexity by having a relatively lower number of delay elements, which are the ones that increase complexity in the most STFT processors. The proposed STFT processor was designed using hardware description language (HDL) and synthesized to gate-level circuits using a standard cell library in a 65 nm CMOS process. The proposed STFT processor results in logic gates of 197,970, which is 63% less than that of the conventional radix-2 single-path delay feedback (R2SDF) based STFT processor.

Sign in / Sign up

Export Citation Format

Share Document