PRNS approach to fast FIR filtering

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.<
>