PRONTO: Quick PLA product reduction

Authors:
Jorge F. Martinez-Carballido;V. Michael Powers
Affiliations:
Department of Electrical and Computer Engineering, Oregon State University, Corvallis, Oregon;Department of Electrical and Computer Engineering, Oregon State University, Corvallis, Oregon
Venue:
DAC '83 Proceedings of the 20th Design Automation Conference
Year:
1983

Citing 5
Cited 2

Introduction to VLSI Systems

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

Computers and Intractability: A Guide to the Theory of NP-Completeness
A State-Machine Synthesizer—SMS

DAC '81 Proceedings of the 18th Design Automation Conference
Optimization of the PLA area

DAC '81 Proceedings of the 18th Design Automation Conference
General microprogram width reduction using generator sets

MICRO 14 Proceedings of the 14th annual workshop on Microprogramming

PHIPLA—a new algorithm for logic minimization

DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Computer aided minimization procedure for boolean functions

DAC '84 Proceedings of the 21st Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

A PLA is a regular, modular combinational function implementation popular in VLSI design. Among methods which reduce the cost of implementing a given PLA specification, reducing the number of product terms is particularly fruitful. Optimum product term reduction for practical-sized problems is prohibitively complex. Previous suboptimal, heuristic product term reducers have been iterative or indirect. PRONTO is a direct, one-pass method for heuristically reducing the number of product terms required to specify a PLA. Results of using PRONTO on a small set of examples show solutions up to 21% better than previously reported, using a procedure of modest complexity.