Formal Modeling and Verification of PCHB Asynchronous Circuits
Precharge half buffer (PCHB) is one of the major quasi-delay insensitive (QDI) asynchronous design paradigms, which has been utilized in several commercial applications due to its low power and inherent robustness. In industry, QDI circuits are often synthesized from a synchronous specification usin...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on very large scale integration (VLSI) systems 2019-12, Vol.27 (12), p.2911-2924 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 2924 |
---|---|
container_issue | 12 |
container_start_page | 2911 |
container_title | IEEE transactions on very large scale integration (VLSI) systems |
container_volume | 27 |
creator | Sakib, Ashiq A. Smith, Scott C. Srinivasan, Sudarshan K. |
description | Precharge half buffer (PCHB) is one of the major quasi-delay insensitive (QDI) asynchronous design paradigms, which has been utilized in several commercial applications due to its low power and inherent robustness. In industry, QDI circuits are often synthesized from a synchronous specification using custom synthesis tools. Design validation of the implemented QDI circuits mostly relies on extensive simulation, which may fail to detect corner-case bugs, especially in complex designs. Hence, a formal verification scheme for PCHB circuits is much needed. In this article, we present a formal verification methodology for PCHB circuits synthesized from a Boolean/synchronous specification, which is based on equivalence checking and can guarantee both safety (full functional correctness) and liveness (absence of deadlock). The approach is fast, scalable, and applicable to combinational as well as sequential PCHB circuits. We demonstrate the method using several multipliers, multiply and accumulate circuits (MACs), and IEEE International Symposium on Circuits and Systems (ISCAS) benchmarks. |
doi_str_mv | 10.1109/TVLSI.2019.2937087 |
format | Article |
fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_2317729018</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8836093</ieee_id><sourcerecordid>2317729018</sourcerecordid><originalsourceid>FETCH-LOGICAL-c339t-f256f7a1ff3b82aa793741d26400f7c5f7c7ad1fd406a430b228bc60810e4de23</originalsourceid><addsrcrecordid>eNo9kE9LAzEQxYMoWKtfQC8Bz1snf3aTXIS6WFuoKFh7Deluointpia7h357t7Y4MMwc3ps3_BC6JTAiBNTDYjn_mI0oEDWiigmQ4gwNSJ6LTPV13u9QsExSApfoKqU1AOFcwQA9TkLcmg1-DbXd-OYLm6bGSxu985VpfWhwcPi9nD7hcdo31XcMTegSLn2sOt-ma3ThzCbZm9Mcos_J86KcZvO3l1k5nmcVY6rNHM0LJwxxjq0kNUb0P3JS04IDOFHlfQtTE1dzKAxnsKJUrqoCJAHLa0vZEN0f7-5i-OlsavU6dLHpIzVlRAiqgMheRY-qKoaUonV6F_3WxL0moA-c9B8nfeCkT5x6093R5K21_wYpWQGKsV8Rl2Mc</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2317729018</pqid></control><display><type>article</type><title>Formal Modeling and Verification of PCHB Asynchronous Circuits</title><source>IEEE/IET Electronic Library</source><creator>Sakib, Ashiq A. ; Smith, Scott C. ; Srinivasan, Sudarshan K.</creator><creatorcontrib>Sakib, Ashiq A. ; Smith, Scott C. ; Srinivasan, Sudarshan K.</creatorcontrib><description>Precharge half buffer (PCHB) is one of the major quasi-delay insensitive (QDI) asynchronous design paradigms, which has been utilized in several commercial applications due to its low power and inherent robustness. In industry, QDI circuits are often synthesized from a synchronous specification using custom synthesis tools. Design validation of the implemented QDI circuits mostly relies on extensive simulation, which may fail to detect corner-case bugs, especially in complex designs. Hence, a formal verification scheme for PCHB circuits is much needed. In this article, we present a formal verification methodology for PCHB circuits synthesized from a Boolean/synchronous specification, which is based on equivalence checking and can guarantee both safety (full functional correctness) and liveness (absence of deadlock). The approach is fast, scalable, and applicable to combinational as well as sequential PCHB circuits. We demonstrate the method using several multipliers, multiply and accumulate circuits (MACs), and IEEE International Symposium on Circuits and Systems (ISCAS) benchmarks.</description><identifier>ISSN: 1063-8210</identifier><identifier>EISSN: 1557-9999</identifier><identifier>DOI: 10.1109/TVLSI.2019.2937087</identifier><identifier>CODEN: IEVSE9</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Asynchronous circuits ; Boolean algebra ; Circuit design ; Clocks ; Computer simulation ; Electronic design automation ; equivalence verification ; formal methods ; Industries ; Integrated circuit modeling ; Latches ; Logic gates ; precharge half buffer (PCHB) ; quasi-delay insensitive (QDI) ; Specifications ; Synthesis ; System recovery ; Verification</subject><ispartof>IEEE transactions on very large scale integration (VLSI) systems, 2019-12, Vol.27 (12), p.2911-2924</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c339t-f256f7a1ff3b82aa793741d26400f7c5f7c7ad1fd406a430b228bc60810e4de23</citedby><cites>FETCH-LOGICAL-c339t-f256f7a1ff3b82aa793741d26400f7c5f7c7ad1fd406a430b228bc60810e4de23</cites><orcidid>0000-0001-7985-2449 ; 0000-0001-9863-6637 ; 0000-0001-7040-384X</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8836093$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8836093$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Sakib, Ashiq A.</creatorcontrib><creatorcontrib>Smith, Scott C.</creatorcontrib><creatorcontrib>Srinivasan, Sudarshan K.</creatorcontrib><title>Formal Modeling and Verification of PCHB Asynchronous Circuits</title><title>IEEE transactions on very large scale integration (VLSI) systems</title><addtitle>TVLSI</addtitle><description>Precharge half buffer (PCHB) is one of the major quasi-delay insensitive (QDI) asynchronous design paradigms, which has been utilized in several commercial applications due to its low power and inherent robustness. In industry, QDI circuits are often synthesized from a synchronous specification using custom synthesis tools. Design validation of the implemented QDI circuits mostly relies on extensive simulation, which may fail to detect corner-case bugs, especially in complex designs. Hence, a formal verification scheme for PCHB circuits is much needed. In this article, we present a formal verification methodology for PCHB circuits synthesized from a Boolean/synchronous specification, which is based on equivalence checking and can guarantee both safety (full functional correctness) and liveness (absence of deadlock). The approach is fast, scalable, and applicable to combinational as well as sequential PCHB circuits. We demonstrate the method using several multipliers, multiply and accumulate circuits (MACs), and IEEE International Symposium on Circuits and Systems (ISCAS) benchmarks.</description><subject>Asynchronous circuits</subject><subject>Boolean algebra</subject><subject>Circuit design</subject><subject>Clocks</subject><subject>Computer simulation</subject><subject>Electronic design automation</subject><subject>equivalence verification</subject><subject>formal methods</subject><subject>Industries</subject><subject>Integrated circuit modeling</subject><subject>Latches</subject><subject>Logic gates</subject><subject>precharge half buffer (PCHB)</subject><subject>quasi-delay insensitive (QDI)</subject><subject>Specifications</subject><subject>Synthesis</subject><subject>System recovery</subject><subject>Verification</subject><issn>1063-8210</issn><issn>1557-9999</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kE9LAzEQxYMoWKtfQC8Bz1snf3aTXIS6WFuoKFh7Deluointpia7h357t7Y4MMwc3ps3_BC6JTAiBNTDYjn_mI0oEDWiigmQ4gwNSJ6LTPV13u9QsExSApfoKqU1AOFcwQA9TkLcmg1-DbXd-OYLm6bGSxu985VpfWhwcPi9nD7hcdo31XcMTegSLn2sOt-ma3ThzCbZm9Mcos_J86KcZvO3l1k5nmcVY6rNHM0LJwxxjq0kNUb0P3JS04IDOFHlfQtTE1dzKAxnsKJUrqoCJAHLa0vZEN0f7-5i-OlsavU6dLHpIzVlRAiqgMheRY-qKoaUonV6F_3WxL0moA-c9B8nfeCkT5x6093R5K21_wYpWQGKsV8Rl2Mc</recordid><startdate>20191201</startdate><enddate>20191201</enddate><creator>Sakib, Ashiq A.</creator><creator>Smith, Scott C.</creator><creator>Srinivasan, Sudarshan K.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0001-7985-2449</orcidid><orcidid>https://orcid.org/0000-0001-9863-6637</orcidid><orcidid>https://orcid.org/0000-0001-7040-384X</orcidid></search><sort><creationdate>20191201</creationdate><title>Formal Modeling and Verification of PCHB Asynchronous Circuits</title><author>Sakib, Ashiq A. ; Smith, Scott C. ; Srinivasan, Sudarshan K.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c339t-f256f7a1ff3b82aa793741d26400f7c5f7c7ad1fd406a430b228bc60810e4de23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Asynchronous circuits</topic><topic>Boolean algebra</topic><topic>Circuit design</topic><topic>Clocks</topic><topic>Computer simulation</topic><topic>Electronic design automation</topic><topic>equivalence verification</topic><topic>formal methods</topic><topic>Industries</topic><topic>Integrated circuit modeling</topic><topic>Latches</topic><topic>Logic gates</topic><topic>precharge half buffer (PCHB)</topic><topic>quasi-delay insensitive (QDI)</topic><topic>Specifications</topic><topic>Synthesis</topic><topic>System recovery</topic><topic>Verification</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Sakib, Ashiq A.</creatorcontrib><creatorcontrib>Smith, Scott C.</creatorcontrib><creatorcontrib>Srinivasan, Sudarshan K.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE/IET Electronic Library</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE transactions on very large scale integration (VLSI) systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Sakib, Ashiq A.</au><au>Smith, Scott C.</au><au>Srinivasan, Sudarshan K.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Formal Modeling and Verification of PCHB Asynchronous Circuits</atitle><jtitle>IEEE transactions on very large scale integration (VLSI) systems</jtitle><stitle>TVLSI</stitle><date>2019-12-01</date><risdate>2019</risdate><volume>27</volume><issue>12</issue><spage>2911</spage><epage>2924</epage><pages>2911-2924</pages><issn>1063-8210</issn><eissn>1557-9999</eissn><coden>IEVSE9</coden><abstract>Precharge half buffer (PCHB) is one of the major quasi-delay insensitive (QDI) asynchronous design paradigms, which has been utilized in several commercial applications due to its low power and inherent robustness. In industry, QDI circuits are often synthesized from a synchronous specification using custom synthesis tools. Design validation of the implemented QDI circuits mostly relies on extensive simulation, which may fail to detect corner-case bugs, especially in complex designs. Hence, a formal verification scheme for PCHB circuits is much needed. In this article, we present a formal verification methodology for PCHB circuits synthesized from a Boolean/synchronous specification, which is based on equivalence checking and can guarantee both safety (full functional correctness) and liveness (absence of deadlock). The approach is fast, scalable, and applicable to combinational as well as sequential PCHB circuits. We demonstrate the method using several multipliers, multiply and accumulate circuits (MACs), and IEEE International Symposium on Circuits and Systems (ISCAS) benchmarks.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TVLSI.2019.2937087</doi><tpages>14</tpages><orcidid>https://orcid.org/0000-0001-7985-2449</orcidid><orcidid>https://orcid.org/0000-0001-9863-6637</orcidid><orcidid>https://orcid.org/0000-0001-7040-384X</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 1063-8210 |
ispartof | IEEE transactions on very large scale integration (VLSI) systems, 2019-12, Vol.27 (12), p.2911-2924 |
issn | 1063-8210 1557-9999 |
language | eng |
recordid | cdi_proquest_journals_2317729018 |
source | IEEE/IET Electronic Library |
subjects | Asynchronous circuits Boolean algebra Circuit design Clocks Computer simulation Electronic design automation equivalence verification formal methods Industries Integrated circuit modeling Latches Logic gates precharge half buffer (PCHB) quasi-delay insensitive (QDI) Specifications Synthesis System recovery Verification |
title | Formal Modeling and Verification of PCHB Asynchronous Circuits |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T14%3A22%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Formal%20Modeling%20and%20Verification%20of%20PCHB%20Asynchronous%20Circuits&rft.jtitle=IEEE%20transactions%20on%20very%20large%20scale%20integration%20(VLSI)%20systems&rft.au=Sakib,%20Ashiq%20A.&rft.date=2019-12-01&rft.volume=27&rft.issue=12&rft.spage=2911&rft.epage=2924&rft.pages=2911-2924&rft.issn=1063-8210&rft.eissn=1557-9999&rft.coden=IEVSE9&rft_id=info:doi/10.1109/TVLSI.2019.2937087&rft_dat=%3Cproquest_RIE%3E2317729018%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2317729018&rft_id=info:pmid/&rft_ieee_id=8836093&rfr_iscdi=true |