Transcription

1 Class Subject Code Subject Prepared By Lesson Plan for Time: Lesson. No 1.CONTENT LIST: Introduction to UnitII 2. SKILLS ADDRESSED: Learning I year, 02 sem CS6201 Digital Principles & System Design S.Seedhanadevi Introduction to UnitII 45 Minutes Unit II-Lesson No.1/15 3.OBJECTIVE OF THIS LESSON PLAN: 4.OUTCOMES: To make the students learn the topics to be covered in unit II i. Learn the major topics in UnitII 5.LINK SHEET: Describe the uses in designing combinational circuits. i. List the major topics in combinational circuits Give uses in designing the combinational circuits 6. EVOCATION: (5 minutes) 7. LECTURE NOTES: (40Minutes) Topics to be covered Combinational Circuits Combinational circuits Analysis and design procedures Circuits for arithmetic operations CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 1

2 Code conversion Decoders Encoders Multiplexers Demultiplexers HDL for combinational circuits Uses in designing the logic circuits Combinational circuits A combinational circuit consists of input variables, logic gates, and output variables. Analysis and design procedure Used to derive the truthtable and Boolean expression to design various digital logic circuits Circuits for arithmetic operations Decoders Encoders Multiplexers Demultiplexers Half adder, Full adder, Binary adder, Binary adder/ subtractor, Half subtractor, Full subtractor The decoder is called n-to-m-line decoder, where m 2 n.the decoder is also used in conjunction with other code converters such as a BCD-to-seven_segment decoder. An encoder is the inverse operation of a decoder. Used in designing the various complex digital circuits. Multiplexer circuits can be combined with common selection inputs to provide multiple-bit selection logic. A decoder with an enable input is referred to as a decoder/demultiplexer. HDL for combinational circuits 8. TEXT BOOKS: 1.Gate-level modeling 2.Dataflow modeling 3.Behavioral modeling Sanjay Kumar Suman, L.Bhagyalakshmi, S.Porselvi, Digital Principles And System Design,Vijay Nicole Pubilcations 9. APPLICATIONS Fundamental circuits that are the base building blocks of most larger digital circuits CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 2

3 They are reusable and are common to many systems Class Subject Code Subject Prepared By Lesson Plan for Time: Lesson. No 1.CONTENT LIST: I year, 02 sem CS6201 Digital Principles & System Design S.Seedhanadevi Combinational circuits. 45 Minutes Unit II-Lesson No.2/15 Combinational circuits. 2. SKILLS ADDRESSED: Understanding Learning Remembering 3. OBJECTIVE OF THIS LESSON PLAN: To make the students learn the meaning of combinational circuits and their implementation. 4.OUTCOMES: i. Learn the meaning of combinational circuits 5.LINK SHEET: Describe the implementation of logic circuits by combinational circuits. i. Define combinational circuits with neat block diagram. i iv. Give the need of combinational circuits. List the types of combinational circuits. Explain the implementation using combinational circuits 6.EVOCATION: (5 Minutes) CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 3

4 Combinational Circuits Combinational Circuits block 7. LECTURE NOTES: (40 Minutes) Combinational Circuits A combinational circuit consists of input variables, logic gates, and output variables. Need of combinational circuits Fundamental circuits that are the base building blocks of most larger digital circuits They are reusable and are common to many systems Types of combinational circuits. Implementation Using Combinational Circuits The implementation using combinational circuits can be formulated by following steps Specification for the Circuits: What are the inputs: how many, how many bits in a given output, how are they grouped, are they control, are they active high? CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 4

