A hardware efficient realisation of number theoretic convolvers

In this paper, we propose hardware realisations of Number Theoretic Transforms that are based on the transformation of their fundamental relationships into recursive filter forms with single integer poles. Furthermore use is made of Read-Only- Memory(ROM) to effect the multiplications by the root of unity, α Suitable NTTs are then suggested for the fast computation of cyclic convolutions using multi-dimensional and multi-modular techniques. The required ROM size in the proposed realisations is small and the control of data flow is simple and straightforward. This new class of Number Theoretic Transforms can relax considerably the normal sequence length and wordlength constraints for the NTT.