National Changhua University of Education Institutional Repository : Item 987654321/11659
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 6487/11649
造访人次 : 28508093      在线人数 : 399
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 进阶搜寻


题名: An efficient Algorithm for Selecting Bipartite Row and Column Folding of Programmable Logic Arrays
作者: Liu, B. D.;Wei, Kai-Cheng
贡献者: 資訊工程系
日期: 1994-07
上传时间: 2012-06-18T02:34:27Z
出版者: Institute of Electrical Engineers
摘要: 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.
關聯: IEEE Trans. Circuits Syst., 41(7): 494-498
显示于类别:[資訊工程學系] 期刊論文


档案 大小格式浏览次数



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