The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1981 vol.30)
pp: 635-643
T. Sasao , Department of Electrical Engineering, Osaka University
ABSTRACT
Generalized Boolean functions are shown to be useful for the design of programmable logic arrays (PLA's), and the complexity of three types of PLA's is obtained by the theory of multiple- valued decomposition. A two-level PLA consists of an AND array and an OR array, and they are cascaded to perform a two-level AND-OR circuit. A PLA with decoders consists of decoders, an AND array, and an OR array
INDEX TERMS
symmetric function, Complexity of logic circuits, functional decomposition, multiple-valued logic, programmable logic array
CITATION
T. Sasao, "Multiple-Valued Decomposition of Generalized Boolean Functions and the Complexity of Programmable Logic Arrays", IEEE Transactions on Computers, vol.30, no. 9, pp. 635-643, September 1981, doi:10.1109/TC.1981.1675861
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool