Parallel-recusive filter structures for the computation of discrete transforms
Data(s) |
01/01/1997
|
---|---|
Resumo |
A general approach is presented for implementing discrete transforms as a set of first-order or second-order recursive digital filters. Clenshaw's recurrence formulae are used to formulate the second-order filters. The resulting structure is suitable for efficient implementation of discrete transforms in VLSI or FPGA circuits. The general approach is applied to the discrete Legendre transform as an illustration. |
Identificador | |
Publicador |
Bucknell Digital Commons |
Fonte |
Faculty Journal Articles |
Palavras-Chave | #Concurrent computing #Digital filters #Discrete Fourier transforms #Discrete cosine transforms #Discrete transforms #Filter bank #Fourier transforms #Polynomials #Time varying systems #Very large scale integration |
Tipo |
text |