On the size of PLAs required to realize binary and multiple-valued functions

Upper and lower bounds are shown for the average number of product terms required in the minimal realization, as a function of the number of nonzero output values. The variance, in addition to the bounds, allows conclusions to be drawn about how PLA size determines the set of realizable functions. A...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 1989-01, Vol.38 (1), p.82-98
Main Authors: Bender, E.A., Butler, J.T.
Format: Article
Language:English
Subjects:
Applied sciences
Charge coupled devices
Circuit analysis
Decoding
Electronics
Exact sciences and technology
Integrated circuits
Logic circuits
Logic design
Mathematics
Performance analysis
Programmable logic arrays
Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices
Upper bound
Very large scale integration
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Upper and lower bounds are shown for the average number of product terms required in the minimal realization, as a function of the number of nonzero output values. The variance, in addition to the bounds, allows conclusions to be drawn about how PLA size determines the set of realizable functions. Although the bounds are most accurate when there are few nonzero values, they are adequate for analyzing commercially available PLAs. The analysis shows that, for all but one commercially available PLA, the number of nonzero values is a statistically meaningful criterion for determining whether or not a given function is likely to be realized.< >
ISSN:0018-9340
1557-9956
DOI:10.1109/12.8731