Maximum Folding, a Generalization of Maximum Matching

We shall introduce a unified graph model which represents various problems in VLSI, e.g., PLA folding, Gate-Matrix layout, and channel routing. Then we introduce an algorithm for folding a Weinberger’s array [an array containing three kinds of entries, 0 (no connection), c (connection), t (transistors)]. It is shown that the folding of Weinberger’s array is a generalization of the PLA folding, and equivalent to channel routing.

[1]  T. C. Hu,et al.  Optimum Reduction of Programmable Logic Array , 1983, 20th Design Automation Conference Proceedings.

[2]  Takeshi Yoshimura,et al.  Efficient Algorithms for Channel Routing , 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[3]  T. C. Hu,et al.  Graph folding and programmable logic array , 1987, Networks.

[4]  Alberto L. Sangiovanni-Vincentelli,et al.  An Algorithm for Optimal PLA Folding , 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.