LOGIC

CIRCUITS
AND DESIGN
 WHAT IS LOGIC CIRCUITS AND
DESIGN ?

Logic design refers basic organization of the circuitry of a digital computer.

Every digital computer is built on a two-valued logic system that represents
information as either 1 or 0, on or off, yes or no. In computing systems, this
binary code serves as the foundation for digital data representation and
processing.

Computers perform calculations by utilizing components known as logic

gates or logic circuits. These gates are built with integrated circuits and work
by receiving input signals, processing them, and converting them to output
signals. Logic gates are essential in the logical functions that underpin
digital computer capability.
NUMBER
SYSTEM
A number system is a method of writing
numbers that acts as a mathematical notation for
expressing numbers from a given set. It entails the
constant use of digits or other symbols to produce a
unique representation for each number. Number
systems convey not simply individual values but also
the mathematical and algebraic structure of the
numbers they represent. This system allows for the
execution of numerous arithmetic operations such as
addition, subtraction, multiplication, and division.
TYPES OF NUMBER
SYSTEMS
DECIMAL NUMBER SYSTEM (BASE 10
NUMBER SYSTEM)
The decimal number system is distinguished by its base of ten digits ranging from 0 to 9. The locations to the left
of the decimal point in this system signify units, tens, hundreds, thousands, and so on. Each place corresponds to
a different power of the base, which is 10 in this example. This arrangement allows numbers to be expressed in
decimal notation.

Example of Decimal Number System:

The decimal number 1457 consists of the digit 7 in the units position, 5 in the tens place, 4 in the hundreds
position, and 1 in the thousands place whose value can be written as:

(1×103) + (4×102) + (5×101) + (7×100)

(1×1000) + (4×100) + (5×10) + (7×1)
1000 + 400 + 50 + 7
1457
BINARY NUMBER SYSTEM
(BASE 2 NUMBER SYSTEM)

The base-2 number system is also known as the Binary number system since it has only two binary digits: 0 and 1.
The phrase "base-2" refers to the fact that it has a radix of 2. The figures in this system are represented by binary
integers, which are a combination of 0s and 1s. A binary number would be 110101, for example.

Write (14)₁₀ as a binary number.

∴ (14)₁₀ = 1110₂
OCTAL NUMBER SYSTEM
(BASE 8 NUMBER SYSTEM)
The octal number system has an 8-digit basis and uses digits 0 to 7 to represent
numbers. Octal numerals are commonly used in computer applications. The
principles of converting an octal number to a decimal number are the same as those
of decimal conversion. An example of the method is shown below.

Convert 215₈ into decimal.

Solution:
215₈ = 2 × 82 + 1 × 81 + 5 × 80
= 2 × 64 + 1 × 8 + 5 × 1
= 128 + 8 + 5
= 141₁₀
HEXADECIMAL NUMBER SYSTEM
(BASE 16 NUMBER SYSTEM)

Numbers in the hexadecimal format are expressed or represented with a base of 16.
Initially, the hexadecimal system depicts numbers similarly to the decimal system, with
digits ranging from 0 to 9. As a result, the method uses the alphabet letters A to F to
denote numerals greater than 9. This enables for an easy and convenient representation
of values.
 ARITHMETIC
OPERATION

ADDITION SUBTRACTION DIVISION MULTIPLICATION

ADDITION OF A
NUMBER BASE
SYSTEM
Octal Addition
Binary Addition
Octal addition uses eight digits,
Any binary number can be simply added using these
0,1,2,3,4,5,6,7. Last position in an octal
rules. The four binary addition rules are as follows:
number represents an x power of the base (8).
0+0=0
0+1=1 Example:
1+0=1
1 + 1 =10

Example 1: 10001 + 11101

Solution:
1
10001
(+) 1 1 1 0 1
———————–
101110
Hexadecimal Addition

