Accelerating Functional Timing Analysis with Simplfied Timed Characteristic Functions

碩士 === 國立臺灣大學 === 電子工程學研究所 === 100 === Functional, in contrast to structural, timing analysis for circuit delay computation is accurate, but computationally expensive in refuting false critical paths. Although satisfiability-based analysis using timed characteristic functions (TCFs) and modern satis...

Full description

Bibliographic Details
Main Authors: Yi-Ting Chung, 鍾逸亭
Other Authors: 江介宏
Format: Others
Language:en_US
Published: 2012
Online Access:http://ndltd.ncl.edu.tw/handle/89585142242497393001
id ndltd-TW-100NTU05428121
record_format oai_dc
spelling ndltd-TW-100NTU054281212015-10-13T21:50:18Z http://ndltd.ncl.edu.tw/handle/89585142242497393001 Accelerating Functional Timing Analysis with Simplfied Timed Characteristic Functions 以簡化之時間特徵函式加速功能性時序分析之方法 Yi-Ting Chung 鍾逸亭 碩士 國立臺灣大學 電子工程學研究所 100 Functional, in contrast to structural, timing analysis for circuit delay computation is accurate, but computationally expensive in refuting false critical paths. Although satisfiability-based analysis using timed characteristic functions (TCFs) and modern satisfiability-solving techniques has been proposed, its efficiency and generality remain room for improvement. This thesis provides a unified view on various TCFs for different timing requirements and a more efficient transformation from TCF formulas to conjunctive normal form (CNF) for satisfiability solving. Experimental results show functional timing analysis on industrial designs can be made up to several orders of magnitude faster and more generally applicable than prior methods. 江介宏 2012 學位論文 ; thesis 56 en_US
collection NDLTD
language en_US
format Others
sources NDLTD
description 碩士 === 國立臺灣大學 === 電子工程學研究所 === 100 === Functional, in contrast to structural, timing analysis for circuit delay computation is accurate, but computationally expensive in refuting false critical paths. Although satisfiability-based analysis using timed characteristic functions (TCFs) and modern satisfiability-solving techniques has been proposed, its efficiency and generality remain room for improvement. This thesis provides a unified view on various TCFs for different timing requirements and a more efficient transformation from TCF formulas to conjunctive normal form (CNF) for satisfiability solving. Experimental results show functional timing analysis on industrial designs can be made up to several orders of magnitude faster and more generally applicable than prior methods.
author2 江介宏
author_facet 江介宏
Yi-Ting Chung
鍾逸亭
author Yi-Ting Chung
鍾逸亭
spellingShingle Yi-Ting Chung
鍾逸亭
Accelerating Functional Timing Analysis with Simplfied Timed Characteristic Functions
author_sort Yi-Ting Chung
title Accelerating Functional Timing Analysis with Simplfied Timed Characteristic Functions
title_short Accelerating Functional Timing Analysis with Simplfied Timed Characteristic Functions
title_full Accelerating Functional Timing Analysis with Simplfied Timed Characteristic Functions
title_fullStr Accelerating Functional Timing Analysis with Simplfied Timed Characteristic Functions
title_full_unstemmed Accelerating Functional Timing Analysis with Simplfied Timed Characteristic Functions
title_sort accelerating functional timing analysis with simplfied timed characteristic functions
publishDate 2012
url http://ndltd.ncl.edu.tw/handle/89585142242497393001
work_keys_str_mv AT yitingchung acceleratingfunctionaltiminganalysiswithsimplfiedtimedcharacteristicfunctions
AT zhōngyìtíng acceleratingfunctionaltiminganalysiswithsimplfiedtimedcharacteristicfunctions
AT yitingchung yǐjiǎnhuàzhīshíjiāntèzhēnghánshìjiāsùgōngnéngxìngshíxùfēnxīzhīfāngfǎ
AT zhōngyìtíng yǐjiǎnhuàzhīshíjiāntèzhēnghánshìjiāsùgōngnéngxìngshíxùfēnxīzhīfāngfǎ
_version_ 1718068940479922176