5 What are the outputs: how many and how many bits in an each, active high, active low, tristate output? The functional operation that takes place in the chip, i.e., for given inputs what will appear on the outputs. Convert the specifications into a variety forms for optimal implementation. Possible forms Truth Tables Expressions K-maps Binary Decision Diagrams Implementation with example BCD-to-Seven-Segment Decoder Digital readouts on many digital products often use LED seven-segment displays. Each digit is created by lighting the appropriate segments. The segments are labeled a,b,c,d,e,f,g The decoder takes a BCD input and outputs the correct code for the seven-segment display. Specifications 1. Input: A 4-bit binary value that is a BCD coded input. 2. Outputs: 7 bits, a through g for each of the segments of the display. 3. Operation: Decode the input to activate the correct segments. Construct a truth table Binary expressions A = A C+A BD+B C D +AB C B = A B +A C D +A CD+AB C C = A B+A D+B C D +AB C D = A CD +A B C+B C D +AB C +A BC D E = A CD +B C D F = A BC +A C D +A BD +AB C G = A CD +A B C+A BC +AB C CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 5

6 8.TEXT BOOKS: Sanjay Kumar Suman, L.Bhagyalakshmi, S.Porselvi, Digital Principles And System Design,Vijay Nicole Pubilcations 9.APPLICATIONS Fundamental circuits that are the base building blocks of most larger digital circuits They are reusable and are common to many systems Sri Vidya College of Engineering and Technology Department of Information Technology Class Subject Code Subject Prepared By Lesson Plan for Time: Lesson. No 1.CONTENT LIST: I year, 02 sem CS6201 Digital Principles & System Design S.Seedhanadevi Analysis and design procedures 45 Minutes Unit II-Lesson No.3/15 Analysis and design procedures 2. SKILLS ADDRESSED: Understanding Applying Remembering 3. OBJECTIVE OF THIS LESSON PLAN: To make the students apply the steps of implementation in analyzing combinational circuits. 4.OUTCOMES: i. Understand the analysis procedure of combinational circuits 5.LINK SHEET: Illustrate the procedure with an example i. Discuss the analysis procedure with major steps. Give an example to illustrate the analysis procedure of combinational circuits. i Derive the truth table and binary expression using the analysis procedure. 6.EVOCATION: (5 Minutes) CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 6

7 logic circuit analyzer 1 7. LECTURE NOTES: (40 Minutes) Analysis Procedure 1. The analysis for a combinational circuit consists of determining the function that the circuit implements. 2. The analysis starts with a given logic circuit diagram and culminates with a set of Boolean functions or a truth table, together with a possible explanation of the operation of the circuit. 3. If the logic diagram to be analyzed is accompanied by a recognizable function name or a statement of what the diagram is assumed to accomplish, then the analysis problem reduces to a verification of the stated function. Steps of analysis procedure Label all gate outputs that are a function only of input variables or their complements with arbitrary symbols. Determine the Boolean functions for each gate output. Label the gates that are a function of input variables and previously labeled gates with different arbitrary symbols. Find the Boolean functions for the outputs of these gates. Repeat the process outlined in step 2 until the outputs of the circuit are obtained in terms of the input variables. Illustration with an example F 2 = AB + AC + BC; T 1 = A + B + C; T 2 = ABC; T 3 = F 2 T 1 ; F 1 = T 3 + T 2 F 1 = T 3 + T 2 = F 2 T 1 + ABC = A BC + A B C + AB C + ABC CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 7

8 Note that the circuit has four binary input variables A, B, and C and two binary output variables and. The outputs of gates that are a function of input variables only are and. The Boolean functions for these two outputs are F 2 = AB + AC + BC; T 1 = A + B + C; T 2 = ABC; T 3 = F 2 T 1 ; F 1 = T 3 + T 2 F 1 = T 3 + T 2 = F 2 T 1 + ABC = A BC + A B C + AB C + ABC Derivation of truth table from logic diagram and Boolean function Determine the number of input variables in the circuit. For n inputs, list the binary numbers from 0 to 2 n 1 in a table. 1. Break the circuit into small single-output blocks by labeling each block output with an arbitrary symbol. 2. Obtain the truth table for the blocks with functions that depend on input variables only. 3. Proceed to obtain the truth table for blocks with functions that depend on previously defined inputs and block outputs, until the columns for all circuit outputs are determined 8.TEXT BOOKS: Sanjay Kumar Suman, L.Bhagyalakshmi, S.Porselvi, Digital Principles And System Design,Vijay Nicole Pubilcations. CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 8

9 9.APPLICATIONS They are used as building blocks for various intermediate inputs and outputs and thereby applying it in design of various digital circuits. Sri Vidya College of Engineering and Technology Department of Information Technology Class Subject Code Subject Prepared By Lesson Plan for Time: Lesson. No 1.CONTENT LIST: I year, 02 sem CS6201 Digital Principles & System Design S.Seedhanadevi Analysis and design procedures 45 Minutes Unit II-Lesson No.4/15 Analysis and design procedures 2. SKILLS ADDRESSED: Applying understanding 3. OBJECTIVE OF THIS LESSON PLAN: To make the students apply the steps of implementation in designing the digital logic circuits. CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 9

10 4.OUTCOMES: i. Understand the design procedure of combinational circuits Illustrate the procedure with an example 5.LINK SHEET: i. Discuss the design procedure with major steps. Give an example to illustrate the design procedure of combinational circuits. i Design the logic circuit based on the steps of design procedure. 6.EVOCATION: (5 Minutes) 7. LECTURE NOTES: (40 Minutes) Design Procedure Analogy for combinational circuits 1 The design for a combinational circuit consists of determining the function that the implement the circuits. Steps of analysis procedure Derivation of truth table K map and Boolean expression Circuit implementation Illustration with an example Code-Conversion example, first, we can list the relation of the BCD and Excess-3 codes in the truth table. Derivation of truth table CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 10

11 K map and Boolean expression For each symbol of the Excess-3 code, we use 1 s to draw the map for simplifying Boolean function. Circuit implementation z = D ; y = CD + C D = CD + (C + D), x = B C + B D + BC D = B (C + D) + B(C + D),w = A + BC + BD = A + B(C + D) CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 11

12 8.TEXT BOOKS: Sanjay Kumar Suman, L.Bhagyalakshmi, S.Porselvi, Digital Principles And System Design,Vijay Nicole Pubilcations.. 9.APPLICATIONS They are used as building blocks for logic circuits by calculating the truthtable and boolean expression CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 12

13 Sri Vidya College of Engineering and Technology Department of Information Technology Class Subject Code Subject Prepared By Lesson Plan for Time: Lesson. No 1.CONTENT LIST: I year, 02 sem CS6201 Digital Principles & System Design S.Seedhanadevi Circuits for arithmetic operations 45 Minutes Unit II-Lesson No.5/15 Circuits for arithmetic operations 2. SKILLS ADDRESSED: Remembering Learning Classifying 3. OBJECTIVE OF THIS LESSON PLAN: 4.OUTCOMES: To make the students know the basic concept of arithmetic circuits i. Describe the various classification of arithmetic circuits 5.LINK SHEET: Deduce the basic concept of arithmetic circuits i. List the types of arithmetic circuits. Define all the arithmetic circuits which help in designing combinational circuits. i What is the need for using arithmetic circuits in designing combinational circuits? iv. Design half adder circuit and full adder circuit using truth table and Boolean expression 6. EVOCATION: (5 Minutes) Fulladder-redstone scenario 7. LECTURE NOTES: (40 Minutes) Types of arithmetic circuits CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 13

14 Half Adder: Half adder,full Adder,Binary Adder,Binary Multiplier,Carry Look Ahead Adder A combinational circuit that performs the addition of two bits is called a half adder. Full Adder: One that performs the addition of three bits(two significant bits and a previous carry) is a full adder. Binary Adder: This is also called Ripple Carry Adder,because of the construction with full adders are connected in cascade. Binary subtractor: M = 1subtractor ; M = 0adder Overflow is a problem in digital computers because the number of bits that hold the number is finite and a result that contains n+1 bits cannot be accommodated. Binary multiplier: Usually there are more bits in the partial products and it is necessary to use full adders to produce the sum of the partial products. Need for using arithmetic circuits in designing combinational circuits: reduce cost reduce number of gates (for SSI circuits) reduce IC packages (for complex circuits) (ii) increase speed (iii) design simplicity (reuse blocks where possible) Half Adder The truth table for the half adder is listed below. Boolean Expression C = xy S = x y + xy Implementation of Half Adder Circuit CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 14

