FUNCTIONAL DECOMPOSITION WITH APPLICATION TO FPGA SYNTHESIS

Organization of the book. The first chapter gives basic definitions and notations for Boolean functions, which are used in the following chapters. Basic notations for circuits and Boolean expressions are also given in the first two sections .. Readers who are familiar with these subjects can skip the first part and use it only for reference when they are in doubt about the exact definitions and notations in the book. Then, Binary Decision Diagrams (Bryant, 1986) for representing completely and incompletely specified Boolean functions are briefly reviewed. The general structure of FPG As and some examples of typical FPGA devices are given in the next section, and finally, the chapter is concluded by some theoretical considerations about the complexity of Boolean functions to clarify what algorithms for logic synthesis can accomplish and what they cannot be expected to do.