Advertisement

Technology Mapping for Area Optimized Quasi Delay Insensitive Circuits

  • Bertrand Folco
  • Vivian Brégier
  • Laurent Fesquet
  • Marc Renaudin
Part of the IFIP International Federation for Information Proc book series (IFIPAICT, volume 240)

Quasi delay insensitive circuits are functionally independent of delays in gates and wires (except for some particular wires). Such asynchronous circuits offer high robustness but do not perform well to automatically synthesize and optimize. This paper presents a new methodology to model and synthesize data path QDI circuits. The model used to represent circuits is based on Multi-valued Decision Diagrams and allows obtaining QDI circuits with two-input gates. Optimization is achieved by applying a technology mapping algorithm with a library of asynchronous standard cells called TAL. This work is a part of the back-end of our synthesis flow from high level language. Throughout the paper, a digit-slice radix 4 ALU is used as an example to illustrate the methodology and show the results.

Keywords

Standard Cell Binary Decision Diagram Terminal Vertex Technology Mapping Asynchronous Circuit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

8 References

  1. 1.
    Renaudin, M., Asynchronous circuits and systems: a promising design alternative. Microelectronic Engineering, 2000. 54(1-2): p. 133-149.CrossRefGoogle Scholar
  2. 2.
    Dinh Duc, A.V., L. Fesquet, and M. Renaudin. Synthesis of QDI Asynchronous Circuits from DTL-style Petri Net. in 11th IEEE/ACM International Workshop on Logic & Synthesis. 2002. New Orleans, Louisiana.Google Scholar
  3. 3.
    Dinh Duc, A.V., et al. TAST CAD Tools. in ACiD-WG workshop. 2002. Munich, Germany.Google Scholar
  4. 4.
    Martin, A.J., The Limitations to Delay-Insensitivity in Asynchronous Circuits, in Advanced Research in VLSI, W.J. Dally, Editor. 1990, MIT Press. p. 263-278.Google Scholar
  5. 5.
    Manohar, R., T.K. Lee, and A.J. Martin. Projection: A Synthesis Technique for Concurrent Systems. in The 5th IEEE International Symposium on Asynchronous Circuits and Systems. 1999.Google Scholar
  6. 6.
    Toms, W.B. QDI Implementation of Boolean Graphs. in 14th UK Asynchronous Forum. 2003.Google Scholar
  7. 7.
    Burns, S.M., General Condition for the Decomposition of State Holding Elements, in Proc. International Symposium on Advanced Research in Asynchronous Circuits and Systems. 1996, IEEE Computer Society Press.Google Scholar
  8. 8.
    Lemberski, I. and M.B. Josephs. Optimal Two-Level Delay-Insensitive Implementation of Logic Functions. in PATMOS. 2002. Spain.Google Scholar
  9. 9.
    Nielsen, C.D. Evaluation of Function Blocks for Asynchronous Design. in eurodac. 1994: icsp.Google Scholar
  10. 10.
    Martin, A.J., The Limitations to Delay-Insensitivity in Asynchronous Circuits, in Advanced Research in VLSI, W.J. Dally, Editor. 1990, MIT Press. p. 263-278.Google Scholar
  11. 11.
    Bregier, V., et al. Modeling and Synthesis of multi-rail multi-protocol QDI circuits. in International Workshop on Logic Synthesis. 2004.Google Scholar
  12. 12.
    Kam, T., et al. Multi-valued decision diagrams: Theory and applications. International Journal on Multiple-Valued Logic, 1998. 4(1-2): p. 9-24.MATHMathSciNetGoogle Scholar
  13. 13.
    Dreschler, R. and B. Becker, Binary Decision Diagrams, Theory and Implementation. Kluwer Academic Publishers ed. 1998: Kluwer Academic Publishers.Google Scholar
  14. 14.
    Maurine, P., et al. Static Implementation of QDI Asynchronous Primitives. in PATMOS: 13th International Workshop on Power and Timing Modeling, Optimization and Simulation. 2003.Google Scholar
  15. 15.
    Keutzer, K. DAGON: technology binding and local optimization by DAG matching. in Proceedings of the 24th ACM/IEEE conference on Design automation. 1987. Miami Beach, Florida, United States.Google Scholar
  16. 16.
    Zhao, M. and S.S. Sapatnekar. A new structural pattern matching algorithm for technology mapping. in The 38th Conference on Design Automation. 2001. Las Vegas, Nevada, United States.Google Scholar
  17. 17.
    Matsunaga, Y. On Accelerating Pattern Matching for Technology Mapping. in International Conference on Computer Aided Design. 1998. San Jose, California, United States.Google Scholar
  18. 18.
    Cortadella, J., et al. Decomposition and technology mapping of speed-independent circuits using Boolean relations. in Proc. International Conf. Computer-Aided Design (ICCAD). 1997.Google Scholar
  19. 19.
    Myers, C.J., P.A. Beerel, and T.H.-Y. Meng, Technology Mapping of Timed Circuits, in Asynchronous Design Methodologies. 1995, Elsevier Science Publishers. p. 138-147.Google Scholar
  20. 20.
    Siegel, P.S.K., Automatic Technology Mapping for Asynchronous Designs. 1995, Stanford University.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Bertrand Folco
    • 1
  • Vivian Brégier
    • 1
  • Laurent Fesquet
    • 1
  • Marc Renaudin
    • 1
  1. 1.Techniques of Informatics and Microelectronics for Computer Architecture Laboratory (TIMA)France

Personalised recommendations