Recursive formulation of short-time discrete trigonometric transforms

Recursive formulations of the moving-window discrete Fourier transform (DFT) are well known. However, recursive versions of other useful discrete transforms, like the moving-window discrete cosine transform (DCT), discrete sine transform (DST), or discrete Hartley transform (DHT), have not been developed so far. In this paper, second-order recursive expressions for the DCT, DST, and DHT, intended for real-valued windowed sequences, are presented.