The Community for Technology Leaders
Green Image
Issue No. 03 - March (1990 vol. 12)
ISSN: 0162-8828
pp: 315-318
<p>An efficient parallel algorithm is presented for convolution on a mesh-connected computer with wraparound. The algorithm does not require a broadcast feature for data values, as assumed by previously proposed algorithms. As a result, the algorithm is applicable to both SIMD and MIMD meshes. For an N*N image and a M*M template, the previous algorithms take O(M/sup 2/q) time on an N*N mesh-connected multicomputer (q is the number of bits in each entry of the convolution matrix). The algorithms have complexity O(M/sup 2/r), where r=max (number of bits in an image entry, number of bits in a template entry). In addition to not requiring a broadcast capability, these algorithms are faster for binary images.</p>
computerised picture processing; SIMD meshes; mesh connected multicomputers; efficient parallel algorithm; wraparound; MIMD meshes; convolution matrix; computational complexity; computerised picture processing; parallel processing

S. Sanhi and S. Ranka, "Convolution on Mesh Connected Multicomputers," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 12, no. , pp. 315-318, 1990.
80 ms
(Ver 3.3 (11022016))