Scribd
Upload
41 views4 pages

Boolean Algebra

Digital circuits use two voltage levels, high and low, to represent binary values of 1 and 0. Boolean algebra provides a mathematical model for analyzing and simplifying digital circuits. Combinational circuits have outputs that depend only on inputs, while sequential circuits have memory and outputs depend on both inputs and the current state. Boolean algebra defines operations like AND, OR, and NOT on binary values of true and false. It also establishes precedence rules and theorems for simplifying logical expressions and converting between standard forms like sum-of-products and product-of-sums.

Uploaded by

망토
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
41 views4 pages

Boolean Algebra

Digital circuits use two voltage levels, high and low, to represent binary values of 1 and 0. Boolean algebra provides a mathematical model for analyzing and simplifying digital circuits. Combinational circuits have outputs that depend only on inputs, while sequential circuits have memory and outputs depend on both inputs and the current state. Boolean algebra defines operations like AND, OR, and NOT on binary values of true and false. It also establishes precedence rules and theorems for simplifying logical expressions and converting between standard forms like sum-of-products and product-of-sums.

Uploaded by

망토
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Boolean Algebra

Digital Circuits

 Two voltage levels


o High/true/1/asserted
o Low/false/0/deasserted
 Advantages
o More reliable (simpler circuits, less noise-prone)
o Specified accuracy (determinable)
o Abstraction can be applied using simple mathematical model – Boolean Algebra
o Ease design, analysis and simplification of digital circuit – Digital Logic Design
 Combinational : No memory, output depends solely on the input
o Gates
o Decoders, multiplexers
o Adders, multipliers
 Sequential: With memory, output depends on both input and current state
o Counters, registers
o Memories

Boolean Values

 True (T or 1)
 False (F or 0)

Connectives

 Conjunction (AND)
o A.B
 Disjunction (OR)
o A+B
 Negation (NOT)
o A’

Precedence of Operations

 From Highest to Lowest


o 1. Not
o 2. And
o 3. Or
 Parenthesis () overwrites precedence
Laws of Boolean Algebra

Duality

 If the AND/OR operators and identity elements 0/1 in a Boolean equation are interchanged,
it remains valid.
o E.g
 a + (b . c) = (a + b). (a + c) is a . (b + c) = (a . b) + (a . c)

Theorems
Boolean Functions

Complement Functions

 Given a Boolean function F, the complement of F is denoted as F’


o Obtained by interchanging 1 with 0 in the function’s output values

Literals

 Refers to a Boolean variable on its own or in its complemented form


 E.g. : x, x’, y, y’

Product Term

 Refers to a single literal or a logical product (AND) of several literals.


 E.g. x, x.y.z’, A’.B

Sum Term

 Refers to a single literal or a logical sum (OR) of several literals.

Standard Forms

 Sum-of-Products (SOP)
o Refers to a product term or a logical sum (OR) of several product terms.
o (B.C) + (A.B)
 Product-of-Sums (POS)
o Refers to a sum term or a logical product (AND) of several sum terms
o (A+B) . (B+C)

Minterm

 A minterm of n variables is a product term that contains n literals from all the variables
 With n variables, we have up to 2^n terms

Maxterm

 A maxterm of n variables is a sum term that contains n literals from all the variables
 With n variables, we have up to 2^n terms
Minterms and Maxterms

 Note:
o Each minterm is the complement of its corresponding maxterm. Likewise, each
maxterm is the complement of it corresponding minterm.

Converting Minterm and Max Terms

 Notation is Expressed as Binary


 Minterm
o A’ = 0 and A = 1
 Maxterm
o A = 0 and A’ = 1

Canonical Forms

 Sum of Minterms = Canonical sum-of-products


 Product of Maxterms = Canonical product-of-sums

Sum of Minterms

 Obtained by gathering the minterms of the function (where output is 1)

Product-of-Maxterms

 Obtained by gathering the maxterms of the function (where the output is 0)

Conversion of Standard Forms

 Find the list of complementary numbers to convert between sum-of-Minterms and product-
of-maxterms

You might also like