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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	16th Brazilian Symposium on Integrated Circuit Design (SBCCI 2003) s. 35
Hlavní autori:	Damiani, Maurizio, Selchenko, Andrei Y.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	Washington, DC, USA IEEE Computer Society 08.09.2003
Edícia:	ACM Conferences
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!