Free Delivery Over $100
|
|
|||
|
||||
OverviewDuring the last few years Field Programmable Gate Arrays (FPGAs) have become increasingly important. Thanks to recent breakthroughs in technology, 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. Functional decomposition as a technique to find realizations for Boolean functions was already introduced in the late fifties and early sixties by Ashenhurst, Curtis, Roth and Karp. In recent years, however, 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. Functional Decomposition with Application to FPGA Synthesis will 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 developmentof algorithms for FPGA synthesis. Full Product DetailsAuthor: Christoph SchollPublisher: Springer-Verlag New York Inc. Imprint: Springer-Verlag New York Inc. Edition: Softcover reprint of hardcover 1st ed. 2002 Dimensions: Width: 15.50cm , Height: 1.50cm , Length: 23.50cm Weight: 0.454kg ISBN: 9781441949295ISBN 10: 1441949291 Pages: 264 Publication Date: 03 December 2010 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Out of stock  The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available. Table of Contents1. 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) '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 InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
