Combinatorial Logic

This article is 'not' about combinatory logic, a topic in mathematical logic.
In digital circuit theory, combinatorial logic (also called combinational logic) is a type of logic circuit whose output is a function of only the present input. 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 combinatorial logic does not. Combinatorial logic is used in computer circuits to do boolean algebra on input signals and on stored data. Practical computer circuits normally contain a mixture of combinatorial and sequential logic. For example, the part of an arithmetic logic unit, or ALU, that does mathematical calculations is made from combinatorial logic, although the ALU is controlled by a sequencer that is made from sequential logic.

 

<< PreviousWord BrowserNext >>
cooperative
wiping (magnetic tape)
co op
antigonus i monophthalmus
rug making
perseus of macedon
michael curtiz
banner
elsa beskow
carl oscar borg
percy barnevik
carl michael bellman
ingvar carlsson
saint birgitta
fredrika bremer
chteau de montreuil bellay
nemesis (mythology)
nemesis (star)
jussi bjrling
battle of pydna
flag of south africa
morton feldman
bundesliga
hms invincible
howard waldrop
list of australians
mit opencourseware
sequential logic
dieva deli
dievini
janis
jumis
juras mate
lauku mate
trillian (instant messenger)
lopu mate
majas gars
mness
a bridge too far
icab
meza mate
meza virs
frustum
perun