Simplifying Clock Gating Logic by Matching Factored Forms

Gate-level clock gating starts with a netlist, with partial or no gating applied; some flip-flops are then selected for further gating to reduce the circuit's power consumption, and a gating logic of the smallest possible size must then be synthesized. We show how to do this by factored form ma...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on very large scale integration (VLSI) systems 2014-06, Vol.22 (6), p.1338-1349
Hauptverfasser: Han, Inhak, Shin, Youngsoo
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 1349
container_issue 6
container_start_page 1338
container_title IEEE transactions on very large scale integration (VLSI) systems
container_volume 22
creator Han, Inhak
Shin, Youngsoo
description Gate-level clock gating starts with a netlist, with partial or no gating applied; some flip-flops are then selected for further gating to reduce the circuit's power consumption, and a gating logic of the smallest possible size must then be synthesized. We show how to do this by factored form matching, in which gating functions in factored forms are matched, as far as possible, with factored forms of the Boolean functions of existing combinational nodes in the circuit; additional gates are then introduced, but only for the portion of gating functions that are not matched. Strong matching identifies matches that are explicitly present in the factored forms, and weak matching seeks matches that are implicit in the logic and thus are more difficult to discover. Factored form matching reduces gating logic by an average of 24%, over a few test circuits, for which Boolean division only achieves an average reduction of 8%.
doi_str_mv 10.1109/TVLSI.2013.2271054
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_1545997576</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6560432</ieee_id><sourcerecordid>3377773801</sourcerecordid><originalsourceid>FETCH-LOGICAL-c295t-e7cf085bbaae87072343915b6b919d4ae54d53420c481e59bb2c5572eae7e69c3</originalsourceid><addsrcrecordid>eNo9kE1PAjEQhhujiYj-Ab1s4nlx-rXdHg0RJFnjAfTatGUWF4Fiuxz49-4KcS7zkfedmTyE3FMYUQr6afFZzWcjBpSPGFMUpLggAyqlynUXl10NBc9LRuGa3KS0BqBCaBgQPW-2-01TH5vdKhtvgv_OprbtmyqsGp-5Y_ZmW__VTybWtyHiMpuEuE235Kq2m4R35zwkH5OXxfg1r96ns_FzlXumZZuj8jWU0jlrsVSgGBdcU-kKp6leCotSLCUXDLwoKUrtHPPd3wwtKiy050PyeNq7j-HngKk163CIu-6koVJIrZVURadiJ5WPIaWItdnHZmvj0VAwPSLzh8j0iMwZUWd6OJkaRPw3FLIAwRn_BaKpYRk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1545997576</pqid></control><display><type>article</type><title>Simplifying Clock Gating Logic by Matching Factored Forms</title><source>IEEE Electronic Library (IEL)</source><creator>Han, Inhak ; Shin, Youngsoo</creator><creatorcontrib>Han, Inhak ; Shin, Youngsoo</creatorcontrib><description>Gate-level clock gating starts with a netlist, with partial or no gating applied; some flip-flops are then selected for further gating to reduce the circuit's power consumption, and a gating logic of the smallest possible size must then be synthesized. We show how to do this by factored form matching, in which gating functions in factored forms are matched, as far as possible, with factored forms of the Boolean functions of existing combinational nodes in the circuit; additional gates are then introduced, but only for the portion of gating functions that are not matched. Strong matching identifies matches that are explicitly present in the factored forms, and weak matching seeks matches that are implicit in the logic and thus are more difficult to discover. Factored form matching reduces gating logic by an average of 24%, over a few test circuits, for which Boolean division only achieves an average reduction of 8%.</description><identifier>ISSN: 1063-8210</identifier><identifier>EISSN: 1557-9999</identifier><identifier>DOI: 10.1109/TVLSI.2013.2271054</identifier><identifier>CODEN: IEVSE9</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Boolean functions ; Clock gating ; Clocks ; factored form ; factoring tree ; gating logic ; Kernel ; Logic gates ; Registers ; Very large scale integration</subject><ispartof>IEEE transactions on very large scale integration (VLSI) systems, 2014-06, Vol.22 (6), p.1338-1349</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jun 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c295t-e7cf085bbaae87072343915b6b919d4ae54d53420c481e59bb2c5572eae7e69c3</citedby><cites>FETCH-LOGICAL-c295t-e7cf085bbaae87072343915b6b919d4ae54d53420c481e59bb2c5572eae7e69c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6560432$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6560432$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Han, Inhak</creatorcontrib><creatorcontrib>Shin, Youngsoo</creatorcontrib><title>Simplifying Clock Gating Logic by Matching Factored Forms</title><title>IEEE transactions on very large scale integration (VLSI) systems</title><addtitle>TVLSI</addtitle><description>Gate-level clock gating starts with a netlist, with partial or no gating applied; some flip-flops are then selected for further gating to reduce the circuit's power consumption, and a gating logic of the smallest possible size must then be synthesized. We show how to do this by factored form matching, in which gating functions in factored forms are matched, as far as possible, with factored forms of the Boolean functions of existing combinational nodes in the circuit; additional gates are then introduced, but only for the portion of gating functions that are not matched. Strong matching identifies matches that are explicitly present in the factored forms, and weak matching seeks matches that are implicit in the logic and thus are more difficult to discover. Factored form matching reduces gating logic by an average of 24%, over a few test circuits, for which Boolean division only achieves an average reduction of 8%.</description><subject>Boolean functions</subject><subject>Clock gating</subject><subject>Clocks</subject><subject>factored form</subject><subject>factoring tree</subject><subject>gating logic</subject><subject>Kernel</subject><subject>Logic gates</subject><subject>Registers</subject><subject>Very large scale integration</subject><issn>1063-8210</issn><issn>1557-9999</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kE1PAjEQhhujiYj-Ab1s4nlx-rXdHg0RJFnjAfTatGUWF4Fiuxz49-4KcS7zkfedmTyE3FMYUQr6afFZzWcjBpSPGFMUpLggAyqlynUXl10NBc9LRuGa3KS0BqBCaBgQPW-2-01TH5vdKhtvgv_OprbtmyqsGp-5Y_ZmW__VTybWtyHiMpuEuE235Kq2m4R35zwkH5OXxfg1r96ns_FzlXumZZuj8jWU0jlrsVSgGBdcU-kKp6leCotSLCUXDLwoKUrtHPPd3wwtKiy050PyeNq7j-HngKk163CIu-6koVJIrZVURadiJ5WPIaWItdnHZmvj0VAwPSLzh8j0iMwZUWd6OJkaRPw3FLIAwRn_BaKpYRk</recordid><startdate>20140601</startdate><enddate>20140601</enddate><creator>Han, Inhak</creator><creator>Shin, Youngsoo</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></search><sort><creationdate>20140601</creationdate><title>Simplifying Clock Gating Logic by Matching Factored Forms</title><author>Han, Inhak ; Shin, Youngsoo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c295t-e7cf085bbaae87072343915b6b919d4ae54d53420c481e59bb2c5572eae7e69c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Boolean functions</topic><topic>Clock gating</topic><topic>Clocks</topic><topic>factored form</topic><topic>factoring tree</topic><topic>gating logic</topic><topic>Kernel</topic><topic>Logic gates</topic><topic>Registers</topic><topic>Very large scale integration</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Han, Inhak</creatorcontrib><creatorcontrib>Shin, Youngsoo</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005–Present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Electronics &amp; 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>Han, Inhak</au><au>Shin, Youngsoo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Simplifying Clock Gating Logic by Matching Factored Forms</atitle><jtitle>IEEE transactions on very large scale integration (VLSI) systems</jtitle><stitle>TVLSI</stitle><date>2014-06-01</date><risdate>2014</risdate><volume>22</volume><issue>6</issue><spage>1338</spage><epage>1349</epage><pages>1338-1349</pages><issn>1063-8210</issn><eissn>1557-9999</eissn><coden>IEVSE9</coden><abstract>Gate-level clock gating starts with a netlist, with partial or no gating applied; some flip-flops are then selected for further gating to reduce the circuit's power consumption, and a gating logic of the smallest possible size must then be synthesized. We show how to do this by factored form matching, in which gating functions in factored forms are matched, as far as possible, with factored forms of the Boolean functions of existing combinational nodes in the circuit; additional gates are then introduced, but only for the portion of gating functions that are not matched. Strong matching identifies matches that are explicitly present in the factored forms, and weak matching seeks matches that are implicit in the logic and thus are more difficult to discover. Factored form matching reduces gating logic by an average of 24%, over a few test circuits, for which Boolean division only achieves an average reduction of 8%.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TVLSI.2013.2271054</doi><tpages>12</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1063-8210
ispartof IEEE transactions on very large scale integration (VLSI) systems, 2014-06, Vol.22 (6), p.1338-1349
issn 1063-8210
1557-9999
language eng
recordid cdi_proquest_journals_1545997576
source IEEE Electronic Library (IEL)
subjects Boolean functions
Clock gating
Clocks
factored form
factoring tree
gating logic
Kernel
Logic gates
Registers
Very large scale integration
title Simplifying Clock Gating Logic by Matching Factored Forms
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T12%3A14%3A08IST&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=Simplifying%20Clock%20Gating%20Logic%20by%20Matching%20Factored%20Forms&rft.jtitle=IEEE%20transactions%20on%20very%20large%20scale%20integration%20(VLSI)%20systems&rft.au=Han,%20Inhak&rft.date=2014-06-01&rft.volume=22&rft.issue=6&rft.spage=1338&rft.epage=1349&rft.pages=1338-1349&rft.issn=1063-8210&rft.eissn=1557-9999&rft.coden=IEVSE9&rft_id=info:doi/10.1109/TVLSI.2013.2271054&rft_dat=%3Cproquest_RIE%3E3377773801%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=1545997576&rft_id=info:pmid/&rft_ieee_id=6560432&rfr_iscdi=true