DLD

OR Gate

The OR gate is a digital logic gate that implements logical disjunction – it behaves according to the truth table to the right. A HIGH output (1) results if one or both the inputs to the gate are HIGH (1). If neither input is HIGH, a LOW output (0) results. The expression X = A …

OR Gate Read More »

Truth Tables

A truth table is a mathematical table used in logic — specifically in connection with Boolean algebra, Boolean functions, and propositional calculus — to compute the functional values of logical expressions on each of their functional arguments, that is, on each combination of values taken by their logical variables. In particular, truth tables can be used to …

Truth Tables Read More »

Logic Gates Timing Diagram

Logic Gates Timing Diagram The operation of a logic gate can also be represented with a timing diagram. Images below shows the output that results from three binary input signals for an AND gate, OR gate, and XOR gate respectively. Remember that the AND gate outputs a one only if all its inputs equal one, the OR gate outputs a one if any input equals …

Logic Gates Timing Diagram Read More »

Introduction to Boolean algebra

Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole. It resembles the algebra of real numbers as taught in high school, but with the numeric operations of multiplication xy, addition x + y, and negation -x replaced, respectively, by the logical operations of conjunction x?y, disjunction x?y, and …

Introduction to Boolean algebra Read More »

Boolean algebra Symbols

Boolean algebra Symbols Analogous behavior can be shown between Boolean algebra and mathematical algebra, and as a result, similar symbols and syntax can be used. For example, the following expressions hold true in math. This looks like the AND function allowing an analogy to be drawn between the mathematical multiply and the Boolean AND functions. …

Boolean algebra Symbols Read More »

Laws & Rules of Boolean algebra

Laws & Rules of Boolean algebra The manipulation of algebraic expressions is based on fundamental laws. Some of these laws extend to the manipulation of Boolean expressions. For example, the commutative law of algebra which states th at the result of an operation is the same regardless of the order of operands holds true for Boolean algebra too. This is shown …

Laws & Rules of Boolean algebra Read More »

De-Multiplexers

De-Multiplexers The previous section described how multiplexers select one channel from a group of input channels to be sent to a single output. Demultiplexers take a single input and select one channel out of a group of output channels to which it will route the input. It’s like having multiple printers connected to a computer. A document can only …

De-Multiplexers Read More »

Scroll to Top