Title :
Optimal bipartite folding of PLA
Author :
Kai-Cheng Wei ; Young-Sheng Chiou
Author_Institution :
Dept. of Electr. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan
Abstract :
In this paper, a new algorithm for optimal bipartite folding of a programmable logic array (PLA) is proposed. The clustering technique is adopted to partition the PLA into two maximal independent sets, i.e., the upper and lower folding sets. Experimental results show the effectiveness of this algorithm.<>
Keywords :
logic arrays; network synthesis; optimisation; PLA; clustering technique; lower folding sets; maximal independent sets; optimal bipartite folding; programmable logic array; upper folding sets; Clustering algorithms; Cost function; Heuristic algorithms; Logic circuits; NP-complete problem; Partitioning algorithms; Programmable logic arrays; Silicon; Very large scale integration;
Conference_Titel :
TENCON '93. Proceedings. Computer, Communication, Control and Power Engineering.1993 IEEE Region 10 Conference on
Conference_Location :
Beijing, China
Print_ISBN :
0-7803-1233-3
DOI :
10.1109/TENCON.1993.320055
