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

  • Authors:

  • N. Yoshida

  • Affiliations:

  • Department of Computer Science and Communication Engineering, Kyushu University, Hakoxaki, Fukuoka 812, Japan

  • Venue:
  • Proceedings of the 1988 ACM/IEEE conference on Supercomputing
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

Hardware algorithms have a significant impact on the supercomputing of matrix computation and signal processing. In this paper, we propose a new approach to the derivation of hardware algorithms from recurrence equations, which is based on program transformation, and we also introduce a new representation for hardware algorithms, which we call Relational Representation. In our approach, we transform one relational program corresponding to a given recurrence equation (namely a specification) to another relational program corresponding to a hardware algorithm (namely an implementation). Based on the unfold/fold transformation method of logic programs, we have formalized several transformation tactics. We have succeeded in deriving several implementations of hardware algorithms, such as pipelines, orthogonal grids and trees, from their respective specifications in recurrence equations.