ASPPLN: Accelerated Symbolic Probability Propagation in Logic Network
Probability propagation is an important task used in logic network analysis, which propagates signal probabilities from its primary inputs to its primary outputs. It has many applications such as power estimation, reliability analysis, and error analysis for approximate circuits. Existing methods fo...
Uloženo v:
| Vydáno v: | 2022 IEEE/ACM International Conference On Computer Aided Design (ICCAD) s. 1 - 9 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
ACM
29.10.2022
|
| Témata: | |
| ISSN: | 1558-2434 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Probability propagation is an important task used in logic network analysis, which propagates signal probabilities from its primary inputs to its primary outputs. It has many applications such as power estimation, reliability analysis, and error analysis for approximate circuits. Existing methods for the task can be divided into two categories: simulation-based and probability-based methods. However, most of them suffer from low accuracy or bad scalability. In this work, we propose ASPPLN, a method for accelerated symbolic probability propagation in logic network, which has a linear complexity with the network size. We first introduce a new definition in a graph called redundant input and take advantage of it to simplify the propagation process without losing accuracy. Then, a technique called symbol limitation is proposed to limit the complexity of each node's propagation according to the partial probability significances of the symbols. The experimental results showed that compared to the existing methods, ASPPLN improves the estimation accuracy of switching activity by up to 24.70%, while it also has a speedup of up to 29×. |
|---|---|
| AbstractList | Probability propagation is an important task used in logic network analysis, which propagates signal probabilities from its primary inputs to its primary outputs. It has many applications such as power estimation, reliability analysis, and error analysis for approximate circuits. Existing methods for the task can be divided into two categories: simulation-based and probability-based methods. However, most of them suffer from low accuracy or bad scalability. In this work, we propose ASPPLN, a method for accelerated symbolic probability propagation in logic network, which has a linear complexity with the network size. We first introduce a new definition in a graph called redundant input and take advantage of it to simplify the propagation process without losing accuracy. Then, a technique called symbol limitation is proposed to limit the complexity of each node's propagation according to the partial probability significances of the symbols. The experimental results showed that compared to the existing methods, ASPPLN improves the estimation accuracy of switching activity by up to 24.70%, while it also has a speedup of up to 29×. |
| Author | Xiao, Weihua Qian, Weikang |
| Author_xml | – sequence: 1 givenname: Weihua surname: Xiao fullname: Xiao, Weihua email: 019370910014@sjtu.edu.cn organization: University of Michigan-Shanghai Jiao Tong University Joint Institute, Shanghai Jiao Tong University,China – sequence: 2 givenname: Weikang surname: Qian fullname: Qian, Weikang email: qianwk@sjtu.edu.cn organization: University of Michigan-Shanghai Jiao Tong University Joint Institute, Shanghai Jiao Tong University,China |
| BookMark | eNotjM1Kw0AURkdRsNas3bjIC6Te-Z9xV0qrQqiB6rrcZGbKaJopSUDy9lZ09R04h--WXHWp84TcU1hQKuQjl2C4ZAsuhRVSXZDManMWwC2jWlySGZXSFExwcUOyYfgEAGY01RpmZL3cVVW5fcqXTeNb3-PoXb6bjnVqY5NXfaqxjm0cp18-4QHHmLo8dnmZDudg68fv1H_dkeuA7eCz_52Tj836ffVSlG_Pr6tlWSATZixELYJXzjF0oJ22Doy0gQeD3EpgklH0IegG0QXWgAhKSKRIGTcelFJ8Th7-fqP3fn_q4xH7aU8BlFXM8B9GI0zR |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1145/3508352.3549456 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE/IET Electronic Library IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISBN | 9781450392174 1450392172 |
| EISSN | 1558-2434 |
| EndPage | 9 |
| ExternalDocumentID | 10069628 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IH 6IL 6IN AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO FEDTE IEGSK IJVOP M43 OCL RIE RIL RIO |
| ID | FETCH-LOGICAL-a248t-4b4fe6dd2ad07d79d0859f3f8a39502521aeff7caadf2c04f645a1a1238e06663 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000981574300048&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:46:18 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a248t-4b4fe6dd2ad07d79d0859f3f8a39502521aeff7caadf2c04f645a1a1238e06663 |
| PageCount | 9 |
| ParticipantIDs | ieee_primary_10069628 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-Oct.-29 |
| PublicationDateYYYYMMDD | 2022-10-29 |
| PublicationDate_xml | – month: 10 year: 2022 text: 2022-Oct.-29 day: 29 |
| PublicationDecade | 2020 |
| PublicationTitle | 2022 IEEE/ACM International Conference On Computer Aided Design (ICCAD) |
| PublicationTitleAbbrev | ICCAD |
| PublicationYear | 2022 |
| Publisher | ACM |
| Publisher_xml | – name: ACM |
| SSID | ssj0002871770 ssj0020286 |
| Score | 2.2066765 |
| Snippet | Probability propagation is an important task used in logic network analysis, which propagates signal probabilities from its primary inputs to its primary... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | complexity dominator logic network symbolic probability propagation |
| Title | ASPPLN: Accelerated Symbolic Probability Propagation in Logic Network |
| URI | https://ieeexplore.ieee.org/document/10069628 |
| WOSCitedRecordID | wos000981574300048&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1JSwMxFA62eNCLW8WdHLymZrJOvBVp8VCGgar0VjJZoAenUluh_94kM9ZePHgLgUB4Wb73XvJ9D4B7bIJT7bMMSaEqxDz3SGunEKbeCqN4xZN88dtYFkU-naqyJasnLoxzLn0-c_3YTG_5dmHWMVUWTjgWSpC8AzpSioastU2oRNdfxs3XRluhQ7RaPhnjD5QnZ6NPQ0DEYrnqnWIqCUtGR_-cxTHo_bLyYLnFmxOw5-pTcLgjKHgGhoNJWY6LRzgwJuBJlIGwcLJ5r6L6bxxcNbLcm9gOV0laFjivYSy5bGDR_AnvgdfR8OXpGbWFEpAmLF8hVjHvhLVEWyytVDaqlnnqc00VD04NybTzXhqtrScGMy8Y15kOoJW7GL_Qc9CtF7W7ANARrYUJwO8dZdjLCksvLbGMG0sl05egFy0y-2i0MGY_xrj6o_8aHJBIGAi3PVE3oLtart0t2Ddfq_nn8i6t4Del45sr |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1JSwMxFA5aBfXiVnF3Dl6nZrJOvBWxVByHgVbprWSyQA9OpbZC_71JZqy9ePAWAoHwsnzvveT7HgC3UDmn2iZJzJkoY2KpjaU0IobYaqYELWmQL37LeJ6no5EoGrJ64MIYY8LnM9PxzfCWr6dq4VNl7oRDJhhKN8EWJQTBmq61Sql455_77dfEW66DNWo-CaF3mAZ3o4NdSER8weq1cioBTXr7_5zHAWj_8vKiYoU4h2DDVEdgb01S8Bg8dgdFkeX3UVcphyheCEJHg-V76fV__eCyFuZe-ra7TMLCRJMq8kWXVZTXv8Lb4LX3OHzox02phFgiks5jUhJrmNZIasg1F9rrlllsU4kFdW4NSqSxlisptUUKEssIlYl0sJUaH8HgE9CqppU5BZFBUjLloN8aTKDlJeSWa6QJVRpzIs9A21tk_FGrYYx_jHH-R_8N2OkPX7Jx9pQ_X4Bd5OkD7u5H4hK05rOFuQLb6ms--Zxdh9X8BupDnnI |
| 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=2022+IEEE%2FACM+International+Conference+On+Computer+Aided+Design+%28ICCAD%29&rft.atitle=ASPPLN%3A+Accelerated+Symbolic+Probability+Propagation+in+Logic+Network&rft.au=Xiao%2C+Weihua&rft.au=Qian%2C+Weikang&rft.date=2022-10-29&rft.pub=ACM&rft.eissn=1558-2434&rft.spage=1&rft.epage=9&rft_id=info:doi/10.1145%2F3508352.3549456&rft.externalDocID=10069628 |