Abstract
The first chapter gives basic definitions and notations for Boolean functions. These notations will be used in the following chapters. The main representations for Boolean functions introduced in this chapter are Ω-circuits (which are simply circuits based on a cell library Ω) and robdds. fpgas (Field Programmable Gate Arrays) are special classes of Ω-circuits.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A graph G = (V, E) is called node oriented, if for all nodes y E V there is an order for the incoming edges and an order for the outgoing edges.
The notation gip is defined for each (completely or) incompletely specified function g E BPn,m(D’) with D’ D D and means the function gID E BPn,m(D) with glD(e) = g(E) for all e E D.
4Here we give on overview of the architecture of FPGAS. More details (also on the physical implementation of FPGAS) can be found in (Brown et al., 1992) or (Brown and Vranesic, 2000 ).
Equivalent gates is a commonly used measure and means the total number of two—input nand gates that would be needed to build the circuit. This measure is used to give a rough estimate of the complexity of the circuit.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Scholl, C. (2001). Realizations of Boolean Functions. In: Functional Decomposition with Applications to FPGA Synthesis. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3393-8_1
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3393-8_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4929-5
Online ISBN: 978-1-4757-3393-8
eBook Packages: Springer Book Archive