Vector radix-4 × 4 for fast calculation of the 2-D new Mersenne number transform

Authors:
S. Boussakta;O. Alshibami;A. Bouridane
Affiliations:
Institute of Integrated Information Systems, School of Electronic and Electrical Engineering, University of Leeds, Leeds LS2 9JT, UK;Institute of Integrated Information Systems, School of Electronic and Electrical Engineering, University of Leeds, Leeds LS2 9JT, UK;School of Computer Science, Queen's University Belfast BT7 1NN, Belfast, UK
Venue:
Signal Processing
Year:
2004

Citing 7
Cited 0

Number theory in science and communication

Number theory in science and communication
CMOS VLSI circuits of pipeline sections for 32 and 64-point Fermat number transformers

Integration, the VLSI Journal
VLSI implementation issues for the 2-D Fermat number transform

Signal Processing
Digital signal processing: efficient convolution and Fourier transform techniques

Digital signal processing: efficient convolution and Fourier transform techniques
A novel method for parallel image processing applications

Journal of Systems Architecture: the EUROMICRO Journal - Special issue on parallel image proccesing (PIP)
Number Theory in Digital Signal Processing

Number Theory in Digital Signal Processing
The modified number theoretic transform over the direct sum offinite fields to compute the linear convolution

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.08

Visualization

Abstract

This paper describes the vector-radix-4 × 4 decimation-in-time (VR-4 × 4 DIT) for fast calculation of the two-dimensional new Mersenne number transform (2-D NMNT). The new 2-D algorithm is developed and implemented. Its arithmetic complexity is also analysed. Since the 2-D NMNT can be used for error-free calculation of 2-D convolution and auto/cross-correlation functions, the use of this algorithm will improve the efficiency of calculating these functions using the 2-D NMNT leading to a better performance of related applications. The new VR-4 × 4 and existing 2-D NMNT algorithms are compared with respect to their arithmetic operations and computer runtimes. Finally, an example is given to prove the validity of the developed algorithm and the error-free nature of the 2-D NMNT.