Professional Documents
Culture Documents
UNIT - I
Digital Fundamentals
Boolean Laws
The laws of Boolean algebra are similar in some ways to those of standard algebra, but in
some cases Boolean laws are unique. This is because when logic is applied to digital
circuits, any variable such as A can only have two values 1 or 0, whereas in standard
algebra A can have many values.
Associative Laws
The order of calculation can be changed without affecting the result (Change which
terms are in brackets, or remove brackets). Note: This is only OK so long as all signs (+
or •) are the same.
2a. Boolean addition (OR): (A+B)+C = A+(B+C) = A+B+C
2b. Boolean Multiplication (AND): (A•B)•C = A•(B•C) = A•B•C = ABC
Identity Elements
Rule 4b, shows that the Identity Element for the OR operator is 0, and any
variable (e.g. A) ORed with 0 it retains its identity.
4a. A•1 = A
4b. A+0 = A
15/10/2023 Fall 2020 - ECE 211 Digital Electronics 29
5a and 5b show how by ‘forcing the Identity Element’, (in B
column of the truth tables) to the opposite states to those
used in 4a and 4b, produces an output that is the same as the
Identity Element.
5a. A•0 = 0
5b. A+1 = 1
Reduction
8a. When a single variable (A) is ANDed with itself OR a
second variable (A+B), the result is equal to the single
variable.
8a A•(A+B) = A
Law 1.
A + B = A • B Inverting the inputs to an OR gate
changes its function to NAND.
Law 2.
A • B = A + B Inverting the inputs to an AND gate
changes its function to NOR
A (A + B) = A
A + A ' B = A+B
A ( A ' + B ) = AB
Demorgan’s Laws
(A + B) ' = A ' . B '
(i) C+ BC+ A
= C ( + B) + + A
= C+A
(ii) AB + B + BC
= AB + B + BC (A + )
= AB+ B + ABC + B C
= AB (1+C) + B (1+C)
= AB + B
=B (A+ )
=B
E.g.:
=( ).
= (A+B+C) (+B+ )
(ii) Dual of is = ( + +
(i) =
=+
= (+ + [C
= (+ + C (A+ )
(ii) Dual of = (A+B) + + C)
Complement each literal = (+ ) + C (A+ )
10001
15/10/2023 Fall 2020 - ECE 211 Digital Electronics 47
Contd….
Perform the following subtraction by using 1’ s
complement method
(ii) 1010-11011
Step-1 Equating the number of digits
01010-11011
Step 2
1’s Complement of 11011= 00100
Step 3
Minuend = 01010
1’s Complement of 11011= 00100
= 01110
The above sum does not produce a carry, again take
1’s complement to result of above sum.
1’s complement of 01110 = 10001
1010-11011= - 10001
15/10/2023 Fall 2020 - ECE 211 Digital Electronics 48
Contd….
Example: 1’ s complement:
+6 0000110 - 6 1111001 + 6 0000110 -6 1111001
+9 0001001 + 9 0001001 - 9 1110110 -9 1110110
+ 15 0001111 +2 (1)0000010 -3 1111100 -16 (1) 1101111
Carry +1 1 carry +1
+3 0000011 (-15) 1110000
Example: 2’ s complement:
M and m Relationship
if f = f (A,B,C) = m3 + m4 + m5 + m6 + m7
• f ' = (m3 + m4 + m5 + m6 + m7) ' = m'3 m'4 m'5 m'6 m'7
= M3M4M5M6M7
= a'b'+a'd + acd'
= a'b' (c+c')(d+d') + a'd(b+b')(c+c') + acd' (b+b')
= a'b'c'd'+ a'b'c'd + a'b'cd' +a'b'cd + a'bc'd + a'bcd + abcd'+ab'cd'
= Σm(0,1,2,3,5,7,10,14)
In the coding, when numbers, letters or words are represented by a specific group of
symbols, it is said that the number, letter or word is being encoded. The group of
symbols is called as a code. The digital data is represented, stored and transmitted as
group of binary bits. This group is also called as binary code. The binary code is
represented by the number as well as alphanumeric letter.
Weighted binary codes are those binary codes which obey the positional
weight principle. Each position of the number represents a specific
weight. Several systems of the codes are used to express the decimal
digits 0 through 9. In these codes each decimal digit is represented by a
group of four bits.
Non-Weighted Codes
In this type of binary codes, the positional weights are not assigned. The
examples of non-weighted codes are Excess-3 code and Gray code.
15/10/2023 Fall 2020 - ECE 211 Digital Electronics 68
Excess-3 code
The Excess-3 code is also called as XS-3 code. It is non-weighted code used to express
decimal numbers. The Excess-3 code words are derived from the 8421 BCD code words
adding (0011)2 or (3)10 to each code word in 8421. The excess-3 codes are obtained as
follows
Prime Implicants
A group of square or rectangle made up of bunch of adjacent
minterms which is allowed by definition of K-Map are called prime
implicants (PI) i.e. all possible groups formed in K-Map.
Example: