English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6498/11670
Visitors : 27688241      Online Users : 77
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

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:[資訊工程學系] 期刊論文

Files in This Item:

File SizeFormat

All items in NCUEIR are protected by copyright, with all rights reserved.


DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback