Hopping discrete cosine transform

The paper deals with the design of a fast algorithm for computing the hopping discrete cosine transform in equidistant signal windows using a recursive relationship between transform spectra. Discrete cosine transform is widely used in digital signal processing such as image coding, spectral analysis, feature extraction, and filtering. Short-time transform is suitable for adaptive processing and time-frequency analysis of quasi-stationary data. 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. Hopping discrete transform can be employed for time-frequency analysis and adaptive processing quasi-stationary data such as speech, biomedical, radar and communication signals. The performance of the algorithm with respect to computational costs and execution time is compared with that of conventional sliding and fast algorithms.