Trading Bitwidth For Array Size: A Unified Reconfigurable Arithmetic Processor Design

  • Authors:
  • Affiliations:
  • Venue:
  • ISQED '01 Proceedings of the 2nd International Symposium on Quality Electronic Design
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a novel unified run-time reconfiguable arithmetic processor design scheme. It provides novel computational trade-offs between array/matrix size and input data item bitwidth, and efficiently performs multiple types of arithmetic operations in pipeline within a single hardware-reusable processor. The proposed computations include inner product evaluation, matrix multiplication, and evaluation of polynomial. More specifically, we show that the minimum hardware platform can be easily reconfigured to compute: (1) the inner products of two input arrays with several combinations of array dimension and precision, including input arrays of 256 4-bit items, 64 8-bit items, 16 16-bit items, 4 32-bit items and 1 64-bit item; (2) the product of matrices Xnk and Ykm for any integers n, k, m and any item precision b ranging from 4 to 64 bits, including input arrays of X16x16 Y16x16 of 4-bit items, X8x8 and Y8x8 of 8-bit items, X4x4, Y4x4 of 16-bit items, X2x2, Y2x2 of 32-bit items and the product of two 64-bit numbers; (3) the polynomial evaluations at any given point x, with several combinations of the polynomial degree N and evaluation point number precision p, including polynomial degree and item precision options of N=64, p=8, N=16, p=16, and N=4, p=32.