PRNS approach to fast FIR filtering

Author

Skavantzos, Alexander ; Aravena, Jorge ; Gupta, Suhas

Author_Institution

Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA

fYear

1990

fDate

1-4 Apr 1990

Firstpage

223

Abstract

A system for the implementation of fast finite impulse response (FIR) filtering in digital signal processing (DSP) operations is outlined. The system uses only real arithmetic and possesses many of the good numerical characteristics of the discrete Fourier transform (DFT)-based implementations. The basic concept underlying the implementation is that of polynomial residue number systems (PRNS). PRNS is used as an efficient way for computing polynomial products. This concept allows the computation of cyclic convolutions in a completely concurrent form. Some aspects of the hardware implementation in the scheme of butterfly modules and in systolic architectures are analyzed

Keywords

computerised signal processing; digital arithmetic; filtering and prediction theory; systolic arrays; DSP; PRNS; butterfly modules; cyclic convolutions; digital signal processing; fast FIR filtering; finite impulse response; polynomial products; polynomial residue number systems; real arithmetic; systolic architectures; Arithmetic; Concurrent computing; Convolution; Digital filters; Digital signal processing; Discrete Fourier transforms; Filtering; Finite impulse response filter; Hardware; Polynomials;

fLanguage

English

Publisher

ieee

Conference_Titel

Southeastcon '90. Proceedings., IEEE

Conference_Location

New Orleans, LA

Type

conf

DOI

10.1109/SECON.1990.117805

Filename

117805