15 Full Adder One that performs the addition of three bits (two significant bits and a previous carry) is a full adder. Truth Table Boolean expression using K map S = x y z + x yz + xy z + xyz C = xy + xz + yz Implementation of Full adder circuit 8.TEXT BOOKS: Sanjay Kumar Suman, L.Bhagyalakshmi, S.Porselvi, Digital Principles And System Design,Vijay Nicole Pubilcations.. 9.APPLICATIONS The arithmetic circuits are used to reduce the cost, increase the speed and design very complex digital circuits with ease CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 15

16 Sri Vidya College of Engineering and Technology Department of Information Technology Class Subject Code Subject Prepared By Lesson Plan for Time: Lesson. No 1.CONTENT LIST: I year, 02 sem CS6201 Digital Principles & System Design S.Seedhanadevi Circuits for arithmetic operations 45 Minutes Unit II-Lesson No.6/15 Circuits for arithmetic operations 2. SKILLS ADDRESSED: Remembering Learning Analyzing 3. OBJECTIVE OF THIS LESSON PLAN: 4.OUTCOMES: To make the students know the basic operation of all the arithmetic circuits i. Discuss the operation of all the arithmetic circuits 5.LINK SHEET: Design logic diagram by the steps used in the basic mode of operation i. Explain the operation of individual arithmetic circuits i What are the modes used in designing arithmetic circuits? Design the binary adder; carry look adder, Binary Multiplier and Binary Subtractor circuit using the basic mode of operation. 6. EVOCATION: (5 Minutes) binary adder-subtractor Gates used in arithmetic circuits 7. LECTURE NOTES: (40 Minutes) CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 16

17 Major Steps: Binary adder Truthtable Boolean expression using Kmap Logic circuit This is also called Ripple Carry Adder, because of the construction with full adders are connected in cascade. Truth Table Implementation of Binary adder circuit Carry Look Ahead Adder The most widely used technique employs the principle of carry look-ahead to improve the speed of the algorithm. Boolean expression P i = A i B i steady state value G i = A i B i steady state value Output sum and carry S i = P i C i C i+1 = G i + P i C i G i : carry generate P i : carry propagate C 0 = input carry C 1 = G 0 + P 0 C 0 C 2 = G 1 + P 1 C 1 = G 1 + P 1 G 0 + P 1 P 0 C 0 C 3 = G 2 + P 2 C 2 = G 2 + P 2 G 1 + P 2 P 1 G 0 + P 2 P 1 P 0 C 0 Implementation of Carry Look ahead adder circuit CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 17

18 Binary subtractor: M = 1subtractor ; M = 0adder Overflow is a problem in digital computers because the number of bits that hold the number is finite and a result that contains n+1 bits cannot be accommodated. Implementation of Binary Subtractor circuit Binary multiplier: Usually there are more bits in the partial products and it is necessary to use full adders to produce the sum of the partial products. For J multiplier bits and K multiplicand bits we need (J X K) AND gates and (J 1) K- bit adders to produce a product of J+K bits. K=4 and J=3, we need 12 AND gates and two 4-bit adders. Implementation of 4-bit by 3-bit binary multiplier circuit 8.TEXT BOOKS: CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 18

