Abstract

A method for PLA (programmable logic array) decomposition is presented whereby a single two-level Boolean function (PLA) is decomposed into two levels of cascaded PLAs. Primary inputs are partitioned into disjoint sets and represented as multiple-valued variables so as to minimize the total PLA area. Two new algorithms are presented for input variable assignment, based on (a) graph partitioning and (b) a mathematical optimization method. The constrained output encoding of first-level PLAs is performed by a fast and efficient procedure based on a graph-coloring technique. >

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.