An Optimal Multiplication Algorithm on Reconfigurable Mesh (1997)
| Venue: | IEEE Transactions on Parallel and Distributed Systems |
| Citations: | 13 - 3 self |
BibTeX
@INPROCEEDINGS{Jang97anoptimal,
author = {Ju-wook Jang and Heonchul Park and Viktor K. Prasanna},
title = {An Optimal Multiplication Algorithm on Reconfigurable Mesh},
booktitle = {IEEE Transactions on Parallel and Distributed Systems},
year = {1997},
pages = {384--391}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
An O(1) time algorithm to multiply two N-bit binary numbers using an N 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 2 optimality over 1 TN in a variant of the bit-model of VLSI. Index Terms---Integer multiplication, reconfigurable mesh, optimal algorithm, area-time trade off, VLSI architecture. ------------------------------ F ------------------------------ 1I NTRODUCTION HE reconfigurable mesh is a two-dimensional mesh of processors connected by reconfigurable buses [17]. Though the buses outside the Processing Elements (PEs) are fixed, the internal connection between the I/O ports of each PE can be reconfigured by individual PEs during the execution of algorithms. The reconfigurable mesh cap...
