Overview

Field Programmable Gate Arrays (FPGAs) offer millions of system gates at low cost and considerable speed. Functional decomposition has emerged as an essential technique in automatic logic synthesis for FPGAs. Functiona l decomposition as a technique to find realizations for Boolean functions was already introduced in the late 50s and early 60s by Ashenhurst, Curtis, Roth and Karp. It has attracted a great deal of renewed attention, for several reasons. First, it is especially well suited for the synthesis of lookup-table based FPGAs. Also, the increased capacities of today's computers as well as the development of new methods have made the method applicable to larger-scale problems. Modern techniques for functional decomposition profit from the success of Reduced Ordered Binary Decision Diagrams (ROBDDs), data structures that provide compact representations for many Boolean functions occurring in practical applications. We have now seen the development of algorithms for functional decomposition which work directly based on ROBDDs, so that the decomposition algorithm works based on compact representations and not on function tables or decomposition matrices as in previous approaches. The book presents, in a consistent manner, a comprehensive presentation of a multitude of results stemming from the author's as well as various researchers' work in the field. Apart from the basic method, it also covers functional decomposition for incompletely specified functions, decomposition for multi-output functions and non-disjoint decomposition. This bok should be of interest both 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.

Full Product Details

Author:   Christoph Scholl
Publisher:   Springer
Imprint:   Springer
Edition:   2002 ed.
Dimensions:   Width: 15.60cm , Height: 1.70cm , Length: 23.40cm
Weight:   1.300kg
ISBN:  

9780792375852

ISBN 10:   0792375858
Pages:   264
Publication Date:   31 October 2001
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

1. Realizations of Boolean Functions.- 2. Minimization of BDDs.- 3. Functional Decomposition for Completely Specified Single-Output Functions.- 4. Functional Decomposition for Completely Specified Multi-Output Functions.- 5. Functional Decomposition for Incompletely Specified Functions.- 6. Non-Disjoint Decompositions.- 7. Large Circuits.- Appendices.- An example for an FPGA device.- Complexity of CM.- Characterization of weak and strong symmetry.- Complexity of MSP.- Making a function strongly symmetric.- Compatibility of don’t care minimization methods.- Symmetries and decomposability.- Complexity of CDF.- ROBDD based computation of compatibility classes.- Maximal don’t care sets.

Reviews

'It is an excellent book. I suppose that it is of interest to researchers, advanced students, and professionals working in electronic design automation.' Zentral Blatt Mathematik, 989 (2002)

'It is an excellent book. I suppose that it is of interest to researchers, advanced students, and professionals working in electronic design automation.' Zentral Blatt Mathematik, 989 (2002)

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions