Design principles for iterative computation networks are considered. 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. Mathematical notation for expressing such designs is developed. This notation captures the important features and properties of these computation networks, and can be used both for analyzing and for designing computational ntworks.