Skip to main content
SpringerLink
Log in

An Optimal O(n2)-Algorithm to Fold Special PLA’s

  • Conference paper
Advances in Optimization and Control

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 302))

Abstract

The development of Microelectronics made it possible to connect and integrate hundreds of thousands of electronic components in very small chips (1 cm × 1 cm, or less). This technology, called VLSI (Very Large Scale of Integration), allows the design of very complex circuits and systems. Such designs have become so complex that structured design techniques are desirable in order to improve logical-electrical correction with a reasonable cost.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight 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.

References

  1. G. D. Hachtel et al, “An Algorithm for Optimal PLA Folding”, Research Report RC8668, IBM Thomas J. Watson Research Center, January 1981.

    Google Scholar 

  2. J. F. Paillotin, “Optimization of the PLA area”, Proc. 18th Des. Autom. Conf., pp. 406–410, June 1981.

    Google Scholar 

  3. K. S. Booth & G. S. Lueker, “Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms”, Journal of Comput. Syst. Sci., 13, pp. 335–379, 1976.

    Article  Google Scholar 

  4. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1980.

    Google Scholar 

  5. A. C. Tucker, “A Structure Theorem for the Consecutive 1’s Property, J. Combinatorial Theory 12(B), pp. 153–162, 1972.

    Google Scholar 

  6. J. R. Egan & C. L. Liu, “Optimal Bipartite Folding of PLA’s”, Proc. 19th Des. Autom. Conf., pp. 141–146, June 1982.

    Google Scholar 

  7. S. Chuquillanqui & T. P. Segovia, “PAOLA: A Tool for Topological Optimization of Large PLA’s” Idem, Idem, pp. 300–306.

    Google Scholar 

  8. G. D. Micheli & A. Sangiovanni-Vincentelli, “PLEASURE: A Computer Program for Simple/Multiple Constrained/Unconstrained Folding of Programmable Logic Arrays”, Proc. 20th Des. Autom. Conf,, pp. 530–537, June 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto de Matematica e Estatistica — USP, San Paulo, Brazil

    Afonso Galvao Ferreira

Authors
  1. Afonso Galvao Ferreira
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of New Brunswick, P.O. Box 4400, Fredericton, New Brunswick, Canada, E3B 5A3

    H. A. Eiselt

  2. Concordia University, 7141 Sherbrooke Street, West Montreal, Quebec, Canada, H4B 1R6

    G. Pederzoli

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ferreira, A.G. (1988). An Optimal O(n2)-Algorithm to Fold Special PLA’s . In: Eiselt, H.A., Pederzoli, G. (eds) Advances in Optimization and Control. Lecture Notes in Economics and Mathematical Systems, vol 302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46629-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46629-8_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18962-6

  • Online ISBN: 978-3-642-46629-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation