An Optimal Multiplication Algorithm on Reconfigurable Mesh

An O(1) time algorithm to multiply two K-bit binary numbers using an N/spl times/N bit-model of reconfigurable mesh is shown. It uses optimal mesh size and it improves previously known results for multiplication on the reconfigurable mesh. The result is obtained by using novel techniques for data representation and data movement and using multidimensional Rader Transform. The algorithm is extended to result in AT/sup 2/ optimality over 1/spl les/t/spl les//spl radic/N in a variant of the bit-model of VLSI.

[1]  Dionysios I. Reisis,et al.  Image computations on reconfigurable VLSI arrays , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[2]  Viktor K. Prasanna,et al.  A fast algorithm for computing histograms on a reconfigurable mesh , 1992, [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation.

[3]  Dionysios I. Reisis.  An efficient convex hull computation on the reconfigurable mesh , 1992, Proceedings Sixth International Parallel Processing Symposium.

[4]  J. Levison,et al.  A reconfigurable processor array with routing LSIs and general purpose DSPs , 1992, [1992] Proceedings of the International Conference on Application Specific Array Processors.

[5]  Gen-Huey Chen,et al.  Constant Time Sorting on a Processor Array with a Reconfigurable Bus System , 1990, Inf. Process. Lett..

[6]  Kurt Mehlhorn,et al.  Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time , 1984, ICALP.

[7]  C. Burrus,et al.  Fast one-dimensional digital convolution by multidimensional techniques , 1974 .

[8]  Quentin F. Stout,et al.  Meshes with multiple buses , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[9]  Hungwen Li,et al.  Configurational Computation: A New Computation Method on Processor Arrays with Reconfigurable Bus Systems , 1991, ICPP.

[10]  Franco P. Preparata,et al.  Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform , 1981, ICALP.

[11]  Bernard Chazelle,et al.  Census functions: An approach to VLSI upper bounds , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[12]  Charles M. Rader,et al.  Discrete Convolutions via Mersenne Transrorms , 1972, IEEE Transactions on Computers.

[13]  Russ Miller,et al.  Image Computations on Reconfigurable Mesh , 1988, CVPR 1988.

[14]  L. Leibowitz.  A simplified binary arithmetic for the Fermat number transform , 1976 .

[15]  Sartaj Sahni,et al.  Reconfigurable Mesh Algorithms for the Area and Perimeter of Image Components , 1991, ICPP.

[16]  J. Zhang,et al.  Integer sorting in O(1) time on an n*n reconfigurable mesh , 1992, Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings].

[17]  Viktor K. Prasanna,et al.  An Optimal Sorting Algorithm on Reconfigurable Mesh , 1995, J. Parallel Distributed Comput..

[18]  Russ Miller,et al.  Meshes with reconfigurable buses , 1988 .

[19]  Lawrence Snyder,et al.  Introduction to the configurable, highly parallel computer , 1982, Computer.

[20]  H. T. Kung,et al.  The Area-Time Complexity of Binary Multiplication , 1981, JACM.

[21]  Sartaj Sahni,et al.  Sorting n numbers on n*n reconfigurable meshes with buses , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[22]  C. C. Weems.  The performance of the Image Understanding Architecture on The DARPA integrated image understanding benchmark , 1988, Proceedings., 2nd Symposium on the Frontiers of Massively Parallel Computation.

[23]  Viktor K. Prasanna,et al.  A Fast Algorithm for Computing a Histogram on Reconfigurable Mesh , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[24]  Dionysios I. Reisis,et al.  Parallel Computations on Reconfigurable Meshes , 1993, IEEE Trans. Computers.

[25]  D. I. Reisis.  Parallel computations on meshes with static and reconfiguarble buses , 1990 .

[26]  C. Burrus,et al.  Fast Convolution using fermat number transforms with applications to digital filtering , 1974 .

[27]  Thompson.  Fourier Transforms in VLSI , 1983, IEEE Transactions on Computers.

[28]  Sartaj Sahni,et al.  Reconfigurable mesh algorithms for image shrinking, expanding, clustering, and template matching , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.

[29]  Massimo Maresca,et al.  Polymorphic-Torus Network , 1989, IEEE Trans. Computers.

[30]  Gen-Huey Chen,et al.  Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems , 1990, IEEE Trans. Parallel Distributed Syst..

[31]  David Peleg,et al.  The Power of Reconfiguration , 1991, J. Parallel Distributed Comput..

[32]  Franco P. Preparata,et al.  A Mesh-Connected Area-Time Optimal VLSI Multiplier of Large Integers , 1983, IEEE Transactions on Computers.

[33]  Jerome Rothstein,et al.  Immediate Parallel Solution of the Longest Common Subsequence Problem , 1987, ICPP.