Fast algorithm for the 2-D new Mersenne number transform

摘要

This paper introduces the development and derivations of the 2-D vector-radix algorithm for the calculation of the 2-D new Mersenne number transform. Th algorithm is implemented, its arithmetic complexity is analysed and compared to the row-column approach. The vector-radix algorithm is found to be more efficient and involves fewer arithmetic operations than the row-column approach. Using random data, an example is given showing the validity of the developed algorithm and the exact nature of the transform.