Parallel processing of digital convolution using finite polynomial rings

General method for the computation of digital convolution using residue arithmetic is developed. By the use of polynomial transforms over finite polynomial rings, convolution length and structural complexity typical for the FFT method are combined with simplest residue arithmetic. The whole structure is fully parallel and few building blocks composed of large VLSI ROM arrays are sufficient for high-speed pipelined computations of digital convolution.