Chapter 11

Efficient Algorithms

Leonid Yaroslavsky

Abstract

Transform domain signal processing might be very time consuming unless efficient computational algorithms are used. In this chapter, we describe application of Fast Fourier and Fast Cosine Transform to computing signal convolution and Scaled and Rotated Discrete Fourier Transforms and, in addition, recursive algorithms for computing local signal DFT and DCT spectra in sliding window.

Total Pages: 103-111 (9)

Purchase Chapter  Book Details

RELATED BOOKS

.Ion Implantation and Activation.
.Ion Implantation and Activation.
.Ion Implantation and Activation.
.Classical Mechanics and Quantum Mechanics: An Historic-Axiomatic Approach.