Fast algorithms for the computation of sliding discrete sinusoidal transforms

Authors:
V. Kober
Affiliations:
Dept. of Comput. Sci., CICESE, Ensenada, Mexico
Venue:
IEEE Transactions on Signal Processing
Year:
2004

Citing 0
Cited 4

Space-variant restoration with sliding discrete cosine transform

CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
A general design for one dimensional discrete sine transform

Analog Integrated Circuits and Signal Processing
Fast algorithms for the computation of sliding sequency-ordered complex hadamard transform

IEEE Transactions on Signal Processing
Enhancement of noisy images with sliding discrete cosine transform

ICIAP'05 Proceedings of the 13th international conference on Image Analysis and Processing

Quantified Score

Hi-index	35.69

Visualization

Abstract

Fast algorithms for computing various discrete cosine transforms and discrete sine transforms in a sliding window are proposed. The algorithms are based on a recursive relationship between three subsequent local transform spectra. Efficient inverse algorithms for signal processing in a sliding window are also presented. The computational complexity of the algorithms is compared with that of known fast discrete sinusoidal transforms and running recursive algorithms.