Wired: Wire-Aware Circuit Design

  • Emil Axelsson
  • Koen Claessen
  • Mary Sheeran
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3725)


Routing wires are dominant performance stoppers in deep sub-micron technologies, and there is an urgent need to take them into account already at higher levels of abstraction. However, the normal design flow gives the designer only limited control over the details of the lower levels, risking the quality of the final result. We propose a language, called Wired, which lets the designer express circuit function together with layout, in order to get more precise control over the result. The complexity of larger designs is managed by using parameterised connection patterns. The resulting circuit descriptions are compact, and yet capture detailed layout, including the size and positions of wires. We are able to analyse non-functional properties of these descriptions, by “running” them using non-standard versions of the wire and gate primitives. The language is relational, which means that we can build forwards, backwards and bi-directional analyses. Here, we show the description and analysis of various parallel prefix circuits, including a novel structure with small depth and low fanout.


Connection Pattern Circuit Behaviour Functional Programming Language Parameter Block Contact Segment 
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.


  1. 1.
    Becker, B., Hotz, G., Kolla, R., Molitor, P., Osthof, H.-G.: Hierarchical design based on a calculus of nets. In: DAC 1987: Proceedings of the 24th ACM/IEEE conference on Design automation, pp. 649–653. ACM Press, New York (1987)CrossRefGoogle Scholar
  2. 2.
    Brent, R.P., Kung, H.T.: A regular layout for parallel adders. IEEE Transactions on Computers C-31 (1982)Google Scholar
  3. 3.
    Brock, B., Hunt Jr., W.A.: The DUAL-EVAL Hardware Description Language and Its Use in the Formal Specification and Verification of the FM9001 Microprocessor. Formal Methods in System Design 11(1) (1997)Google Scholar
  4. 4.
    Claessen, K., Sheeran, M., Singh, S.: The Design and Verification of a Sorter Core. In: Margaria, T., Melham, T.F. (eds.) CHARME 2001. LNCS, vol. 2144, p. 355. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Huang, Z., Ercegovac, M.: Effect of Wire Delay on the Design of Prefix Adders in Deep-Submicron Technology. In: Proc. 34th Asilomar Conf. IEEE, Los Alamitos (2000)Google Scholar
  6. 6.
    Jones, G., Sheeran, M.: Circuit design in Ruby. In: Staunstrup, J. (ed.) Formal Methods for VLSI Design. North-Holland, Amsterdam (1990)Google Scholar
  7. 7.
    Rabaey, J.M., et al.: Digital Integrated Circuits. Prentice Hall, Englewood Cliffs (2003)Google Scholar
  8. 8.
    Sheeran, M.: μFP, an algebraic VLSI design language, D.Phil. Thesis. Oxford University (1983)Google Scholar
  9. 9.
    Sheeran, M.: Generating fast multipliers using clever circuits. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, pp. 6–20. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    SIA: National Technology Roadmap for Semiconductors (1997)Google Scholar
  11. 11.
    Sklansky, J.: Conditional-sum addition logic. IRE Trans. Electron. Comput. EC-9 (1960)Google Scholar
  12. 12.
    Spirakis, G.: Opportunities and challenges in building silicon products at 65nm and beyond. In: Design and Test in Europe (DATE). IEEE, Los Alamitos (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Emil Axelsson
    • 1
  • Koen Claessen
    • 1
  • Mary Sheeran
    • 1
  1. 1.Chalmers University of Technology 

Personalised recommendations