Mathematical approach to iterative computation networks

This paper deals with design principles for Iterative computation networks. Such computation networks are used for performing repetitive computations which typically are not data-dependent. Most of the signal processing algorithms, like FFT and filtering, belong to this class. The main idea in this paper is the development of mathematical notation for expressing such designs. This notation captures the important features and properties of these computation networks, and can be used both for analyzing and for designing computational networks.