An Efficient Algorithm for Selecting Bipartite Row or Column Folding of Programmable Logic Arrays

Bin Da Liu, Kai Cheng Wei

Research output: Contribution to journalArticle

Abstract

-Different from the previous PLA folding algorithms which perform row and column foldings independently, we propose an algorithm to obtain bipartite row or column folding result on the same graph. The PLA personality matrix is modeled as a graph and the folding problem is modeled as a partitioning problem. Experimental results show that this algorithm can lead a good guide to select row or column folding for reducing the chip area of the PLA efficiently.

Original languageEnglish
Pages (from-to)494-498
Number of pages5
JournalIEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
Volume41
Issue number7
DOIs
Publication statusPublished - 1994 Jul

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this