Boolean Technology Mapping Based on Logic Decomposition

The decomposition tree of a logic function first appears in the work of Ashenhurst [1]. It is a canonical [1, 2], tree-like logic network representing the decomposition properties of that function. We present an algorithm for technology mapping based on the use of such trees for the representation o...

Full description

Saved in:
Bibliographic Details
Published in:16th Brazilian Symposium on Integrated Circuit Design (SBCCI 2003) p. 35
Main Authors: Damiani, Maurizio, Selchenko, Andrei Y.
Format: Conference Proceeding
Language:English
Published: Washington, DC, USA IEEE Computer Society 08.09.2003
Series:ACM Conferences
Subjects:
Computing methodologies > Symbolic and algebraic manipulation > Symbolic and algebraic algorithms
Hardware > Integrated circuits > Logic circuits
Mathematics of computing > Discrete mathematics > Graph theory > Graph algorithms
Software and its engineering > Software notations and tools > General programming languages > Language types
Theory of computation > Design and analysis of algorithms
ISBN:076952009X, 9780769520094
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The decomposition tree of a logic function first appears in the work of Ashenhurst [1]. It is a canonical [1, 2], tree-like logic network representing the decomposition properties of that function. We present an algorithm for technology mapping based on the use of such trees for the representation of library elements. Decomposition information is also embedded in the representation of leaf-dags of the subject graph. Because library functions are represented by trees, this approach allows us to combine Boolean matching with ef.cient tree-based matching algorithms. In this way, Boolean matching can now be used not only for incremental optimization, but also for building the initial mapping "from scratch". Finally, we remark that bycombining this method with the one of Lehman et al. we are able to represent implicitly a search space of unprecedented size for a subject graph. The algorithm has been implemented in C++ in a propotype mapper, VERSE, and tested on several common synthesis benchmarks.
AbstractList The decomposition tree of a logic function first appears in the work of Ashenhurst [1]. It is a canonical [1, 2], tree-like logic network representing the decomposition properties of that function. We present an algorithm for technology mapping based on the use of such trees for the representation of library elements. Decomposition information is also embedded in the representation of leaf-dags of the subject graph. Because library functions are represented by trees, this approach allows us to combine Boolean matching with ef.cient tree-based matching algorithms. In this way, Boolean matching can now be used not only for incremental optimization, but also for building the initial mapping 'from scratch'. Finally, we remark that bycombining this method with the one of Lehman et al. we are able to represent implicitly a search space of unprecedented size for a subject graph. The algorithm has been implemented in C++ in a propotype mapper, VERSE, and tested on several common synthesis benchmarks.
Author Damiani, Maurizio
Selchenko, Andrei Y.
Author_xml – sequence: 1
  givenname: Maurizio
  surname: Damiani
  fullname: Damiani, Maurizio
– sequence: 2
  givenname: Andrei Y.
  surname: Selchenko
  fullname: Selchenko, Andrei Y.
BookMark eNqFkD1PwzAURS0BErR0ZM_ERItd27E90vIpBbF0YLNs9zkEEr9QtwP_nqAgMXKXe4ejO5wJOU6YgJALRhdyyLURS031wgg-rCMyoao0ckmpeT0ls5zf6RAhhS7ZGVErxBZcKjYQ3hK2WH8Vz67vm1QXK5dhW2AqKqybUNxCwK7H3OwbTOfkJLo2w-y3p2Rzf7dZP86rl4en9U01d8aoudKyBKWFUkqCjktuQHoagqaKueiFd7ClMXIJpdTMA5eKidJtjWbOeM74lFyOt_0OPw-Q97ZrcoC2dQnwkC1nVJacqwG8GkEXOusRP7Jl1P7osKMOO-qwftdA_Pv9B-ffmtFg9A
ContentType Conference Proceeding
Copyright Copyright (c) 2003 Institute of Electrical and Electronics Engineers, Inc. All rights reserved.
Copyright_xml – notice: Copyright (c) 2003 Institute of Electrical and Electronics Engineers, Inc. All rights reserved.
DBID 7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.5555/942808.943942
DatabaseName 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
DeliveryMethod fulltext_linktorsrc
EndPage 35
Genre Conference Paper
GroupedDBID 6IE
6IK
6IL
AAJGR
AAVQY
ACM
ADPZR
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
GUFHI
IERZE
LHSKQ
OCL
RIB
RIC
RIE
RIL
7SC
8FD
AAWTH
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-a997-7856e7847775e8f239e5b0cc8071afb4baed0ff35e6581be357146ad981a9b313
ISBN 076952009X
9780769520094
IngestDate Fri Jul 11 09:13:43 EDT 2025
Wed Jan 31 06:54:05 EST 2024
Wed Jul 31 05:39:09 EDT 2024
IsPeerReviewed false
IsScholarly false
Language English
LinkModel OpenURL
MeetingName SBCCI03: 16th Symposium on Integrated Circuits and System Design
MergedId FETCHMERGED-LOGICAL-a997-7856e7847775e8f239e5b0cc8071afb4baed0ff35e6581be357146ad981a9b313
Notes SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
PQID 31056337
PQPubID 23500
PageCount 1
ParticipantIDs proquest_miscellaneous_31056337
acm_books_10_5555_942808_943942_brief
acm_books_10_5555_942808_943942
PublicationCentury 2000
PublicationDate 20030908
PublicationDateYYYYMMDD 2003-09-08
PublicationDate_xml – month: 09
  year: 2003
  text: 20030908
  day: 08
