A transformational approach to the derivation of hardware algorithms from recurrence equations

An approach to the derivation of hardware algorithms from recurrence equations is proposed that is based on program transformation. A representation for hardware algorithms, called relational representation, is introduced, in which one relational program corresponding to a given recurrence equation (namely a specification) is transformed to another relational program corresponding to a hardware algorithm (namely an implementation). Based on the unfold/fold transformation method of logic programs, several transformation tactics have been formalized. Several implementations of hardware algorithms, such as pipelines, orthogonal grids, and trees, have been derived from their respective specifications in recurrence equations.<
>