19 Sanjay Kumar Suman, L.Bhagyalakshmi, S.Porselvi, Digital Principles And System Design,Vijay Nicole Pubilcations. 9.APPLICATIONS They present special design challenges, because there are simply too many inputs to list all possible combinations in a truth table. In applying this method, bus-wide operations are broken into simpler bit-by-bit operations that are more easily defined by truth-tables, and more tractable to familiar design techniques Sri Vidya College of Engineering and Technology Department of Information Technology Class Subject Code Subject Prepared By Lesson Plan for Time: Lesson. No 1.CONTENT LIST: Code conversion 2. SKILLS ADDRESSED: Remembering Applying I year, 02 sem CS6201 Digital Principles & System Design S.Seedhanadevi Code conversion 45 Minutes Unit II-Lesson No.7/15 3. OBJECTIVE OF THIS LESSON PLAN: To make the students know the basic concept of code conversion and to use their principle in various code conversion circuits. 4.OUTCOMES: i. Deduce the Principle of code conversion 5.LINK SHEET: Describe the various code conversion methods using the principle. i. What is the principle of code conversion? i List the types of code conversion circuits Design any one of the code conversion circuit by the principle used. 6. EVOCATION: (5 Minutes) CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 19

20 Code Conversion Examples 7. LECTURE NOTES: (40 Minutes) Code Conversion Conversion of signals, or groups of signals, in one code into corresponding signals, or groups of signals, in another code. Principle of Code Conversion A process for converting a code of some predetermined bit structure, such as 5, 7, or 14 bits per character interval, to another code with the same or a different number of bits per character interval. Types of codeconversion BCD to Gray code. and viceversa. BCD to excess3 code and viceversa. Binary to gray code and viceversa Implementation of code conversion circuit BCD and Excess-3 codes Truth Table CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 20

21 Kmap and Boolean Expression For each symbol of the Excess-3 code, we use 1 s to draw the map for simplifying Boolean function. z = D ; y = CD + C D = CD + (C + D) x = B C + B D + BC D = B (C + D) + B(C + D) w = A + BC + BD = A + B(C + D) BCD Excess3 circuit CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 21

22 8.TEXT BOOKS: Sanjay Kumar Suman, L.Bhagyalakshmi, S.Porselvi, Digital Principles And System Design,Vijay Nicole Pubilcations. 9.APPLICATIONS The principle is applied in digital speakers, sound cards and stereo to 3D displays Sri Vidya College of Engineering and Technology Department of Information Technology Class Subject Code Subject Prepared By Lesson Plan for Time: Lesson. No 1.CONTENT LIST: Decoders 2. SKILLS ADDRESSED: Remembering Understanding I year, 02 sem CS6201 Digital Principles & System Design S.Seedhanadevi Decoders 45 Minutes Unit II-Lesson No.8/15 3. OBJECTIVE OF THIS LESSON PLAN: To make the students know the basic concept of decoders and implement their types using the basic logic 4.OUTCOMES: i. Describe the basic concept of decoders 5.LINK SHEET: Explain the types of decoders and implement their design using the basic logic i. What is the decoder? CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 22

23 i List the types of decoder. Implement any one of the decoder circuit with necessary diagrams wherever necessary. 6. EVOCATION: (5 Minutes) 7. LECTURE NOTES: (40 Minutes) Decoder The decoder is called n-to-m-line decoder, where m 2 n the decoder is also used in conjunction with other code converters such as a BCD-to-seven segment decoder. 3-to-8 line decoder: For each possible input combination, there are seven outputs that are equal to 0 and only one that is equal to 1. Some decoders are constructed with NAND gates, it becomes more economical to generate the decoder minters in their complemented form. As indicated by the truth table, only one output can be equal to 0 at any given time, all other outputs are equal to 1. Types of decoder 2to4 decoder 3to8decoder 4to16decoder and so on. Implementation of decoder circuit 3 to 8 decoder Decoder Examples CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 23

24 2 to 4 decoder 8.TEXT BOOKS: CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 24

25 Sanjay Kumar Suman, L.Bhagyalakshmi, S.Porselvi, Digital Principles And System Design,Vijay Nicole Pubilcations. 9.APPLICATIONS Decoders are used to analyze data streams for a certain data code and give an output if the data is present like an address to a peripheral unit that needs service. Sri Vidya College of Engineering and Technology Department of Information Technology Class Subject Code Subject Prepared By Lesson Plan for Time: Lesson. No 1.CONTENT LIST: Encoders 2. SKILLS ADDRESSED: Remembering Learning I year, 02 sem CS6201 Digital Principles & System Design S.Seedhanadevi Encoders 45 Minutes Unit II-Lesson No.9/15 3. OBJECTIVE OF THIS LESSON PLAN: To make the students know the basic concept of encoders and implement their types using the basic logic 4.OUTCOMES: i. Describe the basic concept of encoders 5.LINK SHEET: Explain the types of encoders and implement their design using the basic logic i. What is the encoder? CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 25

26 i Implement any one of the encoder circuit with necessary diagrams wherever necessary. List the types of encoder 6. EVOCATION: (5 Minutes) 7. LECTURE NOTES: (40 Minutes) Encoder An encoder is the inverse operation of a decoder (ie) contains m inputs and convert it into to n outputs If two inputs are active simultaneously, the output produces an undefined combination. We can establish an input priority to ensure that only one input is encoded. Another ambiguity in the octal-to-binary encoder is that an output with all 0 s is generated when all the inputs are 0; the output is the same as when D 0 is equal to 1. Types of Encoder 4to2 encoder,8to3 encoder,16to4 encoder, Priority encoder and so on Implementation of encoder circuit 8 to 3 encoder Optical fork as an Encoder (Examples of encoder) z = D 1 + D 3 + D 5 + D 7,y = D 2 + D 3 + D 6 + D 7,x = D 4 + D 5 + D 6 + D 7 CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 26

27 V=0no valid inputs, V=1valid inputs o X s in output columns represent don t-care conditions. X s in the input columns are useful for representing a truth table in condensed form. Instead of listing all 16 minterms of four variables. x = D 2 + D 3, y = D 3 + D 1 D 2, V = D 0 + D 1 + D 2 + D CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 27

28 8.TEXT BOOKS: Sanjay Kumar Suman, L.Bhagyalakshmi, S.Porselvi, Digital Principles And System Design,Vijay Nicole Pubilcations.. 9.APPLICATIONS An encoder is a device, circuit, transducer, software program, algorithm or person that converts information from one format or code to another, for the purposes of standardization, speed, secrecy, security or compressions.. Sri Vidya College of Engineering and Technology Department of Information Technology Class Subject Code Subject Prepared By Lesson Plan for Time: Lesson. No 1.CONTENT LIST: Multiplexers 2. SKILLS ADDRESSED: Remembering Understanding I year, 02 sem CS6201 Digital Principles & System Design S.Seedhanadevi Multiplexers 45 Minutes Unit II-Lesson No.10/15 3. OBJECTIVE OF THIS LESSON PLAN: To make the students know the basic concept of Multiplexers and implement their types using the basic logic 4.OUTCOMES: CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 28

29 i. Describe the basic concept of Multiplexers 5.LINK SHEET: Explain the types of Multiplexers and implement their design using the basic logic i. What is the Multiplexers and write the other name for Multiplexers? i iv. Implement any one of the Multiplexers circuit with necessary diagrams wherever necessary. List the types of Multiplexers Implement the Boolean function using any one of the multiplexer circuit 6. EVOCATION: (5 Minutes) 7. LECTURE NOTES: (40 Minutes) Multiplexing examples Multiplexer In electronics, a multiplexer (or mux) is a device that selects one of several analog or digital input signals and forwards the selected input into a single line. A multiplexer of 2 n inputs has n select lines, which are used to select which input line to send to the output. Multiplexers are mainly used to increase the amount of data that can be sent over the network within a certain amount of time and bandwidth. CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 29

30 A multiplexer is also called a data selector. Types of Muliplexer 2 to 1 MUX 4 to 1 MUX 16 to 1 MUX and so on Implementation of MUX circuit 2 to 1 MUX S = 0, Y = I 0 Truth Table S Y S = 1, Y = I 1 0 I 0 Y = S I 0 + SI 1 1 I 1 4 to 1 MUX Boolean function implementation A more efficient method for implementing a Boolean function of n variables with a multiplexer that has n-1 selection inputs. F(x, y, z) = (1,2,6,7) CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 30

31 8.TEXT BOOKS: Sanjay Kumar Suman, L.Bhagyalakshmi, S.Porselvi, Digital Principles And System Design,Vijay Nicole Pubilcations. 9.APPLICATIONS Mux is used in telephony, telegraphy, digital broadcasting and analog broadcasting. An electronic multiplexer makes it possible for several signals to share one device or resource, for example one A/D converter or one communication line, instead of having one device per input signal. Sri Vidya College of Engineering and Technology Department of Information Technology Class I year, 02 sem Subject Code CS6201 Subject Digital Principles & System Design Prepared By S.Seedhanadevi Lesson Plan for Demultiplexers Time: 45 Minutes Lesson. No Unit II-Lesson No.11/15 1.CONTENT LIST: Demultiplexers 2. SKILLS ADDRESSED: Remembering Understanding CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 31

32 3. OBJECTIVE OF THIS LESSON PLAN: To make the students know the basic concept of Demultiplexers and implement their types using the basic logic 4.OUTCOMES: i. Describe the basic concept of Demultiplexers 5.LINK SHEET: Explain the types of Demultiplexers and implement their design using the basic logic i. What is the Demultiplexers and write the other name for Demultiplexers? i Implement any one of the Demultiplexers circuit with necessary diagrams wherever necessary. List the types of Demultiplexers 6. EVOCATION: (5 Minutes) 7. LECTURE NOTES: (40 Minutes) Demultiplexing examples Demultiplexer Demultiplexer (or demux) is a device taking a single input signal and selecting one of many data-output-lines, which is connected to the single It is otherwise known as data distributor. A decoder with an enable input is referred to as a decoder/demultiplexer. The truth table of demultiplexer is the same with decoder. Types of Demuliplexer 1 to 2 DEMUX,1 to 4 DEMUX,1 to 16 DeMUX and so on CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 32

33 Implementation of DEMUX circuit 1-to-4 De-multiplexer Addressing Input b a Selected 0 0 A 0 1 B 1 0 C 1 1 D The Boolean expression for this 1-to-4 Demultiplexer above with outputs A to D and data select lines a, b is given as: F = ab A + abb + abc + abd 8.TEXT BOOKS: Sanjay Kumar Suman, L.Bhagyalakshmi, S.Porselvi, Digital Principles And System Design,Vijay Nicole Pubilcations. 9.APPLICATIONS Demultiplexer is used to connect a single source to multiple destinations. It is used in ALU circuit. The second use of the Demultiplexer is the reconstruction of Parallel Data from the incoming serial data stream. Sri Vidya College of Engineering and Technology Department of Information Technology Class Subject Code Subject Prepared By Lesson Plan for Time: Lesson. No 1.CONTENT LIST: I year, 02 sem CS6201 Digital Principles & System Design S.Seedhanadevi Introduction to Hardware Description Language (HDL) 45 Minutes Unit II-Lesson No.12/15 Introduction to Hardware Description Language (HDL) 2. SKILLS ADDRESSED: CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 33

34 Remembering Learning 3. OBJECTIVE OF THIS LESSON PLAN: To make the students know the basics of HDL and know their advantages in hardware implementation 4.OUTCOMES: i. Describe the basic concept of HDL 5.LINK SHEET: Explain design methodologies using HDL i. What is HDL i Write the HDL coding for the circuit given Evaluate in brief the modeling techniques of HDL 6. EVOCATION: (5 Minutes) 7. LECTURE NOTES: (40 Minutes) HDL In electronics, a Hardware Description Language or HDL is any language from a class of computer languages, specification languages, or modeling languages for formal description and design of electronic circuits, and most-commonly, digital logic. It can describe the circuit's operation, its design and organization, and tests to verify its operation by means of simulation. HDL coding for given circuit CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 34

35 Modeling techniques Gate-level modeling Dataflow modeling Behavioral modeling 8.TEXT BOOKS: Sanjay Kumar Suman, L.Bhagyalakshmi, S.Porselvi, Digital Principles And System Design,Vijay Nicole Pubilcations. 9.APPLICATIONS Hardware description language enables a precise, formal description of an electronic circuit that allows for the automated analysis, simulation, and simulated testing of an electronic circuit. A hardware description language looks much like a programming language such as C; it is a textual description consisting of expressions and statements. Sri Vidya College of Engineering and Technology Department of Information Technology Class Subject Code Subject Prepared By I year, 02 sem CS6201 Digital Principles & System Design S.Seedhanadevi CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 35

36 Lesson Plan for Time: Lesson. No 1.CONTENT LIST: HDL for Combinational Circuits 45 Minutes Unit II-Lesson No.13/15 HDL for Combinational Circuits 2. SKILLS ADDRESSED: Remembering Understanding Applying 3. OBJECTIVE OF THIS LESSON PLAN: To make the students know the various modeling techniques and their description using HDL 4.OUTCOMES: i. Describe the various types of modeling techniques 5.LINK SHEET: Deduce the HDL coding for each modeling techniques i. What is Gate level modeling? i What is Behavioral modeling? Explain Gate level modeling and Behavioral modeling with an example 6. EVOCATION: (5 Minutes) 7. LECTURE NOTES: (40 Minutes) Modelling Techniques A module can be described in any one of the following modeling techniques: Gate-level modeling uses instantiation of primitive gates and user-defined modules. Dataflow modeling uses continuous assignment statements with keyword assign. CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 36

37 Behavioral modeling uses procedural assignment statements with keyword always. Gate-level modeling A circuit is specified by its logic gates and their interconnection. Verilog recognizes 12 basic gates as predefined primitives. The logic values of each gate may be 1, 0, x (unknown), z(high-impedance). Example Behavioral modeling It is used mostly to describe sequential circuits, but can be used also to describe combinational circuits. Behavioral descriptions use the keyword always followed by a list of procedural assignment statements. Example CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 37

38 8.TEXT BOOKS: Sanjay Kumar Suman, L.Bhagyalakshmi, S.Porselvi, Digital Principles And System Design,Vijay Nicole Pubilcations. 9.APPLICATIONS High Level Modeling language and time consumption language Used in various Design Entry Used for Simulation with Xilinx CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 38

39 Sri Vidya College of Engineering and Technology Department of Information Technology Class Subject Code Subject Prepared By Lesson Plan for Time: Lesson. No 1.CONTENT LIST: I year, 02 sem CS6201 Digital Principles & System Design S.Seedhanadevi HDL for Combinational Circuits 45 Minutes Unit II-Lesson No.14/15 HDL for Combinational Circuits 2. SKILLS ADDRESSED: Remembering Understanding Applying 3. OBJECTIVE OF THIS LESSON PLAN: To make the students know the various design methodologies and their description using HDL 4.OUTCOMES: i. Describe the various design methodologies 5.LINK SHEET: Deduce the HDL coding for each design methodologies i. What is Data Flow modeling? i What is design methodology for HDL and explain it with an example? Explain data flow modelling with an example 6. EVOCATION: (5 Minutes) CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 39

40 7. LECTURE NOTES: (40 Minutes) Data Flow Modelling Example A continuous assignment is a statement that assigns a value to a net. The data type net is used in Verilog HDL to represent a physical connection between circuit elements. A net defines a gate output declared by an output or wire. Design Methodology and its types Example There are two basic types of design methodologies: top-down and bottom-up. Top-down: the top-level block is defined and then the sub-blocks necessary to build the top-level block are identified Bottom-up: the building blocks are first identified and then combined to build the top-level block. 8.TEXT BOOKS: Sanjay Kumar Suman, L.Bhagyalakshmi, S.Porselvi, Digital Principles And System Design,Vijay Nicole Pubilcations. 9.APPLICATIONS High Level Modeling language and time consumption language Used in various Design Entry. CS6201-DIGITAL PRINCIPLES AND SYSTEM DESIGN Page 40