Octonion Short-Time Fourier Transform for Time-Frequency Representation and Its Applications

被引:22
作者
Gao, Wen-Biao [1 ]
Li, Bing-Zhao [1 ]
机构
[1] Beijing Inst Technol, Sch Math & Stat, Beijing 102488, Peoples R China
基金
中国国家自然科学基金;
关键词
Algebra; Fourier transforms; Time-frequency analysis; Uncertainty; Kernel; Quaternions; Convolution; Octonion Fourier transform; octonion short-time Fourier transform; convolution theorem; uncertainty principle; linear time-varying; SYNCHROSQUEEZING TRANSFORM; GABOR TRANSFORM; SIGNALS; COMPLEX;
D O I
10.1109/TSP.2021.3127678
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The octonion Fourier transform (OFT) is a useful tool for signal processing and analysis. However, due to the lack of time localization information, it is not suitable for processing signals whose frequencies vary with time. In this paper, we utilize octonion algebra to propose a new method for time-frequency representation (TFR) called the octonion short-time Fourier transform (OSTFT). The originality of the method is based on the quaternion short-time Fourier transform (QSTFT). First, we generalize the QSTFT to the OSTFT by substituting the quaternion kernel function with the octonion kernel function in the definition of the QSTFT, and the physical significance of the OSTFT is presented. Then, several essential properties of the OSTFT are derived, such as linearity, inversion formulas, time-frequency shifts and orthogonality relations. Based on the classic Fourier convolution operation, the convolution theorem for the OSTFT is derived. We apply the relationship between the OFT and OSTFT to establish Pitt's inequality and Lieb's inequality for the OSTFT. According to the logarithmic uncertainty principle of the OFT, the logarithmic uncertainty principle associated with the OSTFT is investigated. Finally, an application in which OSTFT can be used to study linear time varying (LTV) systems is proposed, and some potential applications of the OSTFT are introduced.
引用
收藏
页码:6386 / 6398
页数:13
相关论文
共 50 条
[31]   Blind Phaseless Short-Time Fourier Transform Recovery [J].
Bendory, Tamir ;
Edidin, Dan ;
Eldar, Yonina C. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (05) :3232-3241
[32]   STFNets: Learning Sensing Signals from the Time-Frequency Perspective with Short-Time Fourier Neural Networks [J].
Yao, Shuochao ;
Piao, Ailing ;
Jiang, Wenjun ;
Zhao, Yiran ;
Shao, Huajie ;
Liu, Shengzhong ;
Liu, Dongxin ;
Li, Jinyang ;
Wang, Tianshi ;
Hu, Shaohan ;
Su, Lu ;
Han, Jiawei ;
Abdelzaher, Tarek .
WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, :2192-2202
[33]   Octonion spectrum of 3D short-time LCT signals [J].
Bhat, M. Younus ;
Dar, Aamir H. .
OPTIK, 2022, 261
[34]   Enhanced Time-Frequency Representation and Mode Decomposition [J].
Zhang, Haijian ;
Hua, Guang ;
Xiang, Yong .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2021, 69 :4296-4311
[35]   ON THE POLYANALYTIC SHORT-TIME FOURIER TRANSFORM IN THE QUATERNIONIC SETTING [J].
De Martino, Antonino ;
Diki, Kamal .
COMMUNICATIONS ON PURE AND APPLIED ANALYSIS, 2021, :3629-3665
[36]   Envelope Tracking Power Amplifier Using Short-Time Fourier Transform [J].
Alon, M. ;
Shor, Y. ;
Moshkin, A. ;
Dagan, T. ;
Singer, S. .
IEEE MICROWAVE AND WIRELESS COMPONENTS LETTERS, 2021, 31 (06) :575-578
[37]   Comparisons between Fourier and STFT multipliers: The smoothing effect of the short-time Fourier transform [J].
Balazs, Peter ;
Bastianoni, Federico ;
Cordero, Elena ;
Feichtinger, Hans G. ;
Schweighofer, Nina .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2024, 529 (01)
[38]   SHORT-TIME FOURIER-TRANSFORM AND WAVELET TRANSFORM WITH FOURIER-DOMAIN PROCESSING [J].
YU, FTS ;
LU, GW .
APPLIED OPTICS, 1994, 33 (23) :5262-5270
[39]   Time-frequency synchroextracting transform [J].
Zhang, Ran ;
Liu, Xingxing ;
Zheng, Yongjun ;
Lv, Haotun ;
Li, Baosheng ;
Yang, Shenghui ;
Tan, Yu .
IET SIGNAL PROCESSING, 2022, 16 (02) :117-131
[40]   Tight frames generated by a graph short-time Fourier transform [J].
Buck, Martin ;
Okoudjou, Kasso A. .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2025, 707 :107-125