Abstract
Abstract A simple and efficient procedure for the column folding of programmable logic arrays (PLAs) is presented. The PLA folding problem is formulated from concepts of switching theory and logic design. The proposed procedure constructs the optimal folding solutions from the set of compatible pairs of PLA columns. The pair chart, a new concept denned in the paper, allows the procedure to be organized in an efficient form. A second method that uses the procedure to find the set of the maximal compatibles for fully specified flow tables is suggested. The methods proposed are systematic, programmable and do not involve any heuristics or intuitive procedures.
Sign-in/Register to access full text options 
Free) 
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
