High-speed convolution using GQRNS arithmetic hardware

Generalized quadratic residue number systems (GQRNS) offer the possibility of real-time convolution using highly parallel real integer arithmetic. Using carefully chosen moduli, an overlap-and-save or overlap-and-add algorithm can be implemented that is far superior to the normal FFT-based convolution algorithms. Using the recursive algorithm for a GQRNS CNTT and an overlap of one data point, an extremely efficient algorithm is obtained. A 216-point GQRNS convolution can be implemented with less hardware and higher speed than a 128-point FFT-based convolution. Similarly, a 1296-point GQRNS convolution can be implemented with less hardware and higher speed than a 1024-point FFT-based convolution