research-article

Path sensitization in critical path problem [logic circuit design]

Authors:

H. -C. Chen,

D. H.-C. DuAuthors Info & Claims

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Volume 12, Issue 2

Pages 196 - 207

https://doi.org/10.1109/43.205001

Published: 01 November 2006 Publication History

Abstract

An important aspect of the critical path problem is deciding whether a path is sensitizable. Three new path sensitization criteria are proposed in a general framework. Other path sensitization criteria can be presented in the same framework, enabling them to be compared with each other. An approximate criterion is also proposed and used to develop an efficient critical path algorithm for combinational circuits

Cited By

View all

Esirci FBayrakci A(2017)Hardware trojan detection based on correlated path delays in defiance of variations with spatial correlationsProceedings of the Conference on Design, Automation & Test in Europe10.5555/3130379.3130416(163-168)Online publication date: 27-Mar-2017
https://dl.acm.org/doi/10.5555/3130379.3130416
Lai CJiang J(2017)Path-Specific Functional Timing Verification under Floating and Transition Modes of OperationProceedings of the 54th Annual Design Automation Conference 201710.1145/3061639.3062299(1-6)Online publication date: 18-Jun-2017
https://dl.acm.org/doi/10.1145/3061639.3062299
Tsai CWang CHuang CChen YHenkel J(2013)Sensitization criterion for threshold logic circuits and its applicationProceedings of the International Conference on Computer-Aided Design10.5555/2561828.2561874(226-233)Online publication date: 18-Nov-2013
https://dl.acm.org/doi/10.5555/2561828.2561874
Show More Cited By

Path sensitization in critical path problem [logic circuit design]
1. Hardware

Recommendations

Shortest path problem with uncertain arc lengths

Uncertainty theory provides a new tool to deal with the shortest path problem with nondeterministic arc lengths. With help from the operational law of uncertainty theory, this paper gives the uncertainty distribution of the shortest path length. Also, ...
On the inverse shortest path length problem
A label-setting algorithm for finding a quickest path

The quickest path problem is to find a path to send a given amount of data from the source to the destination with minimum transmission time. To find the quickest path, existing algorithms enumerate nondominated paths with distinct capacity, and then ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems Volume 12, Issue 2

November 2006

177 pages

ISSN:0278-0070

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 November 2006

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

40
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Esirci FBayrakci A(2017)Hardware trojan detection based on correlated path delays in defiance of variations with spatial correlationsProceedings of the Conference on Design, Automation & Test in Europe10.5555/3130379.3130416(163-168)Online publication date: 27-Mar-2017
https://dl.acm.org/doi/10.5555/3130379.3130416
Lai CJiang J(2017)Path-Specific Functional Timing Verification under Floating and Transition Modes of OperationProceedings of the 54th Annual Design Automation Conference 201710.1145/3061639.3062299(1-6)Online publication date: 18-Jun-2017
https://dl.acm.org/doi/10.1145/3061639.3062299
Tsai CWang CHuang CChen YHenkel J(2013)Sensitization criterion for threshold logic circuits and its applicationProceedings of the International Conference on Computer-Aided Design10.5555/2561828.2561874(226-233)Online publication date: 18-Nov-2013
https://dl.acm.org/doi/10.5555/2561828.2561874
Ho SLin SYuan KKuo CLiao KJiang JLi CHenkel J(2013)Automatic test pattern generation for delay defects using timed characteristic functionsProceedings of the International Conference on Computer-Aided Design10.5555/2561828.2561848(91-98)Online publication date: 18-Nov-2013
https://dl.acm.org/doi/10.5555/2561828.2561848
Mondal AChakrabarti PDasgupta P(2012)Symbolic-Event-Propagation-Based Minimal Test Set Generation for Robust Path Delay FaultsACM Transactions on Design Automation of Electronic Systems10.1145/2348839.234885117:4(1-20)Online publication date: 1-Oct-2012
https://dl.acm.org/doi/10.1145/2348839.2348851
Chung YJiang JGroeneveld PSciuto DHassoun S(2012)Functional timing analysis made fast and generalProceedings of the 49th Annual Design Automation Conference10.1145/2228360.2228552(1055-1060)Online publication date: 3-Jun-2012
https://dl.acm.org/doi/10.1145/2228360.2228552
Guerra e Silva LBrunvard EStevens KCavallaro JZhang T(2012)Unifying functional and parametric timing verificationProceedings of the great lakes symposium on VLSI10.1145/2206781.2206816(135-140)Online publication date: 3-May-2012
https://dl.acm.org/doi/10.1145/2206781.2206816
Coudert OSapatnekar S(2010)An efficient algorithm to verify generalized false pathsProceedings of the 47th Design Automation Conference10.1145/1837274.1837321(188-193)Online publication date: 13-Jun-2010
https://dl.acm.org/doi/10.1145/1837274.1837321
Kuo YChang YChang S(2009)Efficient Boolean characteristic function for timed automatic test pattern generationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2009.201326928:3(417-425)Online publication date: 1-Mar-2009
https://dl.acm.org/doi/10.1109/TCAD.2009.2013269
Roy SChakrabarti PDasgupta P(2008)Event propagation for accurate circuit delay calculation using SATACM Transactions on Design Automation of Electronic Systems10.1145/1255456.125547312:3(1-23)Online publication date: 22-May-2008
https://dl.acm.org/doi/10.1145/1255456.1255473
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

Shortest path problem with uncertain arc lengths

On the inverse shortest path length problem

A label-setting algorithm for finding a quickest path

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations