Parallel-recursive filter structures for the computation of discrete transforms

Author

Kozick, Richard J. ; Aburdene, Maurice F.

Author_Institution

Dept. of Electr. Eng., Bucknell Univ., Lewisburg, PA, USA

Volume

3

fYear

1997

fDate

21-24 Apr 1997

Firstpage

1993

Abstract

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

Keywords

Legendre polynomials; VLSI; field programmable gate arrays; parallel algorithms; recursive filters; transforms; Clenshaw´s recurrence formulae; FPGA circuits; VLSI circuits; discrete Legendre transform; discrete transforms; first-order recursive digital filter; parallel-recursive filter structures; second-order filters; second-order recursive digital filters; Concurrent computing; Digital filters; Discrete Fourier transforms; Discrete cosine transforms; Discrete transforms; Filter bank; Fourier transforms; Polynomials; Time varying systems; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1997. ICASSP-97., 1997 IEEE International Conference on

Conference_Location

Munich

ISSN

1520-6149

Print_ISBN

0-8186-7919-0

Type

conf

DOI

10.1109/ICASSP.1997.599306

Filename

599306