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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Design, Automation and Test in Europe s. 430 - 431
Hlavní autoři:	Martinelli, Andres, Dubrova, Elena
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	Washington, DC, USA IEEE Computer Society 07.03.2005 IEEE
Edice:	ACM Conferences
Témata:	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
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!

Buďte první, kdo okomentuje tento záznam!