scholarly journals Adaptive short-time fractional Fourier transform used in time-frequency analysis

2017 ◽  
Author(s):  
Lin Tian
2014 ◽  
Vol 989-994 ◽  
pp. 4001-4004 ◽  
Author(s):  
Yan Jun Wu ◽  
Gang Fu ◽  
Yu Ming Zhu

As a generalization of Fourier transform, the fractional Fourier Transform (FRFT) contains simultaneity the time-frequency information of the signal, and it is considered a new tool for time-frequency analysis. This paper discusses some steps of FRFT in signal detection based on the decomposition of FRFT. With the help of the property that a LFM signal can produce a strong impulse in the FRFT domain, the signal can be detected conveniently. Experimental analysis shows that the proposed method is effective in detecting LFM signals.


Mathematics ◽  
2021 ◽  
Vol 9 (12) ◽  
pp. 1407
Author(s):  
Ljubiša Stanković ◽  
Jonatan Lerga ◽  
Danilo Mandic ◽  
Miloš Brajović ◽  
Cédric Richard ◽  
...  

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.


Author(s):  
Yovinia Carmeneja Hoar Siki ◽  
Natalia Magdalena Rafu Mamulak

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.


Sign in / Sign up

Export Citation Format

Share Document