返回
摘要
En 中文
Discrete sine transform (DST) is widely used in digital signal processing such as image coding, spectral analysis, feature extraction, and filtering. This is because the discrete sine transform is close to the optimal Karhunen-Loeve transform for first-order Markov stationary signals with low correlation coefficients. Short-time (hopping) discrete sine transform can be employed for time-frequency analysis and adaptive processing quasi-stationary data such as speech, biomedical, radar and communication signals. Hopping transform refers to a transform computed on the signal of a fixed-size window that slides over the signal with an integer hop step. In this paper, we first derive a second-order recursive equation between DST spectra in equidistant signal windows, and then propose two fast algorithms for computing the hopping DST based on the recursive relationship and input-pruned DST algorithm. The performance of the proposed algorithms with respect to computational costs and execution time is compared with that of conventional sliding and fast DST algorithms. The computational complexity of the developed algorithms is lower than any of the existing algorithms, resulting in significant time savings.
Keyword:
Transforms
Signal processing algorithms
Discrete cosine transforms
Time-frequency analysis
Spectral analysis
Laplace equations
Correlation coefficient
Discrete sine transform
hopping algorithm
short-time transform
sliding algorithm
signal processing
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Radar Emitter Recognition Based on the Energy Cumulant of Short Time Fourier Transform and Reinforced Deep Belief Network
SENSORS
IF3.5
Time-Frequency Analysis of Non-Stationary Biological Signals with Sparse Linear Regression Based Fourier Linear Combiner
SENSORS
IF3.5
A Robust and Real-Time Capable Envelope-Based Algorithm for Heart Sound Classification: Validation under Different Physiological Conditions
SENSORS
IF3.5

