The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (1990 vol.1)
pp: 77-82
ABSTRACT
<p> 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).</p>
INDEX TERMS
Index Termsimage template matching; odd even shifts; odd length circular shifts; odd shifts; data routing; parallel processing; parallel algorithms; linear-time algorithm; two-dimensional convolution; N/sup 2/ processor SIMD hypercube; complexity; computational complexity; computer vision; computerised pattern recognition; computerised picture processing; parallel algorithms
CITATION
S. Ranka, S. Sahni, "Odd Even Shifts in SIMD Hypercubes", IEEE Transactions on Parallel & Distributed Systems, vol.1, no. 1, pp. 77-82, January 1990, doi:10.1109/71.80126
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool