Complex convolutions using rectangular transforms

Following the earlier technique1 and using the modular arithmetic, a method is proposed to compute error-free complex convolutions using rectangular transforms with reduced number of multiplications. Application of Chinese remainder theorem is suggested to implement the complex convolution with parallel digital machines of shorter word-length, thereby allowing higher speed with no increase in hardware.