Filter
Digital and other filter design and analysis.
Depends on: Algebra
Details:
Filter provides extensive support for designing and using digital FIRs (Finite Impulse Response filters), for DFTs (Discrete Fourier Transforms), many fast algorithms (FFTs) for implementing them, and many fast functions that exploit them (such as convolutions).
A range of analogue filters are also supported, as are both Fourier Series and (analogue) Fourier Transforms.
The FFT algorithms are written with an emphasis on accuracy; important when they are used by the Multi subsystem for fast multi-million digit arithmetic.
Author: Robert D. Campbell
Published by: Anton Shelin