Towards a Formal Treatment of VLSI Arrays
Abstract
This paper presents a formalism for describing the behavior of computational networks at the algorithmic level. It establishes a direct correspondence between the mathematical expressions defining a function and the computational networks which compute that function. By formally manipulating the symbolic expressions that define a function, it is possible to obtain different networks that compute the function. From this mathematical description of a network, one can directly determine certain important characteristics of computational networks, such as computational rate, performance and communication requirements. The use of this formalism for design and verification is demonstrated on computational networks for Finite Impulse Response (FIR) filters, matrix operations, and the Discrete Fourier Transform (DFT). The progression of computations can often be modeled by wave fronts in an illuminating way. The formalism supports this model. A computational network can be viewed in an abstract form that can be represented as a graph. The duality between the graph representation and the mathematical expressions is briefly introduced.
Attached Files
Accepted Version - 4191_TR_81.pdf
Accepted Version - 4191_TR_81.ps
Files
Name | Size | Download all |
---|---|---|
md5:248e84a2cd4cb7824fa753c7d93501e8
|
1.2 MB | Preview Download |
md5:949f8f95449efcae50626ad792668ffb
|
1.4 MB | Download |
Additional details
- Eprint ID
- 27041
- Resolver ID
- CaltechCSTR:1981.4191-tr-81
- Created
-
2002-11-27Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Computer Science Technical Reports