Very Large Scale Integration (VLSI) Approach To Real-Time Computation Problems
This paper presents a formalism for describing the behavior of computational networks at the algorithmic level that establishes a direct correspondence between mathematical expressions defining a function and the networks which compute that function.
Abstract
This paper presents a formalism for describing the behavior of computational networks at the algorithmic level. It establishes a direct correspondence between mathematical expressions defining a function and the 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. Certain important characteristics of computational networks, such as computational rate, performance and communication requirements can directly be determined from this mathematical description. The use of this formalism for design and verification is demonstrated on a few computational networks for functions typical in signal processing.