Issue No. 06 - June (1991 vol. 40)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.90249
<p>The authors present an approach that combines logic minimization and folding for a programmable logic array (PLA). An efficient algorithm is proposed for optimal bipartite column folding. In the algorithm, the authors model the PLA personality matrix as a network and the bipartite PLA folding as a partitioning problem of that network. This 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. The authors 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.</p>
logic minimization; folding; PLAs; programmable logic array; algorithm; optimal bipartite column folding; personality matrix; partitioning; benchmarks; logic arrays; logic design; minimisation of switching nets.
Hang Ching Hsieh, Ting Hai Chao, Youn Long Lin, Yu Chin Hsu, "Combining Logic Minimization and Folding for PLAs", IEEE Transactions on Computers, vol. 40, no. , pp. 706-713, June 1991, doi:10.1109/12.90249