Abstract
Image processing generally requires to manipulate a large number of data of small granularity. In this paper a multiprocessor architecture which allows an efficient image processing in VLSI is proposed. The proposed network is as efficient as hypercube using O(n 1/2 log n) less chip area when n is the number of nodes in the network. The effectiveness of the proposed design is verified by studying some important image processing algorithms developed for hypercube network. The proposed architecture is also simple and modular, and thus it is relatively easier to develop efficient fault tolerance designs.
This work was supported in part by NSF Grant MIP-9009643.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R.J. Offen, “VLSI Image Processing,” Reading, 1985, NcGraw-Hill, New York.
T.E. Chan and Y. Saad, “Multigrid Algorithms on Hypercube Multiprocessor,” IEEE Trans. Comput. vol. c-35, pp. 969–977, Nov. 1986.
V.K. Prasanna Kumar and V. Krishnan, “Efficient Image Template Matching on SIMD Hypercube Machines,” in Proc. Int'l Conference on Parallel Processing, pp. 756–771, Aug. 1987.
J.H. Baek and K.A. Teague, “Parallel Edge Detection on the Hypercube,” in Proc. Fourth Conference on Hypercubes, Concurrent Computers, and Applications, pp. 983–986, March 1989.
S. Ranka and S. Sahni, “Hypercube Algorithms for Image Transformations,” in Proc. Int'l Conference on Parallel Processing, pp. III 24–31, Aug. 1989.
W.R. Moore, “A Review of Fault-Tolerant Techniques for the Enhancement of Integrated Circuit Yield,” Proc. IEEE, vol. 74, pp.684–698, May 1986.
F.P. Preparata and J. Vuillemin, “The Cube-Connected Cycles: A versatile network for parallel computation,” Commun. ACM, vol. 24, pp. 300–309, May 1981.
J.J. Shen and I. Koren, “Yield Enhancement Designs for WSI Cube-Connected Cycles,” in Proc. Int'l Conf. Wafer Scale Integration, pp. 289–298, Jan. 1989.
M.S. Krishnan and J.P. Hayes, “An Array Layout Methodology for VLSI Circuits,” IEEE Trans. Comput. vol. c-35, pp. 1055–1067, Dec. 1986.
P. Banerjee, S.Y. Kuo and W.K. Fuchs, “Reconfigurable Cube-Connected Cycles Architectures,” in Proc. 16th Int'l Symp. Fault-Tolerant Computing., pp. 286–291, June 1986.
H.Y. Youn et al., “An Efficient Reconfiguration Scheme for WSI of Cube-Connected Cycles with Bounded Channel Width,” in Proc. 1989 Int'l Workshop on Defect and Fault Tolerance in VLSI Systems, Oct. 1989.
S. Ranka and S. Sahni, “Image Template Matching on MIMD Hypercube Multicomputers,” in Proc. Int'l Conference on Parallel Processing, Vol III. pp. 92–99, Aug. 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Youn, H.Y. (1991). An efficient multiprocessor architecture for image processing in VLSI. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_199
Download citation
DOI: https://doi.org/10.1007/3-540-54029-6_199
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54029-8
Online ISBN: 978-3-540-47359-6
eBook Packages: Springer Book Archive