{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:14Z","timestamp":1750306034508,"version":"3.41.0"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T00:00:00Z","timestamp":1519344000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2018,5,31]]},"abstract":"<jats:p>In this article, we present a critical path selection method that efficiently finds true (sensitizable) critical paths of a circuit in the presence of process variations. The method, which is based on the viability analysis, tries to select the least number of true critical paths that cover all of circuit critical gates. Critical gates are those that make a path critical with a probability higher than a predefined threshold value. Selecting fewer critical paths leads to less computation time for the algorithm and shorter test time of fabricated chips. For this purpose, an efficient Statistical Static Timing Analysis\u2013 (SSTA) based technique is suggested. This technique tries to find circuit-critical gates whose process parameter variations cover a major part of the process space. Improving the process space coverage using fewer paths is achieved by considering both spatial (proximity of gates) and structural (having common gates) correlations in the analysis of choosing the critical paths. In the selection process, paths with low similarities in their characteristics are preferred. In addition, only true paths whose delays affect the maximum delay of the circuit are included. The selected paths can be used in the test process of the fabricated chips to determine if the chip meets its timing requirements. Also, a modified viability analysis that incorporates statistical computations is used in the SSTA. The efficacy of the proposed method is evaluated by comparing its results for combinational and sequential ISCAS benchmarks with those obtained by exhaustive search. Results indicate although, on average, only 4.38% of all the critical paths found by the exhaustive search are selected by the proposed method, the maximum probability of criticality for the paths that are not considered in our method is, on average, less than 4%.<\/jats:p>","DOI":"10.1145\/3177866","type":"journal-article","created":{"date-parts":[[2018,2,23]],"date-time":"2018-02-23T16:40:01Z","timestamp":1519404001000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient False Path-Aware Heuristic Critical Path Selection Method with High Coverage of the Process Variation Space"],"prefix":"10.1145","volume":"23","author":[{"given":"Sheis","family":"Abolmaali","sequence":"first","affiliation":[{"name":"University of Tehran, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehdi","family":"Kamal","sequence":"additional","affiliation":[{"name":"University of Tehran, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Afzali-Kusha","sequence":"additional","affiliation":[{"name":"University of Tehran, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massoud","family":"Pedram","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,2,23]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/996070.1009993"},{"volume-title":"Proceedings of the IEEE International Conference on Computer-Aided Design (ICCAD\u201987)","author":"Benkoski J.","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.907047"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/996070.1009954"},{"volume-title":"Proceedings of the IEEE International Conference on Computer-Aided Design (ICCAD\u201991)","author":"Chen Hsi-Chuan","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2012.2190067"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.2.145"},{"volume-title":"Proceedings of the 15th International Symposium on Quality Electronic Design (ISQED\u201914)","author":"Das Prasanjeet","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","unstructured":"DesignCompiler. 2010. Design compiler\u2014synopsys. Retrieved from http:\/\/www.synopsys.com\/Tools\/Implementation\/RTLSynthesis\/DesignCompiler\/Pages\/default.aspx.  DesignCompiler. 2010. Design compiler\u2014synopsys. Retrieved from http:\/\/www.synopsys.com\/Tools\/Implementation\/RTLSynthesis\/DesignCompiler\/Pages\/default.aspx."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2009.2017541"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/DFT.2014.6962082"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ATS.2010.59"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1899721.1899840"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2012.2208661"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2012.2211102"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2485288.2485358"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2492708.2493095"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.743742"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/513918.514061"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2014.2352937"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/74382.74476"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Patrick C. McGeer and Robert K. Brayton. 1991. Integrating Functional and Temporal Domains in Logic Design: The False Path Problem and Its Implications. Kluwer Academic Norwell MA.   Patrick C. McGeer and Robert K. Brayton. 1991. Integrating Functional and Temporal Domains in Logic Design: The False Path Problem and Its Implications. Kluwer Academic Norwell MA.","DOI":"10.1007\/978-1-4615-3960-5"},{"key":"e_1_2_1_23_1","unstructured":"Donald F. Morrison. 1976. Multivariate Statistical Methods. McGraw--Hill New York NY.  Donald F. Morrison. 1976. Multivariate Statistical Methods. McGraw--Hill New York NY."},{"key":"e_1_2_1_24_1","unstructured":"NanGate. 2016. Nangate\u2014The standard cell library optimization company. Retrieved from http:\/\/www.nangate.Com.  NanGate. 2016. Nangate\u2014The standard cell library optimization company. Retrieved from http:\/\/www.nangate.Com."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2006.157"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2011.2161353"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1870926.1871270"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2012.2205026"},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Jim Pitman. 1993. Probability (1st. ed.). Springer-Verlag New York NY.  Jim Pitman. 1993. Probability (1st. ed.). Springer-Verlag New York NY.","DOI":"10.1007\/978-1-4612-4374-8"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2305835"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ATS.2012.78"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2015.7357174"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/996566.996663"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2072670"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1129601.1129701"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/2485288.2485359"},{"volume-title":"Proceedings of the 2014 IEEE\/ACM International Conference on Computer-Aided Design (ICCAD'14)","author":"Huang Tsung-Wei","key":"e_1_2_1_37_1"},{"volume-title":"Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design (ICCAD'15)","author":"Huang Tsung-Wei","key":"e_1_2_1_38_1"},{"volume-title":"Contest: Pessimism Removal of Timing Analysis. Retreived from http:\/\/sites.google.com\/site\/taucontest2014.","year":"2014","author":"TAU.","key":"e_1_2_1_39_1"},{"volume-title":"Contest: Incremental Timing Analysis and Incremental CPPR.","year":"2015","author":"TAU.","key":"e_1_2_1_40_1"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.893552"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2017.2703623"}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3177866","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3177866","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:02:55Z","timestamp":1750215775000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3177866"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,23]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,5,31]]}},"alternative-id":["10.1145\/3177866"],"URL":"https:\/\/doi.org\/10.1145\/3177866","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"type":"print","value":"1084-4309"},{"type":"electronic","value":"1557-7309"}],"subject":[],"published":{"date-parts":[[2018,2,23]]},"assertion":[{"value":"2017-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-02-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}