Odd Even Shifts in SIMD Hypercubes

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(M/sup 2/+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 N/sup 2/ processor SIMD hypercube. This improves the previous best complexity of O(M/sup 2/ log M+log N). >

[1]  Azriel Rosenfeld,et al.  Digital Picture Processing , 1976 .

[2]  Sartaj Sahni,et al.  Parallel permutation and sorting algorithms and a new generalized connection network , 1982, JACM.

[3]  Lionel M. Ni,et al.  Parallel Algorithms for 2-D Convolution , 1986, ICPP.

[4]  Dana H. Ballard,et al.  Computer Vision , 1982 .

[5]  Viktor K. Prasanna,et al.  Efficient Image Template Matching on Hypercube SIMD Arrays , 1987, International Conference on Parallel Processing.

[6]  Sartaj Sahni,et al.  Parallel Matrix and Graph Algorithms , 1981, SIAM J. Comput..

[7]  Sartaj Sahni,et al.  Optimal BPC Permutations on a Cube Connected SIMD Computer , 1982, IEEE Transactions on Computers.

[8]  Sartaj Sahni,et al.  Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.

[9]  Xiaobo Li,et al.  Parallel Algorithms for Image Template Matching on Hypercube SIMD Computers , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.