An optimal multiplication algorithm on reconfigurable mesh

  • Jang, JW
  • Park, H
  • Prasanna, VK
Citations

WEB OF SCIENCE

4
Citations

SCOPUS

12

초록

An O(1) time algorithm to multiply two N-bit binary numbers using an N x 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 less than or equal to T less than or equal to root N in a variant of the bit-model of VLSI.

키워드

integer multiplicationreconfigurable meshoptimal algorithmarea-time trade offVLSI architectureTIMEVLSI
제목
An optimal multiplication algorithm on reconfigurable mesh
저자
Jang, JWPark, HPrasanna, VK
DOI
10.1109/71.598278
발행일
1997-05
유형
Article
저널명
IEEE Transactions on Parallel and Distributed Systems
8
5
페이지
521 ~ 532