Optimal bipartite folding of PLA

kai-cheng wei, Young Sheng Chiou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, a new algorithm for optimal bipartite folding of 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.

Original languageEnglish
Title of host publicationProceedings of the 10th IEEE Region Conference on Computer, Communication, Control and Power Engineering
PublisherPubl by IEEE
Pages578-580
Number of pages3
ISBN (Print)0780312333
Publication statusPublished - 1993 Dec 1
EventProceedings of the 1993 IEEE Region 10 Conference on Computer, Communication, Control and Power Engineering (TENCON '93). Part 1 (of 5) - Beijing, China
Duration: 1993 Oct 191993 Oct 21

Publication series

NameProceedings of the 10th IEEE Region Conference on Computer, Communication, Control and Power Engineering

Other

OtherProceedings of the 1993 IEEE Region 10 Conference on Computer, Communication, Control and Power Engineering (TENCON '93). Part 1 (of 5)
CityBeijing, China
Period93-10-1993-10-21

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

wei, K., & Chiou, Y. S. (1993). Optimal bipartite folding of PLA. In Proceedings of the 10th IEEE Region Conference on Computer, Communication, Control and Power Engineering (pp. 578-580). (Proceedings of the 10th IEEE Region Conference on Computer, Communication, Control and Power Engineering). Publ by IEEE.