National Changhua University of Education Institutional Repository : Item 987654321/11659

English | 正體中文 | 简体中文 | Items with full text/Total items : 6507/11669
Visitors : 30080868 Online Users : 901

RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope Adv. Search

Login ‧ Upload ‧ Help ‧ About ‧ Administer

NCUEIR > College of Engineering > Department and Graduate Institute of Computer Science and Information Engineering > Periodical Articles > Item 987654321/11659

Please use this identifier to cite or link to this item: http://ir.ncue.edu.tw/ir/handle/987654321/11659

Title:	An efficient Algorithm for Selecting Bipartite Row and Column Folding of Programmable Logic Arrays
Authors:	Liu, B. D.;Wei, Kai-Cheng
Contributors:	資訊工程系
Date:	1994-07
Issue Date:	2012-06-18T02:34:27Z
Publisher:	Institute of Electrical Engineers
Abstract:	Werent from the previous PLA folding algorithms which perform row and column foldhgs independently, we propose an algorithm to obtain bipartite row or column folding “ I t 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 efliciently.
Relation:	IEEE Trans. Circuits Syst., 41(7): 494-498
Appears in Collections:	[Department and Graduate Institute of Computer Science and Information Engineering] Periodical Articles

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	548	View/Open