Letters represents numbers starting from 10. A = 10, Example 2: Add the following hexadecimal
B = 11, C = 12, D = 13, E = 14, F = 15. Each position in a numbers.
hexadecimal number represents a 0 power of the D6E + 8C6
base (16).
Ans: We know that
Example 1: Add the following hexadecimal number. E + 6 = 14
8AB + B78 6 + C = 12
Ans: 8AB + B78 D + 8 = 15
We know:
8 + B = 13
Thus,
A + 7 = 11 D6E + 8C6
8 + B = 13 = 1634
8AB + B78 = 1423 Therefore, its sum will be 1634.
Thus, the answer is 1423.
SUBTRACTION OF
A NUMBER BASE
SYSTEM
Example: Subtract (1000100-1010100) using
Binary Subtraction 2's complement.
M= 1000100
Subtraction Using Complements can be done by two
N= 11010100
ways:
Subtraction Using r's Complement: 2's complement of N=10110
The subtraction of two positive numbers (M-N) both Now, adding 2's complement of N to M
of base r can be done as follows; 10110+1000100= 110000
1. Add the minuend M to the r's complement of Here, end carry occurs as 1, so 2's
subtractend N.
complement = -10000
2. Inspect the result obtained in step 1 for end
carry.
If end carry occurs, discard it.
If end carry doesn't occur, take r's complement if
the number obtained in step 1 and place a
negative sign in front.
Subtraction Using r-1's Complement:
Example: Subtract (1000100-1010100) using
1's complement.
The subtraction of two positive numbers (M-N) both
M= 1000100
of base r-1 can be done as follows;
1. Add the minuend M to the r-1's complement of
N= 11010100
subtractend N. 1's complement of N=101011
2. Inspect the result obtained in step 1 for end Now, adding 1's complement of N to M
carry. 101011+1000100= 1101111
If end carry occurs, add 1 to the least significant Here, end carry doesn't occur as 1, so 1's
bit, i.e. end-around carry. complement of 1101111= -1000 which is the
If end carry doesn't occur, take r-1's complement required answer.
of the number obtained in step 1 and place a
negative sign in front.
MULTIPLICATION Octal Multiplication
OF NUMBER BASE
SYSTEM To multiply two octal numbers we use the rule given above.
The process for multiplication of octal numbers is illustrated
Binary Multiplication with the help of the following examples:

The operation performed while finding the binary Evaluate:

product is similar to the conventional multiplication
6 × 23
method. The four major steps in binary digit
multiplication are:
Solution:

0×0=0
We have 6 × 3 = 18 in decimal, which when divided by 8 gives a
0×1=0
remainder 2 and carry 2. Again 6 × 2 = 12 in decimal, and 12 + 2
1×0=0
= 14. This when divided by 8 gives a remainder 6 and a carry 1.
1×1=1
Hence 6 × 23 = 162
6 × 3 = 18

18/8 = 2 with remainder 2 → l,s,d,

6 × 2 = 12 + 2 (carry) = 14

14/8 = 1 with remainder 6.

 DIVISION OF
NUMBER BASE
SYSTEM
Binary Division

The binary division is much easier than the decimal division when
you remember the following division rules. The main rules of the
binary division include:
1÷1 = 1
1÷0 = Meaningless
0÷1 = 0
0÷0 = Meaningless

Question: Solve 01111100 ÷ 0010

Remove the zero’s in the Most Significant Bit in both the dividend
and divisor, that doesn’t change the value of the number.
So the dividend becomes 1111100, and the divisor becomes 10.
Now, use the long division method.

Therefore, the resultant value is quotient

value which is equal to 111110
So, 01111100 ÷ 0010 = 111110
BOOLEAN
ALGEBRA
Boolean algebra is the branch of algebra where
the variables are the truth values, true and false,
usually represented by 1 and 0, respectively. Logical
gates or digital circuits are analyzed and made simpler
using this algebraic system. Another name for it is
Binary Algebra. Boolean algebra is a fundamental
component of all contemporary programming
languages and has been instrumental in the
development of digital devices. It also has applications
in statistics and set theory.
BASIC THEOREMS
LAWS AND THEOREMS
LAWS AND THEOREMS
NAND AND NOR:
UNIVERSAL GATES
NAND gate
A NAND gate (short for NOT-AND) is the same as AND followed by NOT. You can see how we’ve squished the
symbols together,

NOR gate
A NOR gate (NOT-OR) is the same as OR followed by NOT. We merge the OR and NOT symbols together to get
NOR,
KARNAUGH MAP (K-MAP)
Boolean function simplification can be achieved visually with a Karnaugh map (K-map), negating the need for
intricate theorems or equation manipulation. It can be seen of as a more focused form of a truth table, making it
easier to map out parameter values and derive a more straightforward Boolean expression.

The functions with two to four variables work well with K-maps. Functions with five or six variables can also use
them, but the procedure is more difficult. For functions with seven or more variables, using K-maps is extremely
challenging, if not completely unfeasible.
TWO-VARIABLE KARNAUGH MAP

Each truth table value is represented within the

Karnaugh map in the example of a two-variable
function provided in Figure 6.3. Most notably, the
top row's two columns include a "1". This indicates
that when the input variables have values that
correspond to either of these cells, there is only one
product term that may make the function \( f \) equal
to 1. The values that have been identified are shown
by circles, \(x_1 = 0 \), where \(x_2 \) is equal to 0 in
the left column and 1 in the right column.

This suggests that, regardless of the value of \(x_2 \),

\(f = 1 \), if \(x_1 = 0 \). The product phrase for this
condition is indicated by the circled area. In the
same way, if \(x_2 = 1 \), then
CODE CONVESION

The process of converting code from one format to another is referred to as

"code conversion." Numerous industries, including computers, digital
electronics, microprocessors, and other computing devices, commonly use
this technique. To ensure compatibility, interoperability, or adaptability
between various formats or systems, code conversion is necessary. It makes it
possible for information to be used and exchanged across many platforms
and technologies with ease.
BINARY CODES FOR
DECIMAL DIGITS
THANK YOU!