A computationally efficient implementation of quadratic time-frequency distributions

Time-frequency distributions (TFDs) are computationally intensive methods. A very common class of TFDs namely quadratic TFDs, is obtained by time-frequency (TF) smoothing the Wigner Ville distribution (WVD). In this paper a computationally efficient implementation of this class of TFDs is presented. In order to avoid artifacts caused by circular convolution, linear convolution is applied in both the time and frequency directions. Four different kernel types are identified and separate optimised implementations are presented for each kernel type. ne computational complexity is presented for the different kernel types