Dataflow Diagrams

Dataflow diagrams are data-dependency graphs where the computation is divided into clock cycles.
  • Purpose:
    • Provide a disciplined approach for designing datapath-centric circuits.
    • Guide the design from algorithm, through high-level models, and finally to RTL code for the datapath and control circuitry.
    • Estimate area and performance.
    • Make tradeoffs between different design options.
  • Background
    • Based on techniques from high-level synthesis tools.
    • Some similarity between high-level synthesis and software compilation.
    • Each dataflow diagram corresponds to a basic block in software compiler terminology.
Dataflow Diagrams, Hardware, and Behavior:
To be completed..

Area Estimation:
  1. Maximum number of blocks in a clock cycle is the total number of that component that are needed.
  2. Maximum number of signals that cross a cycle boundary is the total number of registers that are needed.
  3. Maximum number of unconnected signal tails in a clock cycle is the total number of inputs that are needed.
  4. Maximum number of unconnected signal heads in a clock cycle is the total number of outputs that are needed.
Dataflow Diagram Execution:
To be completed..

Performance Estimation:
To be completed..

Design Analysis:
To be completed..

Area / Performance Tradeoffs:
To be completed..

0/Post a Comment/Comments

Your comments will be moderated before it can appear here.

Previous Post Next Post