Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Overview
This consistently written book provides a comprehensive presentation of a multitude of results stemming from the author's as well as various researchers' work in the field. It also covers functional decomposition for incompletely specified functions, decomposition for multi-output functions and non-disjoint decomposition.
Synopsis
This book treats functional decomposition, a technique used in automatic logic synthesis for field programmable gate arrays (FPGAs). Early chapters give basic definitions and notations for Boolean functions and cover minimization of binary decision diagrams. Later chapters examine the basic method for decomposing a single-output Boolean function, deal with functional decomposition of multi-output functions, and present an extension of the method to incompletely specified functions. Final chapters review non-disjoint decompositions and discuss very large circuits in combination with functional decomposition techniques. Background in mathematics, complexity theory, and graph theory is assumed. Material is of interest to researchers and advanced students in logic synthesis, VLSI CAD, and design automation, as well as professionals working in FPGA design and the development of algorithms for FPGA synthesis. Scholl teaches computer science at Albert Ludwigs University, Germany. Annotation c. Book News, Inc., Portland, OR (booknews.com)