EFFICIENT ALGORITHM FOR WEINBERGER ARRAY FOLDING

Weinberger arrays (WAs) are an alternative to programmable logic arrays (PLAs) as a method of implementing combinational logic circuits. Column folding is a technique generally employed in PLAs to save the silicon area by implementing the circuit of two columns in the area of one. This paper describes an algorithm for folding Weinberger arrays. The algorithm performs column and row ordering and then column folding. The complexity of the algorithm is O (n2). The algorithm has been tested extensively on WAs that were generated both for practical circuits and for numerous randomly generated ciruits. Experimental results are discussed. © 1990 Taylor & Francis Ltd.