DocumentCode
2437137
Title
Decimation-in-frequency vector radix algorithm for fast calculation of the 2-D NMNT
Author
Alshibami, O. ; Boussakta, S.
Author_Institution
Inst. of Integrated Inf. Syst., Leeds Univ., UK
Volume
3
fYear
2002
fDate
2002
Firstpage
939
Abstract
For fast calculation of the two-dimensional New Mersenne Number Transform (2-D NMNT), the decimation-in-frequency vector-radix algorithm is developed. The arithmetic complexity of the developed algorithm has been analysed and compared to the row-column approach using multiple butterflies. The results show that the 2-D vector radix algorithm reduces both the number of multiplications and additions.
Keywords
computational complexity; convolution; correlation theory; digital arithmetic; transforms; 2D new Mersenne number transform; additions reduction; arithmetic complexity analysis; cyclic convolution property; decimation-in-frequency vector-radix algorithm; fast calculation; multiplications reduction; Algorithm design and analysis; Arithmetic; Convolution; Costs; Helium; Information systems; Kernel; Partitioning algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Electronics, Circuits and Systems, 2002. 9th International Conference on
Print_ISBN
0-7803-7596-3
Type
conf
DOI
10.1109/ICECS.2002.1046403
Filename
1046403
Link To Document