Name
Abstract | ||
|---|---|---|
The S-transform (ST) is a linear time-frequency representation containing characteristics from the short-time Fourier transform and the wavelet transform with a frequency-dependent localizing window. As other linear time-frequency representations, one of the main applications of the ST is time-frequency filtering, which necessitates devising efficient methods for signal reconstruction from modified representations. In this paper, an algorithm for least-squares synthesis from modified ST is presented, requiring the same computational complexity as the forward transform. Additionally, for the same purpose, another faster and more flexible method is developed by means of which the signal is reconstructed by using only part of the modified representation whose size is similar to that of the original signal and contains almost no redundant information. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/SSP.2018.8450851 | 2018 IEEE Statistical Signal Processing Workshop (SSP) |
Keywords | Field | DocType |
Least-squares,short-time Fourier transform,S-transform,time-frequency representation,wavelet transform | Least squares,Computer science,Filter (signal processing),Algorithm,Short-time Fourier transform,Fourier transform,S transform,Time–frequency representation,Signal reconstruction,Wavelet transform | Conference |
ISBN | Citations | PageRank |
978-1-5386-1572-0 | 0 | 0.34 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yazan Abdoush | 1 | 2 | 2.09 |
| Giacomo Pojani | 2 | 1 | 1.37 |
| Giovanni Emanuele Corazza | 3 | 382 | 48.58 |