Overview
Gates are circuit components representing the elementary Boolean operations of negation, conjunction (and), and disjunction (or). Combinational circuits are trees of gates, thus implementing general Boolean functions. Some reasonably simple functions — and therefore patterns of gates — occur very frequently in practical use. Among them are the decoder, the multiplexer, the adder and — to a lesser degree — the multiplier. But also the important read-only memory (ROM) fails into the class of combinational 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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wirth, N. (1995). Combinational Circuits. In: Digital Circuit Design for Computer Science Students. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-57780-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-57780-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58577-0
Online ISBN: 978-3-642-57780-2
eBook Packages: Springer Book Archive