This code example demonstrates the convolution theorem with the use of the Complex Fast Fourier Transform (FFT), complex-by-complex multiplication, and support functions, which are part of the ...

This series is excerpted from “Digital Signal Processing: Instant Access.” Order this book today and receive an additional 20% discount. Click here www.elsevierdirect.com and be sure to type in 92836.

Abstract: This chapter contains sections titled: Introduction, The Convolution Theorem for Z-Transforms, Convolution and General Linear Time-Invariant Systems, Algebraic Properties of the General ...

Abstract: A new, computationally efficient, algorithm for linear convolution is proposed. This algorithm uses an N point instead of the usual 2N-1 point circular convolution to produce a linear ...