Sequencer-based data path synthesis of regular iterative algorithms

Mohammed Aloqeely, Chien Yi Roger Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Scopus citations

Abstract

In many applications, especially signal processing and matrix computations, algorithms are in a highly regular iterative form; access patterns for most variables are highly regular and uniform. Instead of always storing the values of variables back to and retrieving them from memory or register files, it will be much more efficient and cost effective to let those variables intelligently 'stay' or 'flow' in the data path for future use. In this paper, low cost and simple structured sequencers which are best exemplified by hardware stacks and queues are introduced in the data path for efficiently implementing such a novel concept. Various algorithms are developed to map variables to sequencers and to integrate sequencers into conventional high-level synthesis procedures. Experimental results show very encouraging improvement in the performance of designs as well as significant reduction in hardware cost.

Original languageEnglish (US)
Title of host publicationProceedings - Design Automation Conference
PublisherIEEE Computer Society
Pages155-160
Number of pages6
StatePublished - 1994
EventProceedings of the 31st Design Automation Conference - San Diego, CA, USA
Duration: Jun 6 1994Jun 10 1994

Other

OtherProceedings of the 31st Design Automation Conference
CitySan Diego, CA, USA
Period6/6/946/10/94

ASJC Scopus subject areas

  • Hardware and Architecture
  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Sequencer-based data path synthesis of regular iterative algorithms'. Together they form a unique fingerprint.

  • Cite this

    Aloqeely, M., & Chen, C. Y. R. (1994). Sequencer-based data path synthesis of regular iterative algorithms. In Proceedings - Design Automation Conference (pp. 155-160). IEEE Computer Society.