Home  www.playhookey.com  Wed, 05232018 

Direct Current

Alternating Current

Semiconductors

Digital

Logic Families

Digital Experiments

Computers

 Analog  Analog Experiments  Oscillators  Optics  HTML Test  

 Combinational Logic  Sequential Logic  Alternate FlipFlop Circuits  Counters  Registers  The 555 Timer   

Basic Gates

Derived Gates

The XOR Function

Boolean Algebra

Binary Addition

Negative Numbers and Binary Subtraction

 TwoInput Multiplexer  FourInput Multiplexer  OnetoTwo Line Decoder/Demultiplexer  TwotoFour Line Decoder/Demultiplexer  
Boolean Algebra 

One of the primary requirements when dealing with digital circuits is to find ways to make them as simple as possible. This constantly requires that complex logical expressions be reduced to simpler expressions that nevertheless produce the same results under all possible conditions. The simpler expression can then be implemented with a smaller, simpler circuit, which in turn saves the price of the unnecessary gates, reduces the number of gates needed, and reduces the power and the amount of space required by those gates.
One tool to reduce logical expressions is the mathematics of logical expressions, introduced by George Boole in 1854 and known today as Boolean Algebra. The rules of Boolean Algebra are simple and straightforward, and can be applied to any logical expression. The resulting reduced expression can then be readily tested with a Truth Table, to verify that the reduction was valid.
The rules of Boolean Algebra are:.
0·0 = 0 A·0 = 0 1·0 = 0 A·1 = A 0·1 = 0 A·A = A 1·1 = 1 A·A' = 0
0+0 = 0 A+0 = A 1+0 = 1 A+1 = 1 0+1 = 1 A+A = A 1+1 = 1 A+A' = 1
0' = 1 A'' = A 1' = 0
(A·B)·C = A·(B·C) = A·B·C (A+B)+C = A+(B+C) = A+B+C
A·(B+C) = (A·B) + (A·C) A+(B·C) = (A+B) · (A+C)
A·B = B·A A+B = B+A
AB = A·B A·B+C = (A·B) + C A+B·C = A + (B·C)
(A·B)' = A' + B' (NAND) (A+B)' = A' · B' (NOR)


 
All pages on www.playhookey.com copyright © 1996, 20002015 by
Ken Bigelow Please address queries and suggestions to: webmaster@playhookey.com 