EFFICIENT ALGORITHM FOR WEINBERGER ARRAY FOLDING

Abstract

Weinberger arrays (WAs) are an alternative to progammable logic arrays (PLAs) as a method of implementing combinatorial logic circuits. Column folding is a technique generally employed in PLAs to save the silicon area by implementing the circuit of two column in the area of one. THis paper describes an algorithm for folding weinberger arrays. The algorithm performs column and row ordering and tehn column folding. The complexity of the algorithm is 0(n-squared). The algorithm has been tested extensively on WAs that were generated circuits. Experimental results are discussed.