Boolean Algebra
Boolean Algebra
Boolean Algebra
Week-5, Lecture-1
Boolean Algebra
Sneh Saurabh
29th August, 2018
Digital Circuits: Announcements/Revision
Number System
The position of the coefficients determines the power of 10 that the coefficient must be
multiplied
𝑎4 𝑎3 𝑎2 𝑎1 𝑎0 . 𝑎−1 𝑎−2
= 𝑎4 × 104 + 𝑎3 × 103 + 𝑎2 × 102 + 𝑎1 × 101 + 𝑎0 × 100 + 𝑎−1 × 10−1 + 𝑎−2 × 10−2
Example: 72451.29
= 7 × 104 + 2 × 103 + 4 × 102 + 5 × 101 + 1 × 100 + 2 × 10−1 + 9 × 10−2
The position of the coefficients determines the power of 2 that the coefficient must be multiplied
𝑎3 𝑎2 𝑎1 𝑎0 . 𝑎−1 𝑎−2
= 𝑎3 × 23 + 𝑎2 × 22 + 𝑎1 × 21 + 𝑎0 × 20 + 𝑎−1 × 2−1 + 𝑎−2 × 2−2
Example: (1101.11)2
= (1 × 23 + 1 × 22 + 0 × 21 + 1 × 20 + 1 × 2−1 + 1 × 2−2 )10
= (8 + 4 + 1 + 0.5 + 0.25)10 = (13.75)10
The position of the coefficients determines the power of 𝑟 that the coefficient must be multiplied
(𝑎4 𝑎3 𝑎2 𝑎1 𝑎0 . 𝑎−1 𝑎−2 )𝑟
= 𝑎4 × 𝑟 4 + 𝑎3 × 𝑟 3 + 𝑎2 × 𝑟 2 + 𝑎1 × 𝑟1 + 𝑎0 × 𝑟 0 + 𝑎−1 × 𝑟 −1 + 𝑎−2 × 𝑟 −2
Example: (213.2)8
= (2 × 82 + 1 × 81 + 3 × 80 + 2 × 8−1 )10 = (128 + 8 + 3 + 2 × 0.125)10 = (139.25)10
Problem:
Solution:
(𝐹𝐴)16 = (15 × 161 + 10 × 160 )10 = (250)10
Conversion of integer is done and conversion of fraction is done, and both results are
combined
Integer part
Divide the number and all successive quotients by 𝑟 and accumulate the remainders.
Convert the binary number (10011001)2 Convert the binary number (10011001)2 into
into octal (𝑟 = 8) hexadecimal (𝑟 = 16)
Replace each group with corresponding Replace each group with corresponding
octal digit hexadecimal digit
Add extra zeroes on the left of MSB to Add extra zeroes on the left of MSB to make
make the number of digits as multiple of the number of digits as multiple of four
three
(1001 1001)2
(010 011 001)2
= (9 9)16
= (2 3 1)8
Problem:
Integer Fraction
Convert the decimal number 0.6875 × 2 1 0.375
(0.6875)10 into binary (𝑟 = 2)
0.375 × 2 0 0.75
0.75 × 2 1 0.5
Answer:
(0.6875)10 = (0.1011)2 0.5 × 2 1 0
Problem:
Answer:
Convert the decimal number (153.6875)10 = (10011001.1011)2
(153.6875)10 into binary (𝑟 = 2)
Arithmetic Operations
= 𝑐𝑖 ′(𝑥𝑖 ⊕ 𝑦𝑖 ) + 𝑐𝑖 (𝑥𝑖 ⊕ 𝑦𝑖 )′
= 𝑥𝑖 ⊕ 𝑦𝑖 ⊕ 𝑐𝑖
𝑐𝑖+1 = 𝑥𝑖 𝑦𝑖 + 𝑥𝑖 𝑐𝑖 + 𝑦𝑖 𝑐𝑖
Full Adder Circuit
To add two unsigned numbers, circuit is designed similar to what is done in hand-calculation
Least Significant Bit (LSB) is on the right and Most Significant Bit (MSB) is on the left
Signed Numbers