ONLINE ELECTRICAL ENGINEERING STUDY SITE

Switching Algebra or Boolean Algebra

Boolean algebra or switching algebra is a system of mathematical logic to perform different mathematical operations in binary system. These are only two elements 1 and 0 by which all the mathematical operations are to be performed. There only three basis binary operations, AND, OR and NOT by which all simple as well as complex binary mathematical operations are to be done. There are many rules in Boolean algebra by which those mathematical operations are done.In Boolean algebra, the variables are represented by English Capital Letter like A, B, C etc and the value of each variable can be either 1 or 0, nothing else. Some basic logical Boolean operations- AND operation, OR operation, Not operation,

Some basic laws for Boolean Algebra, A . 0 = 0 where A can be either 0 or 1. A . 1 = A where A can be either 0 or 1. A . A = A where A can be either 0 or 1. A . Ā = 0 where A can be either 0 or 1. A + 0 = A where A can be either 0 or 1. A + 1 = 1 where A can be either 0 or 1. A + Ā = 1 A + A = A A + B = B + A where A and B can be either 0 or 1. A . B = B . A where A and B can be either 0 or 1. The laws of Boolean algebra are also true for more than two variables like,

Cumulative Laws for Boolean Algebra

cumulative laws for boolean algebra

Associative Laws for Boolean Algebra

associative laws for boolean algebra

Distributive Laws for Boolean Algebra

distributive laws for boolean algebra

Redundant Literal Rule

redundant literal rule From truth table,
Inputs Output
ABĀBA + ĀB
0000
0111
1001
1101
Inputs Output
ABA+B
000
011
101
111
From truth table it is proved that,

Absorption Laws for Boolean Algebra

Proof from truth table,
Inputs Output
ABABA+A.B
0000
0100
1001
1111
Both A and A+A.B column is same. Proof from truth table,
ABA+BA.X(A+B)
0000
0110
1011
1111
Both A and A.X or A(A+B) column are same. De Morgan’s Therem, Proof from truth table,

Examples of Boolean Algebra

These are another method of simplifying complex Boolean expression. In this method we only use three simple steps.
  1. Complement entire Boolean expression.
  2. Change all ORs to ANDs and all ANDs to ORs.
  3. Now, complement each of the variable and get final expression.
By this method, will be first complemented, i.e..Now, change all (+) to (.) and (.) to (+) i.e.Now, complement each of the variable,This is the final simplified form of Boolean expression, And it is exactly equal to the results which have been come by applying De Morgan Theorem. Another example, By Second Method, Representation of Boolean function in truth table. Let us consider a Boolean function, Now let us represent the function in truth table.

Closely Related Articles Digital ElectronicsBoolean Algebra Theorems and Laws of Boolean AlgebraDe Morgan Theorem and Demorgans LawsTruth Tables for Digital LogicBinary Arithmetic Binary AdditionBinary SubtractionSimplifying Boolean Expression using K MapBinary DivisionExcess 3 Code Addition and SubtractionK Map or Karnaugh MapBinary MultiplicationParallel SubtractorMore Related Articles Binary Adder Half and Full AdderBinary SubstractorSeven Segment DisplayBinary to Gray Code Converter and Grey to Binary Code ConverterBinary to BCD Code ConverterAnalog to Digital ConverterDigital Encoder or Binary EncoderBinary DecoderBasic Digital CounterDigital ComparatorBCD to Seven Segment DecoderParallel AdderParallel Adder or SubtractorMultiplexerDemultiplexer555 Timer and 555 Timer WorkingOR Operation | Logical OR OperationAND Operation | Logical AND OperationLogical OR GateLogical AND GateNOT GateUniversal Gate | NAND and NOR Gate as Universal GateNAND GateDiode and Transistor NAND Gate or DTL NAND Gate and NAND Gate ICsX OR Gate and X NOR GateTransistor Transistor Logic or TTLNOR GateFan out of Logic GatesINHIBIT GateNMOS Logic and PMOS LogicSchmitt GatesLogic Families Significance and Types of Logic FamiliesBinary Number System | Binary to Decimal and Decimal to Binary ConversionBinary to Decimal and Decimal to Binary ConversionBCD or Binary Coded Decimal | BCD Conversion Addition SubtractionBinary to Octal and Octal to Binary ConversionOctal to Decimal and Decimal to Octal ConversionBinary to Hexadecimal and Hex to Binary ConversionHexadecimal to Decimal and Decimal to Hexadecimal ConversionGray Code | Binary to Gray Code and that to Binary ConversionOctal Number SystemDigital Logic Gates2′s Complement1′s ComplementASCII CodeHamming Code2s Complement ArithmeticError Detection and Correction Codes9s complement and 10s complement | SubtractionSome Common Applications of Logic GatesKeyboard EncoderAlphanumeric codes | ASCII code | EBCDIC code | UNICODELatches and Flip FlopsS R Flip Flop S R LatchActive Low S R Latch and Flip FlopGated S R Latches or Clocked S R Flip FlopsD Flip Flop or D LatchJ K Flip FlopMaster Slave Flip FlopRead Only Memory | ROMProgrammable Logic DevicesProgrammable Array LogicApplication of Flip FlopsShift RegistersBuffer Register and Controlled Buffer RegisterData Transfer in Shift RegistersSerial In Serial Out (SISO) Shift RegisterSerial in Parallel Out (SIPO) Shift RegisterParallel in Serial Out (PISO) Shift RegisterParallel in Parallel Out (PIPO) Shift RegisterUniversal Shift RegistersBidirectional Shift RegisterDynamic Shift RegisterApplications of Shift RegistersUninterruptible Power Supply | UPSConversion of Flip FlopsNew Articles Water MeterAir MeterDigital PotentiometersBasic Construction of Wind TurbineCharacteristics of Sensors