L. Rapanotti
G.M. Megson
University of Newcastle upon Tyne. 1994
Design methodologies and systems for regular array architectures are becoming increasingly popular as they provide unified environments for the application of specification transformations at all design levels. These transformations are collectively known as high-level synthesis. Among them, uniformisation plays a central r™le for the derivation of systolic array designs. We present a new uniformisation technique for a class of integral recurrence equations, i.e., equations whose data dependencies are defined through integral functions. This uniformisation technique extends the more traditional technique for affine recurrences in a sound and consistent way, allowing us to overcome some of the limitations of the existing methods, while preserving their syntactic and semantic frameworks. Our technique is based on the reduction/decomposition of integral recurrences into their atomic components and their subsequent uniformisation. We illustrate the method by considering modulo index functions occurring in signal processing systems, this demonstrates that synthesis methods can be applied to more general classes of iterative algorithms.