Enhancing Mersenne transforms by RNS with application to discrete convolution
It is a known fact that the computation costs for calculating the discrete convolution are relatively high so that many attempts have been made to overcome this difficulty. An approach is based on the Mersenne transform (MT) which involves only additions and circular shifts. On the other hand, when using MT one must take into account some limitations. (length of the input vector, value of the output vector, etc). Here, the authors combine the MT with the Residue Number Systems adn by splitting the initial convolution into several smaller ones, a larger dynamic range of values is obtained. Several examples validate the advantage of the presented method.
- Computer implementation of efficient discrete-convolution algorithms
- Mersenne numbers in the bases of systems of residual classes when transmitting data in serial communication channels
- scientific article; zbMATH DE number 803928 (Why is no real title available?)
- A new algorithm of fast Mersenne-transform and the application in calculating convolution
This page was built for publication: Enhancing Mersenne transforms by RNS with application to discrete convolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352603)