National Changhua University of Education Institutional Repository : Item 987654321/10259
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 6491/11663
造訪人次 : 24648472      線上人數 : 45
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 進階搜尋


題名: STG-level decomposition and resynthesis of speed-independent circuits
作者: Chen, Ren-Der;Jou, Jer-Min
貢獻者: 資訊工程學系
關鍵詞: Hazard-free decomposition;Resynthesis;Signal transition graph (STG);Speed-independent (SI) circuit
日期: 2002-12
上傳時間: 2012-05-22T06:12:32Z
出版者: Institute of Electrical and Electronics Engineers
摘要: This paper presents a time-efficient method for the decomposition and resynthesis of speed-independent (SI) circuits. Given the specification of an SI circuit, our method first generates its standard C implementation. Then, the combinational decomposition is performed to decompose each high-fanin gate that does not exist in the gate library into some available low-fanin gates. The time efficiency of our method is achieved in two ways. First, the signal transition graph (STG), whose complexity is polynomial in the worst case, is adopted as our input specification. Second, to reduce the resynthesis cycles, which constitute a major part of the run time, our method first investigates the hazard-free decomposition of each high-fanin gate without adding any signals. Then, for those gates that cannot be decomposed hazard free, two signal-adding methods constructed at the STG level are developed for resynthesis. This decomposition and resynthesis process is iterated until all high-fanin gates are successfully decomposed or no solution can be found. Several experiments on asynchronous benchmarks show that our method largely reduces run time with only a little more area expense when compared with previous work.
關聯: IEEE Trans. Circuits & Systems, Part I, 49(12): 1751-1763
顯示於類別:[資訊工程學系] 期刊論文


檔案 大小格式瀏覽次數



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