Skip to main content

Abstract

In this chapter we discuss our computational experience with an APL implementation of ESPRESSO-II. We report data on 56 PLA’s given to us by various sources. Some have already been minimized by various PLA minimization programs while others consist entirely of minterms. The 56 PLA’s are a mixture of control and data flow logic. Some have don’t-care sets and there is a range in size from 4 inputs to 94 inputs, from 1 output to 109 outputs, and from an initial cover size of 10 terms to 654 terms. The computing time required by ESPRESSO-IIAPL to minimize these PLA’s ranged from less than a second to 721 seconds on an IBM/3081K machine. Most of the PLA’s represent real applications although a few are arithmetic functions which we devised for their interesting structures, or because they were known to be difficult problems.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Kluwer Academic Publishers

About this chapter

Cite this chapter

Brayton, R.K., Hachtel, G.D., McMullen, C.T., Sangiovanni-Vincentelli, A.L. (1984). Experimental Results. In: Logic Minimization Algorithms for VLSI Synthesis. The Kluwer International Series in Engineering and Computer Science, vol 2. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-2821-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-2821-6_6

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-9784-0

  • Online ISBN: 978-1-4613-2821-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics