ppt on Logic circuits :combinational By dushyant kumar

objectives
Logic levels Positive and negative logics Difference between combinational & sequential logic circuits Logic gates and symbols Boolean descriptions & truthtables Functional & derived gates

Logic levels
In digital circuts, a logic level is one of a finite number of states that a signal can have. Logic levels are usually represented by the voltage difference between the signal and ground (or some other common reference point), although other standards exist. The range of voltage levels that represents each state depends on the logic family being used.
3

Positive and negative logic

Positive logic 0- 0 v 1-5 v 1 level value of the variable >0 level value Negative logic 0-5v 1-0v 1 level value < 0 level value

Types of functional blocks

Gates are called logics gates They works on logical concepts
Two types of logics function Combinational sequential
5

Classification of Digital Circuits

Combinational logic circuits.
Output depends only on present input.

Sequential circuits.
Output depends on present input and present state of the circuit.

Combinational logic function

In combinational ckt the output depend upon the current value of input It doesnt store the histroy of the circuit

Block diagram of Combinational Circuits

Sequential Circuits
combinational circuits are perfect for situations when we require the immediate application of a Boolean function to a set of inputs. There are other times, however, when we need a circuit to change its value with consideration to its current state as well as its inputs. These circuits have to remember their current state.

Sequential logic circuits provide this functionality for us.

Chapter 3: Digital Logic

Sequential logic concept

10

Combinational building block

We have looked at Boolean functions in abstract terms. In this section, we see that Boolean functions are implemented in digital computer circuits called gates. A gate is an electronic device that produces a result based on two or more input values. In reality, gates consist of one to six transistors, but digital designers think of them as a single unit. Integrated circuits contain collections of gates suited to a particular purpose.
11

3.3 Logic Gates

The three simplest gates are the AND, OR, and NOT gates.

They correspond directly to their respective Boolean operations, as you can see by their truth tables.
12

3.3 Logic Gates

Another very useful gate is the exclusive OR (XOR) gate. The output of the XOR operation is true only when the values of the inputs differ.

Note the special symbol for the XOR operation.

13

3.3 Logic Gates

NAND and NOR are two very important gates. Their symbols and truth tables are shown at the right.

14

3.3 Logic Gates

NAND and NOR are known as universal gates because they are inexpensive to manufacture and any Boolean function can be constructed using only NAND or only NOR gates.
15

3.3 Logic Gates

Gates can have multiple inputs and more than one output.
A second output can be provided for the complement of the operation. Well see more of this later.

16

Designing Combinational Circuits

In general we have to do following steps: 1. Problem description 2. Input/output of the circuit 3. Define truth table 4. Simplification for each output 5. Draw the circuit

3.5 Combinational Circuits

Combinational logic circuits give us many useful devices. One of the simplest is the half adder, which finds the sum of two bits. We can gain some insight as to the construction of a half adder by looking at its truth table, shown at the right.

18

Half adder
As we see, the sum can be found using the XOR operation and the carry using the AND operation.

19

Logical diagram of half adder

20

3.5 Combinational Circuits

We can change our half adder into to a full adder by including gates for processing the carry bit. The truth table for a full adder is shown at the right.

21

3.5 Combinational Circuits

Heres our completed full adder.

22

Boolean Function Optimization

Minimizing the gate input (or literal) cost of a (a set of) Boolean equation(s) reduces circuit cost. We choose gate input cost. Boolean Algebra and graphical techniques are tools to minimize cost criteria values. Some important questions:
When do we stop trying to reduce the cost? Do we know when we have a minimum cost?

Treat optimum or near-optimum cost functions for two-level (SOP and POS) circuits first. Introduce a graphical technique using Karnaugh maps (K-maps, for short)

Karnaugh Maps (K-map)

A K-map is a collection of squares

Each square represents a minterm The collection of squares is a graphical representation

of a Boolean function Adjacent squares differ in the value of one variable Alternative algebraic expressions for the same function are derived by recognizing patterns of squares

The K-map can be viewed as

A reorganized version of the truth table A topologically-warped Venn diagram as used to visualize sets in algebra of sets
Chapter 2 - Part 2 24

Some Uses of K-Maps

Provide a means for:
Finding optimum or near optimum
SOP and POS standard forms, and two-level AND/OR and OR/AND circuit implementations

Chapter 2 - Part 2 25

for functions with small numbers of variables Visualizing concepts related to manipulating Boolean expressions, and Demonstrating concepts used by computeraided design programs to simplify large circuits
*Video by diyfpgacom via YouTube

vedio showing implementation of nor gate on breadboard

26

THANK YOU

ANY QUE?????

27