Abstract
A combinational circuit consists of gates representing Boolean connectives; it is free of feedback loops. A combinational circuit has no state; its output depends solely on the momentary input values. Examples are the full adder, comparator, decoder and multiplexer. In reality, however, signal changes propagate through a sequence of gates with a finite speed. This is due to the capacitive loads of the amplifying transistors. Hence circuits have a certain propagation delay.
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
© 2001 Springer Basel AG
About this chapter
Cite this chapter
Hardy, Y., Steeb, WH. (2001). Combinational Circuits. In: Classical and Quantum Computing. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8366-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8366-5_5
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-7643-6610-0
Online ISBN: 978-3-0348-8366-5
eBook Packages: Springer Book Archive