Released Software

• Wire Retiming Algorithms

  • WireRetBF (12/2005)
    • Min-period, binary search based
    • Apply Bellman-Ford's algorithm for feasibility checking
    • Reference: Retiming for Wire Pipelining in System-On-Chip (ICCAD'03) (TCAD'04)
  • WireRetHoward (12/2005)
    • Min-period, binary search based
    • Apply Howard's algorithm for feasibility checking
    • Reference: Retiming for Wire Pipelining in System-On-Chip (ICCAD'03) (TCAD'04)
  • WireRetFP (12/2005)
    • Min-period, binary search based
    • Feasibility checking by fixpoint computation
    • Reference: Wire Retiming for System-On-Chip by Fixpoint Computation (DATE'04) (TVLSI'05)
  • WireRetIncr (12/2005)
    • Min-period, incremental
    • Approach minimal period by gradual improvements
    • Refernece: Optimal Wire Retiming Without Binary Search (ICCAD'04)
  
  

• Latch-Flop Configuration Algorithm

  • LatchFlop (12/2005)
    • Propose circular time representation for clock schedule verification
    • Exploit trade-off between latches and flops to fix clocking violations
    • Develop a heuristic to find a latch-flop configuration under minimal clock period with crosstalk
    • Reference: Trade-off between Latch and Flop for Min-Period Sequential Circuit Designs with Crosstalk (ICCAD'05) (TechReport)
  
  

• Clustering Algorithm

  • ClusterPR (12/2005)
    • Construct a clustering with minimal max-cycle-ratio
    • Feasibility checking by fixpoint computation
    • Apply Howard's algorithm for max-cycle-ratio computation
    • Reference: Clustering for Processing Rate Optimization (ICCAD'05) (TechReport)
  
  

• Retiming Algorithm under Setup and Hold

  • RetSH (04/2006)
    • Min-period, incremental
    • Approach minimal period by gradual improvements
    • Refernece: An Efficient Retiming Algorithm Under Setup and Hold Constraint (DAC'06)