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

Bin Da Liu; Kai Cheng Wei

doi:10.1109/81.298365

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

Bin Da Liu, Kai Cheng Wei

Department of Computer Science and Information Engineering

Research output: Contribution to journal › Article

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 language	English
Pages (from-to)	494-498
Number of pages	5
Journal	IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
Volume	41
Issue number	7
DOIs	https://doi.org/10.1109/81.298365
Publication status	Published - 1994 Jul

All Science Journal Classification (ASJC) codes

Electrical and Electronic Engineering

Access to Document

10.1109/81.298365

Cite this

Liu, B. D., & Wei, K. C. (1994). An Efficient Algorithm for Selecting Bipartite Row or Column Folding of Programmable Logic Arrays. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, 41(7), 494-498. https://doi.org/10.1109/81.298365

@article{6937702304ad46318fc8a8bbf9e1df38,

title = "An Efficient Algorithm for Selecting Bipartite Row or Column Folding of Programmable Logic Arrays",

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.",

author = "Liu, {Bin Da} and Wei, {Kai Cheng}",

year = "1994",

month = jul,

doi = "10.1109/81.298365",

language = "English",

volume = "41",

pages = "494--498",

journal = "IEEE Transactions on Circuits and Systems I: Regular Papers",

issn = "1057-7122",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "7",

}

TY - JOUR

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

AU - Liu, Bin Da

AU - Wei, Kai Cheng

PY - 1994/7

Y1 - 1994/7

N2 - -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.

AB - -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.

UR - http://www.scopus.com/inward/record.url?scp=0028464686&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028464686&partnerID=8YFLogxK

U2 - 10.1109/81.298365

DO - 10.1109/81.298365

M3 - Article

AN - SCOPUS:0028464686

VL - 41

SP - 494

EP - 498

JO - IEEE Transactions on Circuits and Systems I: Regular Papers

JF - IEEE Transactions on Circuits and Systems I: Regular Papers

SN - 1057-7122

IS - 7

ER -