论文信息 - An Optimal O(n2)-Algorithm to Fold Special PLA’s

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

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.

Afonso Galvao Ferreira | Afonso Ferreira

[1] Harold Fredricksen. Generation of the Ford Sequence of Length 2n, n Large , 1972, J. Comb. Theory, Ser. A.

[2] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[3] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[4] Samuel Chuquillanqui,et al. PAOLA: A Tool for Topological Optimization of Large PLAs , 1982, DAC 1982.

[5] Alberto L. Sangiovanni-Vincentelli,et al. An Algorithm for Optimal PLA Folding , 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6] Jean-François Paillotin. Optimization of the PLA Area , 1981, 18th Design Automation Conference.

[7] A. Tucker,et al. A structure theorem for the consecutive 1's property☆ , 1972 .

[8] J. R. Egan,et al. Optimal Bipartite Folding of PLA , 1982, DAC 1982.