Definitions for combinational logic
This page provides all possible meanings and translations of the word combinational logic
Said of a digital circuit block: that the current outputs are entirely a function of the current inputs, without having a memory a previous inputs or states.
In digital circuit theory, combinational logic is a type of digital logic which is implemented by Boolean circuits, where the output is a pure function of the present input only. This is in contrast to sequential logic, in which the output depends not only on the present input but also on the history of the input. In other words, sequential logic has memory while combinational logic does not. Combinational logic is used in computer circuits to perform Boolean algebra on input signals and on stored data. Practical computer circuits normally contain a mixture of combinational and sequential logic. For example, the part of an arithmetic logic unit, or ALU, that does mathematical calculations is constructed using combinational logic. Other circuits used in computers, such as half adders, full adders, half subtractors, full subtractors, multiplexers, demultiplexers, encoders and decoders are also made by using combinational logic.
Find a translation for the combinational logic definition in other languages:
Select another language:
Discuss these combinational logic definitions with the community:
Use the citation below to add this definition to your bibliography:
"combinational logic." Definitions.net. STANDS4 LLC, 2014. Web. 23 Sep. 2014. <http://www.definitions.net/definition/combinational logic>.