Cover Image
Read Now

Functional Decomposition with Applications to FPGA Synthesis

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

Full description

Bibliographic Details
Main Author: Scholl, Christoph
Format: eBook
Language:English
Published: New York, NY Springer US 2001, 2001
Edition:1st ed. 2001
Subjects:
Symbolic And Algebraic Manipulation
Computer Science
Computer Science / Mathematics
Computer-aided Engineering (cad, Cae) And Design
Electrical And Electronic Engineering
Electrical Engineering
Electronic Circuits
Computer-aided Engineering
Electronic Circuits And Systems
Theory Of Computation
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
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

Similar Items