English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 6507/11669
造訪人次 : 29947157      線上人數 : 576
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 進階搜尋

請使用永久網址來引用或連結此文件: http://ir.ncue.edu.tw/ir/handle/987654321/11659

題名: 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
顯示於類別:[資訊工程學系] 期刊論文

文件中的檔案:

檔案 大小格式瀏覽次數
index.html0KbHTML547檢視/開啟


在NCUEIR中所有的資料項目都受到原著作權保護.

 

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