Title :
Odd even shifts in SIMD hypercubes
Author :
Ranka, Sanjay ; Sahni, Sartaj
Author_Institution :
Center for Sci. & Technol., Syracuse Univ., NY, USA
fDate :
1/1/1990 12:00:00 AM
Abstract :
A linear-time algorithm is developed to perform all odd (even) length circular shifts of data in an SIMD (single-instruction-stream, multiple-data-stream) hypercube. As an application, the algorithm is used to obtain an O(M2+log N) time and O(1) memory per processor algorithm to compute the two-dimensional convolution of an N×N image and an M×M template on an N2 processor SIMD hypercube. This improves the previous best complexity of O(M2 log M+log N)
Keywords :
computational complexity; computer vision; computerised pattern recognition; computerised picture processing; parallel algorithms; N2 processor SIMD hypercube; complexity; data routing; image template matching; linear-time algorithm; odd even shifts; odd length circular shifts; odd shifts; parallel algorithms; parallel processing; two-dimensional convolution; Broadcasting; Clocks; Computer vision; Concurrent computing; Convolution; Hypercubes; Linear algebra; Registers; Routing; Sorting;
Journal_Title :
Parallel and Distributed Systems, IEEE Transactions on
