Fast Arithmetic on Reconfigurable Meshes

We show an O(1) time algorithm for computing the N-point Discrete Fourier Transform (DFT) on an NlogN x NlogN reconfigurable mesh, where each poitn is represented using \Theta(logN) bits. Based on the DFT algorithm, we derive O(1) time algorithms for N-bit multiplication, N-bit modular operations, and computing the quotient of two N-bit numbers on an N x N bit model of the reconfigurable mesh. The proposed algorithms lead to AT^2 optimal designs in the bit model of VLSI for 1 \leqslant T \leqslant \sqrt N. All these algorithms run on the MRN, RMESH, and PARBUS models of the reconfigurable mesh, and employ optimal size of the mesh.

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

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

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

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

[5]  H. T. Kung,et al.  The chip complexity of binary arithmetic , 1980, STOC '80.

[6]  Stephen A. Cook,et al.  Log Depth Circuits for Division and Related Problems , 1986, SIAM J. Comput..

[7]  Rong Lin.  Reconfigurable Buses with Shift Switching - VLSI RADIX Sort , 1992, ICPP.

[8]  Natarajan Shankar,et al.  Efficient Parallel Circuits and Algorithms for Division , 1988, Inf. Process. Lett..

[9]  Stephan Olariu,et al.  Fast computer vision algorithms for reconfigurable meshes , 1992, Proceedings Sixth International Parallel Processing Symposium.

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

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

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

[13]  S. Olariu,et al.  Reconfigurable buses with shift switching-architectures and applications , 1993, Proceedings of Phoenix Conference on Computers and Communications.

[14]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[15]  S. Olariu,et al.  Computing the Inner Product on Reconfigurable Buses with Shift Switching , 1992, CONPAR.

[16]  Ferruccio Barsi.  Mod m Arithmetic in Binary Systems , 1991, Inf. Process. Lett..

[17]  Viktor K. Prasanna,et al.  An optimal multiplication algorithm for reconfigurable mesh , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.