Abstract
Number theoretic transforms (NTTs) find applications in the calculation of convolutions and correlations. They can perform these calculations without introducing additional noise in the processing due to rounding or truncation. Among all NTTs, Fermat and Mersenne number transforms have been given particular attention. However, the main drawback of these transforms is the inconvenient word length for the Fermat number transforms, and lack of fast algorithms for the Mersenne number transforms. The authors aim to introduce a new real transform defined modulo Mersenne numbers with long transform length equal to a power of two. This is achieved by dropping the condition that /spl alpha/_ should be /spl plusmn/2 and using a new definition for NTTs that departs from the usual Fourier-like definition. The new transform is suitable for fast algorithms. It has the cyclic convolution property and hence can be applied to the calculation of convolutions and correlations. The transform is extended to the two-dimensional case and then generalised to the multidimensional case. Examples are given for the one-dimensional and two-dimensional cases.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEE Proceedings - Vision, Image, and Signal Processing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
