A branch and bound algorithm for optimal pla folding

Authors:
J. L. Lewandowski;C. L. Liu
Affiliations:
Department of Computer Science, University of Illinois at Urbana-Champaign, 1304 West Springfield, Urbana, Illinois;Department of Computer Science, University of Illinois at Urbana-Champaign, 1304 West Springfield, Urbana, Illinois
Venue:
DAC '84 Proceedings of the 21st Design Automation Conference
Year:
1984

Citing 6
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Automatic PLA synthesis from a DDL-P description

DAC '81 Proceedings of the 18th Design Automation Conference
A computer-aided-design system for segmented-folded PLA macro-cells

DAC '81 Proceedings of the 18th Design Automation Conference
A depth-first branch-and-bound algorithm for optimal PLA folding

DAC '82 Proceedings of the 19th Design Automation Conference
Optimal bipartite folding of PLA

DAC '82 Proceedings of the 19th Design Automation Conference
Techniques for programmable logic array folding

DAC '82 Proceedings of the 19th Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a branch and bound algorithm which exhaustively searches for an optimal column and/or row folding of PLAs. For PLAs with up to 50-60 input/output lines we can obtain an optimal solution in no more than a few minutes.