English  |  正體中文  |  简体中文  |  Items with full text/Total items : 6491/11663
Visitors : 25159720      Online Users : 361
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/10259

Title: STG-level decomposition and resynthesis of speed-independent circuits
Authors: Chen, Ren-Der;Jou, Jer-Min
Contributors: 資訊工程學系
Keywords: Hazard-free decomposition;Resynthesis;Signal transition graph (STG);Speed-independent (SI) circuit
Date: 2002-12
Issue Date: 2012-05-22T06:12:32Z
Publisher: Institute of Electrical and Electronics Engineers
Abstract: 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.
Relation: IEEE Trans. Circuits & Systems, Part I, 49(12): 1751-1763
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