Complexity of two-level logic minimization
The complexity of two-level logic minimization is a topic of interest to both computer-aided design (CAD) specialists and computer science theoreticians. In the logic synthesis community, two-level logic minimization forms the foundation for more complex optimization procedures that have significant...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on computer-aided design of integrated circuits and systems 2006-07, Vol.25 (7), p.1230-1246 |
|---|---|
| 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 | 1246 |
|---|---|
| container_issue | 7 |
| container_start_page | 1230 |
| container_title | IEEE transactions on computer-aided design of integrated circuits and systems |
| container_volume | 25 |
| creator | Umans, C. Villa, T. Sangiovanni-Vincentelli, A.L. |
| description | The complexity of two-level logic minimization is a topic of interest to both computer-aided design (CAD) specialists and computer science theoreticians. In the logic synthesis community, two-level logic minimization forms the foundation for more complex optimization procedures that have significant real-world impact. At the same time, the computational complexity of two-level logic minimization has posed challenges since the beginning of the field in the 1960s; indeed, some central questions have been resolved only within the last few years, and others remain open. This recent activity has classified some logic optimization problems of high practical relevance, such as finding the minimal sum-of-products (SOP) form and maximal term expansion and reduction. This paper surveys progress in the field with self-contained expositions of fundamental early results, an account of the recent advances, and some new classifications. It includes an introduction to the relevant concepts and terminology from computational complexity, as well a discussion of the major remaining open problems in the complexity of logic minimization |
| doi_str_mv | 10.1109/TCAD.2005.855944 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TCAD_2005_855944</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1634621</ieee_id><sourcerecordid>29139898</sourcerecordid><originalsourceid>FETCH-LOGICAL-c427t-77330a6a32d3f78dc2e8258a06a26dbe5bab403d05f4d43bf6ff5294d72611683</originalsourceid><addsrcrecordid>eNqNkU1Lw0AQhhdRsFbvgpfgQURInf3ePZb4CQUv9bxsko1sSbI1SdX6690SQfAgnubyzMw78yB0imGGMejrZTa_mREAPlOca8b20ARrKlOGOd5HEyBSpQASDtFR368AMONET9BVFpp17T78sE1ClQzvIa3dm6uTOrz4Iml86xv_aQcf2mN0UNm6dyffdYqe726X2UO6eLp_zOaLtGBEDqmUlIIVlpKSVlKVBXGKcGVBWCLK3PHc5gxoCbxiJaN5JaoqRmGlJAJjoegUXYxz11143bh-MI3vC1fXtnVh0xuiMdVK_wNUADSuiuDlnyAWEscEWPGInv9CV2HTtfFeowQXPP5RRwhGqOhC33euMuvON7bbGgxmZ8PsbJidDTPaiC1nY4t3zv3ggjJBMP0CfkiDHg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>865650279</pqid></control><display><type>article</type><title>Complexity of two-level logic minimization</title><source>IEEE Xplore</source><creator>Umans, C. ; Villa, T. ; Sangiovanni-Vincentelli, A.L.</creator><creatorcontrib>Umans, C. ; Villa, T. ; Sangiovanni-Vincentelli, A.L.</creatorcontrib><description>The complexity of two-level logic minimization is a topic of interest to both computer-aided design (CAD) specialists and computer science theoreticians. In the logic synthesis community, two-level logic minimization forms the foundation for more complex optimization procedures that have significant real-world impact. At the same time, the computational complexity of two-level logic minimization has posed challenges since the beginning of the field in the 1960s; indeed, some central questions have been resolved only within the last few years, and others remain open. This recent activity has classified some logic optimization problems of high practical relevance, such as finding the minimal sum-of-products (SOP) form and maximal term expansion and reduction. This paper surveys progress in the field with self-contained expositions of fundamental early results, an account of the recent advances, and some new classifications. It includes an introduction to the relevant concepts and terminology from computational complexity, as well a discussion of the major remaining open problems in the complexity of logic minimization</description><identifier>ISSN: 0278-0070</identifier><identifier>EISSN: 1937-4151</identifier><identifier>DOI: 10.1109/TCAD.2005.855944</identifier><identifier>CODEN: ITCSDI</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Boolean functions ; Complexity ; Computation ; Computational complexity ; Computer aided design ; Computer science ; Data structures ; Design automation ; Design engineering ; History ; Logic ; Logic design ; logic minimization ; Minimization ; Minimization methods ; Multivalued logic ; Optimization ; Programmable logic arrays ; Studies ; Terminology ; two-level logic</subject><ispartof>IEEE transactions on computer-aided design of integrated circuits and systems, 2006-07, Vol.25 (7), p.1230-1246</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2006</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c427t-77330a6a32d3f78dc2e8258a06a26dbe5bab403d05f4d43bf6ff5294d72611683</citedby><cites>FETCH-LOGICAL-c427t-77330a6a32d3f78dc2e8258a06a26dbe5bab403d05f4d43bf6ff5294d72611683</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1634621$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1634621$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Umans, C.</creatorcontrib><creatorcontrib>Villa, T.</creatorcontrib><creatorcontrib>Sangiovanni-Vincentelli, A.L.</creatorcontrib><title>Complexity of two-level logic minimization</title><title>IEEE transactions on computer-aided design of integrated circuits and systems</title><addtitle>TCAD</addtitle><description>The complexity of two-level logic minimization is a topic of interest to both computer-aided design (CAD) specialists and computer science theoreticians. In the logic synthesis community, two-level logic minimization forms the foundation for more complex optimization procedures that have significant real-world impact. At the same time, the computational complexity of two-level logic minimization has posed challenges since the beginning of the field in the 1960s; indeed, some central questions have been resolved only within the last few years, and others remain open. This recent activity has classified some logic optimization problems of high practical relevance, such as finding the minimal sum-of-products (SOP) form and maximal term expansion and reduction. This paper surveys progress in the field with self-contained expositions of fundamental early results, an account of the recent advances, and some new classifications. It includes an introduction to the relevant concepts and terminology from computational complexity, as well a discussion of the major remaining open problems in the complexity of logic minimization</description><subject>Boolean functions</subject><subject>Complexity</subject><subject>Computation</subject><subject>Computational complexity</subject><subject>Computer aided design</subject><subject>Computer science</subject><subject>Data structures</subject><subject>Design automation</subject><subject>Design engineering</subject><subject>History</subject><subject>Logic</subject><subject>Logic design</subject><subject>logic minimization</subject><subject>Minimization</subject><subject>Minimization methods</subject><subject>Multivalued logic</subject><subject>Optimization</subject><subject>Programmable logic arrays</subject><subject>Studies</subject><subject>Terminology</subject><subject>two-level logic</subject><issn>0278-0070</issn><issn>1937-4151</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNqNkU1Lw0AQhhdRsFbvgpfgQURInf3ePZb4CQUv9bxsko1sSbI1SdX6690SQfAgnubyzMw78yB0imGGMejrZTa_mREAPlOca8b20ARrKlOGOd5HEyBSpQASDtFR368AMONET9BVFpp17T78sE1ClQzvIa3dm6uTOrz4Iml86xv_aQcf2mN0UNm6dyffdYqe726X2UO6eLp_zOaLtGBEDqmUlIIVlpKSVlKVBXGKcGVBWCLK3PHc5gxoCbxiJaN5JaoqRmGlJAJjoegUXYxz11143bh-MI3vC1fXtnVh0xuiMdVK_wNUADSuiuDlnyAWEscEWPGInv9CV2HTtfFeowQXPP5RRwhGqOhC33euMuvON7bbGgxmZ8PsbJidDTPaiC1nY4t3zv3ggjJBMP0CfkiDHg</recordid><startdate>20060701</startdate><enddate>20060701</enddate><creator>Umans, C.</creator><creator>Villa, T.</creator><creator>Sangiovanni-Vincentelli, A.L.</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>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope><scope>7TB</scope></search><sort><creationdate>20060701</creationdate><title>Complexity of two-level logic minimization</title><author>Umans, C. ; Villa, T. ; Sangiovanni-Vincentelli, A.L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c427t-77330a6a32d3f78dc2e8258a06a26dbe5bab403d05f4d43bf6ff5294d72611683</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Boolean functions</topic><topic>Complexity</topic><topic>Computation</topic><topic>Computational complexity</topic><topic>Computer aided design</topic><topic>Computer science</topic><topic>Data structures</topic><topic>Design automation</topic><topic>Design engineering</topic><topic>History</topic><topic>Logic</topic><topic>Logic design</topic><topic>logic minimization</topic><topic>Minimization</topic><topic>Minimization methods</topic><topic>Multivalued logic</topic><topic>Optimization</topic><topic>Programmable logic arrays</topic><topic>Studies</topic><topic>Terminology</topic><topic>two-level logic</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Umans, C.</creatorcontrib><creatorcontrib>Villa, T.</creatorcontrib><creatorcontrib>Sangiovanni-Vincentelli, A.L.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005–Present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998–Present</collection><collection>IEEE Xplore</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><jtitle>IEEE transactions on computer-aided design of integrated circuits and systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Umans, C.</au><au>Villa, T.</au><au>Sangiovanni-Vincentelli, A.L.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Complexity of two-level logic minimization</atitle><jtitle>IEEE transactions on computer-aided design of integrated circuits and systems</jtitle><stitle>TCAD</stitle><date>2006-07-01</date><risdate>2006</risdate><volume>25</volume><issue>7</issue><spage>1230</spage><epage>1246</epage><pages>1230-1246</pages><issn>0278-0070</issn><eissn>1937-4151</eissn><coden>ITCSDI</coden><abstract>The complexity of two-level logic minimization is a topic of interest to both computer-aided design (CAD) specialists and computer science theoreticians. In the logic synthesis community, two-level logic minimization forms the foundation for more complex optimization procedures that have significant real-world impact. At the same time, the computational complexity of two-level logic minimization has posed challenges since the beginning of the field in the 1960s; indeed, some central questions have been resolved only within the last few years, and others remain open. This recent activity has classified some logic optimization problems of high practical relevance, such as finding the minimal sum-of-products (SOP) form and maximal term expansion and reduction. This paper surveys progress in the field with self-contained expositions of fundamental early results, an account of the recent advances, and some new classifications. It includes an introduction to the relevant concepts and terminology from computational complexity, as well a discussion of the major remaining open problems in the complexity of logic minimization</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TCAD.2005.855944</doi><tpages>17</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0278-0070 |
| ispartof | IEEE transactions on computer-aided design of integrated circuits and systems, 2006-07, Vol.25 (7), p.1230-1246 |
| issn | 0278-0070 1937-4151 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TCAD_2005_855944 |
| source | IEEE Xplore |
| subjects | Boolean functions Complexity Computation Computational complexity Computer aided design Computer science Data structures Design automation Design engineering History Logic Logic design logic minimization Minimization Minimization methods Multivalued logic Optimization Programmable logic arrays Studies Terminology two-level logic |
| title | Complexity of two-level logic minimization |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T20%3A04%3A25IST&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=Complexity%20of%20two-level%20logic%20minimization&rft.jtitle=IEEE%20transactions%20on%20computer-aided%20design%20of%20integrated%20circuits%20and%20systems&rft.au=Umans,%20C.&rft.date=2006-07-01&rft.volume=25&rft.issue=7&rft.spage=1230&rft.epage=1246&rft.pages=1230-1246&rft.issn=0278-0070&rft.eissn=1937-4151&rft.coden=ITCSDI&rft_id=info:doi/10.1109/TCAD.2005.855944&rft_dat=%3Cproquest_RIE%3E29139898%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=865650279&rft_id=info:pmid/&rft_ieee_id=1634621&rfr_iscdi=true |