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!

Be the first to leave a comment!