A general approach is presented for implementing discrete transforms as a set of rst-order or second-order recursive digital lters. Clenshaw's recurrence formulae are used to formulate the second-order lters. The resulting structure is suitable for e cient implementation of discrete transforms in VLSI or FPGA circuits. The general approach is applied to the… (More)