상세 보기
초록
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 multiplication; reconfigurable mesh; optimal algorithm; area-time trade off; VLSI architecture; TIME; VLSI
- 제목
- An optimal multiplication algorithm on reconfigurable mesh
- 저자
- Jang, JW; Park, H; Prasanna, VK
- 발행일
- 1997-05
- 유형
- Article
- 권
- 8
- 호
- 5
- 페이지
- 521 ~ 532