Scribd
Upload
17 views18 pages

Semiconductor

The document discusses the I-V characteristics of LEDs and provides an overview of the Laws of Boolean Algebra, which are essential for simplifying logic operations in digital circuits. It outlines various laws such as the Annulment Law, Identity Law, and De Morgan's Theorems, along with their mathematical expressions. Additionally, it mentions Boolean functions and the representation of simple logic gates.

Uploaded by

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

Semiconductor

The document discusses the I-V characteristics of LEDs and provides an overview of the Laws of Boolean Algebra, which are essential for simplifying logic operations in digital circuits. It outlines various laws such as the Annulment Law, Identity Law, and De Morgan's Theorems, along with their mathematical expressions. Additionally, it mentions Boolean functions and the representation of simple logic gates.

Uploaded by

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

Wednesday, 3 January 2024 7:58 PM

Semiconductor Page 1
Semiconductor Page 2
Semiconductor Page 3
Semiconductor Page 4
I-V characteristics of LED

Semiconductor Page 5
Semiconductor Page 6
Semiconductor Page 7
(A) 13ohm (B) 13.3 ohm (C ) 10 ohm (D) 12ohm

Semiconductor Page 8
Semiconductor Page 9
Semiconductor Page 10
Semiconductor Page 11
Semiconductor Page 12
Laws of Boolean Algebra

A set of rules or Laws of Boolean Algebra expressions have been invented to help reduce the number of logic gates needed to
perform a particular logic operation resulting in a list of functions or theorems known commonly as the Laws of Boolean
Algebra.

As well as the logic symbols “0” and “1” being used to represent a digital input or output, we can also use them as constants
for a permanently “Open” or “Closed” circuit or contact respectively.

Boolean Algebra is the mathematics we use to analyse digital gates and circuits. We can use these “Laws of Boolean” to both
reduce and simplify a complex Boolean expression in an attempt to reduce the number of logic gates required. Boolean
Algebra is therefore a system of mathematics based on logic that has its own set of rules or laws which are used to define and
reduce Boolean expressions.

The variables used in Boolean Algebra only have one of two possible values, a logic “0” and a logic “1” but an expression
can have an infinite number of variables all labelled individually to represent inputs to the expression, For example, variables
A, B, C etc, giving us a logical expression of A + B = C, but each variable can ONLY be a 0 or a 1

Examples of these individual laws of Boolean, rules and theorems for Boolean Algebra are given in the following table.

Semiconductor Page 13
Description of the Laws of Boolean Algebra
• Annulment Law – A term AND‘ed with a “0” equals 0 or OR‘ed with a “1” will equal 1
•
• A.0=0 A variable AND’ed with 0 is always equal to 0
• A+1=1 A variable OR’ed with 1 is always equal to 1
•
• Identity Law – A term OR‘ed with a “0” or AND‘ed with a “1” will always equal that term
•
• A+0=A A variable OR’ed with 0 is always equal to the variable
• A.1=A A variable AND’ed with 1 is always equal to the variable
•
• Idempotent Law – An input that is AND‘ed or OR´ed with itself is equal to that input
•
• A+A=A A variable OR’ed with itself is always equal to the variable

• A.A=A A variable AND’ed with itself is always equal to the variable

• Complement Law – A term AND‘ed with its complement equals “0” and a term OR´ed with its complement equals
“1”
•
• A.A=0 A variable AND’ed with its complement is always equal to 0

• A+A=1 A variable OR’ed with its complement is always equal to 1


•
• Commutative Law – The order of application of two separate terms is not important
•

• A.B=B.A The order in which two variables are AND’ed makes no difference

• A+B=B+A The order in which two variables are OR’ed makes no difference
•
• Double Negation Law – A term that is inverted twice is equal to the original term
•

• A=A A double complement of a variable is always equal to the variable

de Morgan’s Theorem – There are two “de Morgan’s” rules or theorems,


•

Semiconductor Page 14
•
• (1) Two separate terms NOR‘ed together is the same as the two terms inverted (Complement) and AND‘ed for
example: A+B = A . B
•
• (2) Two separate terms NAND‘ed together is the same as the two terms inverted (Complement) and OR‘ed for
example: A.B = A + B

Other algebraic Laws of Boolean not detailed above include:


• Boolean Postulates – While not Boolean Laws in their own right, these are a set of Mathematical Laws which can be used
in the simplification of Boolean Expressions.
•
• 0 . 0 = 0 A 0 AND’ed with itself is always equal to 0
• 1 . 1 = 1 A 1 AND’ed with itself is always equal to 1
• 1 . 0 = 0 A 1 AND’ed with a 0 is equal to 0
• 0 + 0 = 0 A 0 OR’ed with itself is always equal to 0
• 1 + 1 = 1 A 1 OR’ed with itself is always equal to 1
• 1 + 0 = 1 A 1 OR’ed with a 0 is equal to 1
• 1 = 0 The Inverse (Complement) of a 1 is always equal to 0
• 0 = 1 The Inverse (Complement) of a 0 is always equal to 1

• Distributive Law – This law permits the multiplying or factoring out of an expression.
•
• A(B + C) = A.B + A.C (OR Distributive Law)
• A + (B.C) = (A + B).(A + C) (AND Distributive Law)
•
• Absorptive Law – This law enables a reduction in a complicated expression to a simpler one by absorbing like terms.
•
• A + (A.B) = (A.1) + (A.B) = A(1 + B) = A (OR Absorption Law)
• A(A + B) = (A + 0).(A + B) = A + (0.B) = A (AND Absorption Law)
•
• Associative Law – This law allows the removal of brackets from an expression and regrouping of the variables.
•
• A + (B + C) = (A + B) + C = A + B + C (OR Associate Law)
• A(B.C) = (A.B)C = A . B . C (AND Associate Law)

Boolean Algebra Functions


Using the information above, simple 2-input AND, OR and NOT Gates can be represented
by 16 possible functions as shown in the following table.

Semiconductor Page 15
Semiconductor Page 16
Semiconductor Page 17
Semiconductor Page 18

You might also like