Progressive decomposition a heuristic to structure arithmetic circuits
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In most of the arithmetic circuits the outcome of the synthesis tools depends on the input description of the circuit. In other...
Gespeichert in:
| Veröffentlicht in: | 2007 44th ACM/IEEE Design Automation Conference S. 404 - 409 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
New York, NY, USA
ACM
04.06.2007
IEEE |
| Schriftenreihe: | ACM Conferences |
| Schlagworte: | |
| ISBN: | 1595936270, 9781595936271 |
| ISSN: | 0738-100X |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In most of the arithmetic circuits the outcome of the synthesis tools depends on the input description of the circuit. In other words, logic synthesis optimisations hardly change the architecture of the given circuit. However, once the input description belongs to the right architecture, logic synthesis does an excellent job in optimising the circuit locally. This is the reason why designers still rely on well studied architectures. The main difficulty in finding the suitable architecture for an arithmetic circuit is the high fan-in dependencies between inputs and outputs (i.e., each output bit depends on a large portion of input bits). Hence, imposing hierarchy and structure is the key to find the best architecture. Although factorisation is one potential solution for this problem, the computational complexity of Boolean factorisation and poor performance of algebraic factorisation make this solution impractical in most cases of interest. In this paper we present a novel approach which progressively decomposes the input circuits into building blocks and constructs hierarchy among these blocks. We show that our approach optimises the critical path delay by 15--30% at the cost of marginal or no area penalty. In some cases, it even improves the area. Qualitatively we observed that our approach found the best known architecture for some circuits without any a priori knowledge about the functionality of the circuit. |
|---|---|
| AbstractList | Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In most of the arithmetic circuits the outcome of the synthesis tools depends on the input description of the circuit. In other words, logic synthesis optimisations hardly change the architecture of the given circuit. However, once the input description belongs to the right architecture, logic synthesis does an excellent job in optimising the circuit locally. This is the reason why designers still rely on well studied architectures. The main difficulty in finding the suitable architecture for an arithmetic circuit is the high fan-in dependencies between inputs and outputs (i.e., each output bit depends on a large portion of input bits). Hence, imposing hierarchy and structure is the key to find the best architecture. Although factorisation is one potential solution for this problem, the computational complexity of Boolean factorisation and poor performance of algebraic factorisation make this solution impractical in most cases of interest. In this paper we present a novel approach which progressively decomposes the input circuits into building blocks and constructs hierarchy among these blocks. We show that our approach optimises the critical path delay by 15--30% at the cost of marginal or no area penalty. In some cases, it even improves the area. Qualitatively we observed that our approach found the best known architecture for some circuits without any a priori knowledge about the functionality of the circuit. |
| Author | Brisk, Philip Ienne, Paolo Verma, Ajay K. |
| Author_xml | – sequence: 1 givenname: Ajay K. surname: Verma fullname: Verma, Ajay K. organization: School of Computer and Communication Sciences, Lausanne, Switzerland – sequence: 2 givenname: Philip surname: Brisk fullname: Brisk, Philip organization: School of Computer and Communication Sciences, Lausanne, Switzerland – sequence: 3 givenname: Paolo surname: Ienne fullname: Ienne, Paolo organization: School of Computer and Communication Sciences, Lausanne, Switzerland |
| BookMark | eNqNkEtLAzEUhQMq2NauRdy4EjdTb5KbR5dSfEFBFwruQiZzI9HOpE5awX_vSPsDXB0O57H4xuywyx0xdsphxjmqay6MRTuYQZVVB2zM1VzNpRYGDtkIjLQVB3g7ZtNSPgCAc2kFmhE7e-7ze0-lpG-6aCjkdp1L2qTcnbCj6FeFpnudsNe725fFQ7V8un9c3Cwrz4WEKoYaQFoIGEk0ihCsImW1hmiViEGSh6C5t9CgxsaiQIy-MTLq2qCdywm73P2u-_y1pbJxbSqBVivfUd4WJzkaQISheL4rJiJy6z61vv9xKDQXXA_pbJf60Lo658_iOLg_Om5Px-3puLpPFIfB1T8H8hfI7GJA |
| ContentType | Conference Proceeding |
| Copyright | 2007 ACM |
| Copyright_xml | – notice: 2007 ACM |
| DBID | 6IE 6IH CBEJK RIE RIO 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1145/1278480.1278585 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Xplore Digital Library IEEE Proceedings Order Plans (POP) 1998-present Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Xplore Digital Library url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EndPage | 409 |
| ExternalDocumentID | 4261216 |
| Genre | orig-research Conference Paper |
| GroupedDBID | 6IE 6IF 6IG 6IH 6IK 6IL 6IM 6IN AAJGR AARBI ACM ADPZR ALMA_UNASSIGNED_HOLDINGS APO BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK GUFHI IERZE OCL RIE RIL RIO 123 29O AAWTH ACGFS ADZIZ CHZPO IEGSK IJVOP IPLJI M43 RNS 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-a1230-fcb00380c4fe2d5e4085e58660f852fc3ea0c61a80d464d84244fad73f6b74893 |
| IEDL.DBID | RIE |
| ISBN | 1595936270 9781595936271 |
| ISSN | 0738-100X |
| IngestDate | Sun Nov 09 10:09:16 EST 2025 Wed Aug 27 01:44:46 EDT 2025 Wed Jan 31 06:35:56 EST 2024 Wed Jan 31 06:35:57 EST 2024 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Keywords | progressive decomposition boolean ring factorisation |
| Language | English |
| License | Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org |
| LinkModel | DirectLink |
| MeetingName | DAC07: The 44th Annual Design Automation Conference 2007 |
| MergedId | FETCHMERGED-LOGICAL-a1230-fcb00380c4fe2d5e4085e58660f852fc3ea0c61a80d464d84244fad73f6b74893 |
| Notes | SourceType-Conference Papers & Proceedings-1 ObjectType-Conference Paper-1 content type line 25 |
| PQID | 31470440 |
| PQPubID | 23500 |
| PageCount | 6 |
| ParticipantIDs | acm_books_10_1145_1278480_1278585_brief ieee_primary_4261216 proquest_miscellaneous_31470440 acm_books_10_1145_1278480_1278585 |
| PublicationCentury | 2000 |
| PublicationDate | 20070604 2007-June |
| PublicationDateYYYYMMDD | 2007-06-04 2007-06-01 |
| PublicationDate_xml | – month: 06 year: 2007 text: 20070604 day: 04 |
| PublicationDecade | 2000 |
| PublicationPlace | New York, NY, USA |
| PublicationPlace_xml | – name: New York, NY, USA |
| PublicationSeriesTitle | ACM Conferences |
| PublicationTitle | 2007 44th ACM/IEEE Design Automation Conference |
| PublicationTitleAbbrev | DAC |
| PublicationYear | 2007 |
| Publisher | ACM IEEE |
| Publisher_xml | – name: ACM – name: IEEE |
| SSID | ssj0001138247 ssj0004161 |
| Score | 1.630432 |
| Snippet | Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and... |
| SourceID | proquest ieee acm |
| SourceType | Aggregation Database Publisher |
| StartPage | 404 |
| SubjectTerms | Algorithms Boolean Ring Circuit synthesis Computational complexity Computer architecture Cost function Delay Design Detectors Digital arithmetic Factorisation Hardware -- Integrated circuits -- Logic circuits -- Arithmetic and datapath circuits Integrated circuit interconnections Logic circuits Manuals Progressive Decomposition |
| Subtitle | a heuristic to structure arithmetic circuits |
| Title | Progressive decomposition |
| URI | https://ieeexplore.ieee.org/document/4261216 https://www.proquest.com/docview/31470440 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3BT9swFMafAO3ALsAA0QGbkZB2IcNOHNvlhmCMw4QqwVBvlus8ixzaTmnD34-fm1IkJk27JUoiRS-2X-z3fT8DnOaVMkIXeRbnP0UmXSWyfuFEHAzLQLQRiUk8_vhL392Z4bA_WIOzVy8MIibxGX6nw1TLr6a-paWyc5l4V2od1rVWC6_Waj2FYHpSrzyRIrFSYwsmfCkfkqmrJAqvyvWS9bQ8Fx3zR8jyXFAlzhB1QVPJjJKWH3dbr7wbr1MSutn6v9ffhr2Vm48NXvPUDqzh5BN8fAMi3IWfA5JpkSL2Gdk1ks68E3NdsEt2i-2C58zmU3afgLNtg-yyqedPYzJBsqu68W09n-3B75sfD1e3WbfFQuZiyuJZ8NStDfcyYF6VSLwzLI1SPJgyD75Ax70SzvBKKlkZssUFV-kiqFHi1uzDxmQ6wQNgOk6kOIa-cfFK4GaE8Vc4J3yY85XmvgcnMZKW5g4zu7BDl7aLtu2i3YNv_7zHjpoaQw92KcD2z4LJYbvY9uDr8gvZ2E-o-OEmOG1nthBS0_ban__-4CFsLpWAXBzBRowlHsMH_zyvZ82X1NReANvAxks |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3PT9swFMefGENiXDZ-aYVteBISl2XYiRO73BAb60RXVQKm3izXeRY50KK04e_Hz03ppE1CuyVKcsiL7Rf7fb8fAxynZaGFytIkzH-yRNpSJN3MijAY5p5oIxKjePx3Xw0GejTqDtfgy7MXBhGj-Ay_0mGs5ZdT19BS2amMvKviFbzOpUz5wq21WlEhnJ5UK1ekiLTU0IYJYMpHZOvKicNbpGpJe1qei5b6I2R-KqgWp4m7oKhoRmnL3bebr_w1Ysc0dPn2_17gHeyt_Hxs-JyptmENJzuw9QeKcBd-DEmoRZrYR2TfkJTmrZzrjJ2zHjYLojObT9l1RM42NbLzuprf3ZMNkl1UtWuq-WwPbi-_31z0knaThcSGpMUT76hja-6kx7TMkYhnmOui4F7nqXcZWu4KYTUvZSFLTcY4b0uV-WIcyTX7sD6ZTvA9MBWmUhx9V9twxXM9xvAznBJAzLpScdeBzyGShmYPM7MwROemjbZpo92BkxfvMeO6Qt-BXQqweVhQOUwb2w4cLb-QCT2Fyh92gtNmZjIhFW2wffDvB49gs3fzq2_6PwdXh_BmqQvk4gOsh7jiR9hwj_NqVn-Kze4JYH7Jkg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+44th+annual+Design+Automation+Conference&rft.atitle=Progressive+decomposition&rft.au=Verma%2C+Ajay+K.&rft.au=Brisk%2C+Philip&rft.au=Ienne%2C+Paolo&rft.series=ACM+Conferences&rft.date=2007-06-04&rft.pub=ACM&rft.isbn=1595936270&rft.spage=404&rft.epage=409&rft_id=info:doi/10.1145%2F1278480.1278585 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0738-100X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0738-100X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0738-100X&client=summon |