Generalized running discrete transforms

This paper introduces a generalized running discrete transform with respect to arbitrary transform bases, and relates the generalized transform to the running discrete Fourier z and short-time discrete Fourier transforms. Concepts associated with the running and short-time discrete Fourier transforms such as 1) filter bank implementation, 2) synthesis of the original sequence by summation of the filter bank outputs, 3) frequency sampling, and 4) recursive implementations are all extended to the generalized transform case. A formula is obtained for computing the transform coefficients of a segment of data at time n recursively from the transform coefficients of the segment of data at time n - 1. The computational efficiency of this formula is studied, and the class of transforms requiring the minimum possible number of arithmetic operations per coefficient is described.