Bound Set Selection and Circuit Re-Synthesis for Area/Delay Driven Decomposition

This paper addresses two problems related to disjoint-support decomposition of Boolean functions. First, we present a heuristic for finding a subset of variables, X, which results in the disjoint-support decomposition f(X, Y) = h(g(X), Y) with a good area/delay trade-off. Second, we present a techni...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Design, Automation and Test in Europe S. 430 - 431
Hauptverfasser: Martinelli, Andres, Dubrova, Elena
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: Washington, DC, USA IEEE Computer Society 07.03.2005
IEEE
Schriftenreihe:ACM Conferences
Schlagworte:
Algorithm design and analysis
Binary decision diagrams
Boolean functions
Circuit synthesis
Computer science
Computing methodologies > Artificial intelligence > Search methodologies > Heuristic function construction
Computing methodologies > Symbolic and algebraic manipulation > Symbolic and algebraic algorithms > Algebraic algorithms
Data structures
Datavetenskap
Delay
Delay circuits
Electric network analysis
Electric variables control
Hardware > Electronic design automation > Logic synthesis > Circuit optimization
Hardware > Electronic design automation > Physical design (EDA) > Partitioning and floorplanning
Hardware > Hardware validation
Heuristic methods
Information technology
Informationsteknik
Input variables
Logic circuits
Problem solving
Set theory
TECHNOLOGY
TEKNIKVETENSKAP
ISBN:9780769522883, 0769522882
ISSN:1530-1591
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper addresses two problems related to disjoint-support decomposition of Boolean functions. First, we present a heuristic for finding a subset of variables, X, which results in the disjoint-support decomposition f(X, Y) = h(g(X), Y) with a good area/delay trade-off. Second, we present a technique for re-synthesis of the original circuit implementing f(X, Y) into a circuit implementing the decomposed representation h(g(X), Y). Preliminary experimental results indicate that the proposed approach has a significant potential.
Bibliographie:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:9780769522883
0769522882
ISSN:1530-1591
DOI:10.1109/DATE.2005.83