Article ID Journal Published Year Pages File Type
4975463 Journal of the Franklin Institute 2013 16 Pages PDF
Abstract
When processing a signal or an image using the Discrete Cosine Transform (DCT) or Discrete Sine Transform (DST), a typical approach is to extract a portion of the signal by windowing and then form the DCT or DST of the window contents. By shifting the window point by point over the signal, the entire signal may be processed. In this paper we develop algorithms to “update” the DCT and DST to reflect the modified window contents using less computation than by directly evaluating the modified transform via standard Fast Transform algorithms. Our algorithms constitute an improvement over previous DCT/ DST update algorithms because our approach establishes independence between the DCT and the DST: the algorithm for DCT makes use only of DCT terms, and similarly for DST. Algorithms are derived for use without windowing and with split-triangular, Hanning, Hamming and Blackman windows.
Related Topics
Physical Sciences and Engineering Computer Science Signal Processing
Authors
, , ,