PublicationDecade 2000
PublicationPlace Washington, DC, USA
PublicationPlace_xml – name: Washington, DC, USA
PublicationSeriesTitle ACM Conferences
PublicationTitle 16th Brazilian Symposium on Integrated Circuit Design (SBCCI 2003)
PublicationYear 2003
Publisher IEEE Computer Society
Publisher_xml – name: IEEE Computer Society
SSID ssj0000454861
Score 1.3218501
Snippet The decomposition tree of a logic function first appears in the work of Ashenhurst [1]. It is a canonical [1, 2], tree-like logic network representing the...
SourceID proquest
acm
SourceType Aggregation Database
Publisher
StartPage 35
SubjectTerms Computing methodologies -- Symbolic and algebraic manipulation -- Symbolic and algebraic algorithms
Hardware -- Integrated circuits -- Logic circuits
Mathematics of computing -- Discrete mathematics -- Graph theory -- Graph algorithms
Software and its engineering -- Software notations and tools -- General programming languages -- Language types
Theory of computation -- Design and analysis of algorithms
Title Boolean Technology Mapping Based on Logic Decomposition
URI https://www.proquest.com/docview/31056337
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3NT9swFLc2xIHbEKCx8ZEDnKKyuI5j-woCMQkQhx66U2QnjhRBE9QQBPz1vGcnTcsmoR3oIard1FH8s_w-_HvvEXLE9TgWEZejIqFmFCswULTU0JRjakAcF1S5QOErcXMjp1N125W3alw5AVFV8vlZPXwq1NAHYGPo7H_AvRgUOuA7gA5XgB2u7zTifwqf20Vn05__0wRp6C8zJGi1Mzwe-N0nicjDrJxnLZ4eOA-6z18e5ku8jj4BR32PTvvBFR9e6wcXbHUKgjDHUbFucwY7GNLUOy7Y4Aiflb56FPytnZevnv7lmcb3sHCqu3rBryzDPyd-t8MszA0sl-ulyMRVRwVzTCy5YryGfamKnpM6WLORSJRLATVd2k59JpNOMPvG-y2fwwdZHmBGRfJEYaAvSOSvQlAfzLdwuGGuQZlQ77rpHtVlYOrbsU_CikP-WhkQVZds9pe4djrI5BvZHuYgGFDeJF9stUVEB1AwABR0AAUOoKCuAgdQsALQNplcnE_OLkddUYyRxsS5QvLEClAphOBWFmOmLDdRlsFLUF2Y2GibR0XBuAXVkhrLuABZqHMlqVaGUbZD1qq6st9JoODXXIE5DDIvNrFQAu43rJBWxblQ2S45hJdOcWk3KdiKOC2pn5bUT8suOf7gjtTAOilgpH7iUti98EhKV7ZumxSMC54wJn58-KyfZGNYVHtk7XHe2n2ynj09ls38wEH9Bj8OXc8
linkProvider IEEE
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+16th+symposium+on+Integrated+circuits+and+systems+design&rft.atitle=Boolean+Technology+Mapping+Based+on+Logic+Decomposition&rft.au=Damiani%2C+Maurizio&rft.au=Selchenko%2C+Andrei+Y.&rft.series=ACM+Conferences&rft.date=2003-09-08&rft.pub=IEEE+Computer+Society&rft.isbn=076952009X&rft.spage=35&rft.epage=35&rft_id=info:doi/10.5555%2F942808.943942
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769520094/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769520094/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780769520094/sc.gif&client=summon&freeimage=true