SoC memory hierarchy derivation from dataflow graphs

Scott Fischaber, Roger Woods, John McAllister

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)
3 Downloads (Pure)

Abstract

Hardware synthesis from dataflow graphs of signal processing systems is a growing research area as focus shifts to high level design methodologies. For data intensive systems, dataflow based synthesis can lead to an inefficient usage of memory due to the restrictive nature of synchronous dataflow and its inability to easily model data reuse. This paper explores how dataflow graph changes can be used to drive both the on-chip and off-chip memory organisation and how these memory architectures can be mapped to a hardware implementation. By exploiting the data reuse inherent to many image processing algorithms and by creating memory hierarchies, off-chip memory bandwidth can be reduced by a factor of a thousand from the original dataflow graph level specification of a motion estimation algorithm, with a minimal increase in memory size. This analysis is verified using results gathered from implementation of the motion estimation algorithm on a Xilinx Virtex-4 FPGA, where the delay between the memories and processing elements drops from 14.2 ns down to 1.878 ns through the refinement of the memory architecture. Care must be taken when modeling these algorithms however, as inefficiencies in these models can be easily translated into overuse of hardware resources.
Original languageEnglish
Pages (from-to)345-361
Number of pages17
Journal Journal of Signal Processing Systems
Volume60
Issue number3
DOIs
Publication statusPublished - Sep 2009

ASJC Scopus subject areas

  • Hardware and Architecture
  • Information Systems
  • Signal Processing
  • Theoretical Computer Science
  • Control and Systems Engineering
  • Modelling and Simulation

Fingerprint Dive into the research topics of 'SoC memory hierarchy derivation from dataflow graphs'. Together they form a unique fingerprint.

Cite this