Combining Logic Minimization and Folding for PLA’s

Abstract

This paper presents an approach that combines logic minimization and folding for PLA’s. An efficient algorithm is proposed for optimal bipartite column folding. In the algorithm, we model the PL A personality matrix as a network and the bipartite PLA folding as a partitioning problem of that network. Our folding algorithm is able to find optimal solutions for the benchmarks from the literature. The algorithm also substitutes product terms by their alternatives in order to find the one best suited for folding. We combine this algorithm and a logic minimization algorithm into a folding system. When comparing the results to those by a conventional approach, about one half of the benchmarks show area gain if product-term-alternatives exist. © 1991, IEEE.