Issue No. 05 - May (1997 vol. 46)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.589218
<p><b>Abstract</b>—Many applications in signal and image processing can be efficiently implemented on regular VLSI architectures such as systolic arrays. Multirate arrays (MRAs) are an extension of systolic arrays where different data streams are propagated with different clocks. We address the analysis and synthesis problem for this class of architectures. We present a formal definition of MRAs, as systems of recurrence equations defined over sparse polyhedral domains. We also give transformation rules for this class of recurrences, and use them to show that MRAs constitute a particular subset of systems of affine recurrence equations (SoAREs). We then address the synthesis problem, and show how an MRA can be systematically derived from an initial specification in the form of a mathematical equation. The main transformations that we use are <it>domain rescalings</it> and <it>dependency decomposition</it>, and we illustrate our method by deriving a hitherto unknown decimation filter array.</p>
Application specific processor arrays, space-time mappings, index transformations, systolic arrays, VLSI signal processing.
Patrick Lenders, Sanjay Rajopadhye, "Multirate VLSI Arrays and Their Synthesis", IEEE Transactions on Computers, vol. 46, no. , pp. 515-529, May 1997, doi:10.1109/12.589218