An optimal multiplication algorithm for reconfigurable mesh

It is shown that multiplication of two N-bit integers can be performed in O(1) time on N*N reconfigurable mesh. This result is obtained by combining the O(1) time multiplication algorithm on N*N/sup 2/ reconfigurable mesh, the Rader transform, and decomposition of one-dimensional convolution into multidimensional convolution. Choosing the Radar transform at the expense of long word length frees one from storing twiddle factors in advance, which is needed in other designs. It is also shown that the present algorithm can be simulated on other restricted reconfigurable mesh models without asymptotic increase in time or number of processing elements. It is shown that the present result can be extended to provide area-time tradeoffs in the usual bit model of VLSI to satisfy AT/sup 2/ optimality over 1<or=T<or= square root N.<<ETX>>

[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]  Quentin F. Stout,et al.  Meshes with multiple buses , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[17]  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..

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

[19]  Kurt Mehlhorn,et al.  Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time , 1983, Inf. Control..

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

[21]  Viktor K. Prasanna,et al.  An optimal sorting algorithm on reconfigurable mesh , 1992, Proceedings Sixth International Parallel Processing Symposium.

[22]  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.

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

[24]  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.

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

[26]  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.

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

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

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

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