Hardware realization of Mersenne number transforms for fast digital convolution

In this paper we convert the Mersenne-prime and Mersenne-composite Number Transforms into recursive filter form and propose simple hardware structures to carry out the fast implementation of circular convolutions. We also present the results of our study employing efficient methods to complute long circular convolutions using the Mersenne Number Transforms.