Skip to main content
Log in

From high-level descriptions to vlsi circuits

  • Part II Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

This paper presents a high-level language for describing VLSI circuits designed as a collection of asynchronous concurrent processes. The notation is called “Synchronized Transitions,” and it can be used to describe designs from very high levels of abstraction down to the gate level. Both synchronous and asynchronous/self-timed circuits can be described, and it is not necessary to choose a particular type of circuitry in the early phases of a design. “Synchronized Transitions” programs may be used for experimenting with (simulating) a design at several levels, e.g., to explore different high-level decisions or to verify the gate level design. By observing certain constraints in a “Synchronized Transitions” program, it is possible to systematically transform it into an efficient layout.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. F. Barrett,Problemhobe og VLSI, Masters Thesis (in Danish), Computer Science Department, Aarhus University, Denmark, October 1986.

    Google Scholar 

  2. K. M. Chandy and J. Misra,Parallel Program Design, a Foundation. Addison-Wesley, 1988.

  3. N. Carriero and D. Gelernter,The S/Net's Linda Kernel, ACM Transactions on Computer Systems, 4, 2, May 1986.

  4. S. Garland, J. Guttag, and J. Staunstrup,Verification of VLSI circuits using LP.; Proc. IFIP Conference on Design for Behavioral Verification, 1988.

  5. A. Gottlieb, B. Lubacevsky, and R. Rudolph,Basic techniques for the efficient coordination of very large number of cooperating sequential processors, ACM Transactions on Programming Languages 5, 1, January 1983.

  6. M. R. Greenstreet, T. E. Williams, and J. Staunstrup,Self-timed iteration, in Proceedings from VLSI-87, Vancouver, North Holland, 1987.

    Google Scholar 

  7. D. D. Hill and D. R. Coelho,Multi-level Simulation for VLSI Design, Kluwer Academic Publishers, 1986.

  8. C. A. R. Hoare,Communicating sequential processes, Communications of the ACM, vol. 21, no. 8 (August 1978), pp. 666–677.

    Google Scholar 

  9. H. T. Kung and C. E. Leiserson,Systolic arrays (for VLSI), in Sparse Matrix Proc., 1978, I. S. Duff and G. W. Stewart (eds.), pp. 256–282, SIAM 1979.

  10. J. D. Morison,et al., EL LA:Hardware description or specification, in Proceedings of 1984 IEEE ICCAD.

  11. P. Møller-Nielsen and J. Staunstrup,Problem-heap. A paradigm for multiprocessor algorithms, Parallel Computing 4, February 1987, North Holland.

  12. J. Staunstrup, F. Barrett, M. Greenstreet, and P. Møller-Nielsen,The design of a problem-mesh, Proceedings from Comp-Euro 87, VLSI and Computers, IEEE 1987.

  13. 1986survey of logic simulations, VLSI Systems Design, Vol. 4, no. 2, Feb. 1986, pp. 32–40.

  14. T. E. Williams, M. Horowitz,et al., A self-timed chip for division, Proceedings of the Conference on Advanced Research in VLSI, Stanford University, March 1987.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Dedicated to Peter Naur on the occasion of his 60th birthday

Rights and permissions

Reprints and permissions

About this article

Cite this article

Staunstrup, J., Greenstreet, M.R. From high-level descriptions to vlsi circuits. BIT 28, 620–638 (1988). https://doi.org/10.1007/BF01941138

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01941138

CR categories