VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur"

Transcription

1 VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur DEPARTMENT OF ELECTRONICS & COMMUNICATION ENGINEERING QUESTION BANK SUBJECT CODE/NAME YEAR/ SEMESTER : EC6302/ DIGITAL ELECTRONICS : II / III UNIT I MINIMIZATION TECHNIQUES AND LOGIC GATES Minimization Techniques: Boolean postulates and laws De-Morgan s Theorem- Principle of Duality - Boolean expression - Minimization of Boolean expressions Minterm Maxterm - Sum of Products (SOP) Product of Sums (POS) Karnaugh map Minimization Don t care conditions Quine Mc-Cluskey method of minimization. Logic Gates: AND, OR, NOT, NAND, NOR, Exclusive OR and Exclusive NOR Implementations of Logic Functions using gates, NAND NOR implementations Multilevel gate implementations- Multi output gate implementations. TTL and CMOS Logic and their characteristics Tristate gates. PART A Q. No Questions BT Level Domain 1. State De-Morgan s theorem. 2. Express the function Y A BC in canonical POS. 3. Convert Y A BC + AB ABC into canonical form. 4. Enumerate the advantages of CMOS logic. 5. Simplify the following Boolean expression into one literal. W X ( Z YZ) X ( W WYZ ). 6. Describe the CMOS inverter circuit. 7. Define minterm and maxterm. 8. Draw an active high tri-state Gate & write its truth table. 9. Illustrate Don t care terms. 10. State Distributive law. 11. What is meant by Prime Implicant and Essential prime implicants?

2 12. Find the minimized Boolean expression of this function F= X XY X Z XY Z. 13. Implement the given function using NAND gates only. F(X,Y,Z)= m (0,6). 14. Explain fan-in & fan-out of a standard TTL IC. 15. If A & B are Boolean variables and if A=1 & A B =0, determine B? Apply De-Morgan s theorem to simplify A BC. Design a 3 input CMOS NAND gate. 18. Determine the Boolean expression for the output of the system shown in figure. 19. Interpret the truth table of EXOR gate. 20. Simplify: ABC ABC. PART B 1. (i) Find the Minimized logic function using K-Maps and Realize using NAND and NOR gate. F(A,B,C,D)= m ( 1,3,5,8,9,11,15) d(2,13). (8) (ii) Show that if all the gate in a two-level OR-AND gate network are replaced by NOR gate, the output function does not change. (5) 2. (i) Realize NOT, OR, AND gates using universal gates. (5) (ii) Write a brief note on the basic operation of TTL NAND gate. (8) 3. (i) Compare & contrast the features of TTL & CMOS logic families. (5) (ii)analyze the basic rules (laws) that are used in Boolean expressions with example. (8)

3 4. Evaluate the following Boolean expression using Boolean Algebra and draw the logic diagram. (i)t(x,y,z)= X Y) X Y Z XY X Z (. (7) (ii) XYZ XYZ XY (3) (iii) XYZ XZ YZ (3) 5. (i) Convert the following function into product of max-terms. F(A,B,C)= ( A B)( B C)( A C) (3) (ii) Using Quine Mc-Cluskey method, examine the given function. F(A,B,C,D)= m (1,2,3,7,8,9,1011,14,15). (10) 6. (i) Using K-map method, Simplify the following Boolean function F= m(0,2,3,6,7) + d(8,10,11,15) and obtain (8) (a) minimal SOP and (b) minimal POS expression & realize using only NAND and NOR gates. (ii) Explain Tri-state TTL inverter circuit diagram and its operation. (5) 7. (i)draw the multilevel two input NAND circuit for the following expression: F ( AB CD) E BC ( A B) (3) (ii) How would you express the Boolean function using K-map and draw the logic diagram F(w,x,y,z)= m (0,1,2,4,5,6,8,9,12,13,14). (10) 8. (i) Simplify the following function using K map, F=ABCD+AB C D +AB C+AB & realize the SOP using only NAND gates and POS using only NOR gates. (8) (ii) Simplify the logic circuit shown in figure (5) 9. Explain the minimization of the given Boolean function using Quine-Mc-Cluskey method F= m (0,1,2,5,7,8,9,10,13,15).Realize the simplified function using logic gates. (13)

4 10. (i) Explain the implement of the following function using NAND and inverter gates F=AB+A B +B C. (5) (ii) Using K-map method, simplify the given Boolean function and obtain minimum POS expression. X= m ( 1,3,5,7,9) d(8,11,15). (8) 11. (i) Given Y(A,B,C,D)= M (0,1,3,5,6,7,10,14,15), Draw the K-Map and Obtain the simplified expression. Design the minimum expression using basic gates. (8) (ii) Construct the expression Y(A,B,C)= M (0,2,4,5,6 ) using only NOR-NOR logic. (5) 12. Develop the following Function using Tabulation method Y(A,B,C,D)= m(0,1,2,5,6,7,8,9,10,14) and implement using only NAND gates. (13) 13. Interpret the given Boolean function F(A,B,C,D)= m(0,1,2,5,8,9,10) into (i) Sum of products form (5) (ii) Product of sum form and implement it using basic gates. (8) 14. (i) Develop the given function using K-map and obtain the simplified expression. Y= m (3,6,7,8,10,12,14,17,19,20,21,24,25,27,28). (7) (ii) Solve by perfect induction (6) (a) A+AB = A (b) A(A+B) = A (c) A+A B = A+B and (d) A(A +B) =AB PART C 1. Design the given function using Quine Mc-Cluskey method and Verify your result using Kmap. F= m (0,1,2,4,5,6,8,9,12,13,14) (15) 2. (i) Develop the given function Y (M,N,O,P,Q) = m (0,2,4,6,9,13,21,23,25,29,31). Draw the K-map and Implement the simplified expression using basic gates. (8) (ii) Estimate the schematic and explain the operation of a CMOS inverter.also explain its characteristics. (7)

5 UNIT II COMBINATIONAL CIRCUITS Design procedure Half adder Full Adder Half subtractor Full subtractor Parallel binary adder, parallel binary Subtractor Fast Adder - Carry Look Ahead adder Serial Adder/Subtractor - BCD adder Binary Multiplier Binary Divider - Multiplexer/ Demultiplexer decoder - encoder parity checker parity generators code converters - Magnitude Comparator. Q.No Questions PART A BT Level Domain 1. Define Half adder and Full adder. 2. What is Priority Encoder? 3. Draw the two bit comparator circuit using logic gates. 4. Distinguish between demultiplexer and decoder 5. Construct 4-bit parallel adder/subtractor using Full adders and EXOR gates. 6. Convert a two-to-four line decoder with enable input to 1:4 demultiplexer. 7. Relate carry generate, carry propagate, sum and carry-out of a carry look ahead adder. 8. Give examples for combinational circuit (any four). 9. Sketch the Half adder circuit using NAND gates. 10. Illustrate the logic diagram of 4:1 multiplexer. 11. Evaluate the logic circuit of a 2 bit comparator. 12. Design a Half subtractor using basic gates. 13. State the function of select inputs of a MUX. 14. Develop the following function using suitable multiplexer F= Σm(0,2,5,7). 15. How would you design the logic diagram of a 2 bit multiplier? 16. Draw the logic diagram of a serial adder.

6 17. Explain a 3 bit even parity generator. 18. Describe code converter? List their types. 19. Examine a single bit magnitude comparator to compare two words A and B. 20. Convert gray code into its binary equivalent. PART B 1. Analyze the function of Binary multiplier with neat diagram using (i) Shift method. (6) (ii) Parallel multiplier. (7) 2. (i) Design a 4-bit decimal adder using 4-bit binary adders. (7) (ii) Simplify the function using multiplexer F= ( 0,1,3,4,8,9,15). (6) 3. (i) Construct full subtractor using Demultiplexer. (6) (ii) Write short note on BCD adder. (7) 4. (i) Analyze the design of a 8 x 1 multiplexer using only 2 x 1 multiplexer. (6) (ii) Formulate the following Boolean function using 4 x 1 multiplexers. F ( A, B, C, D) (1,2,3,6,7,8,11,12,14). (7) 5. (i) Draw the logic diagram of a 2-bit by 2-bit binary multiplier and explain it s operation. (6) (ii) Realize F(w, x, y, z)= Σ (1,4,6,7,8,9,10,11,15) using 8 to 1 Multiplexer. (7) 6. (i) Realize a circuit to carryout both addition and subtraction. (6) (ii) Interpret a seven segment decoder circuit to display the numbers from 0 to 3. (7) 7. How would you design (i) Full adder using demultiplexer. (7) (ii) Serial binary adder. (6) 8. Illustrate BCD to excess 3 code converter using minimum number of NAND gates. (13)

7 9. (i) Explain the working and draw the logic diagram of Binary to Octal decoder. (6) (ii) How would you design BCD to Gray code converter. Use don t care. (7) 10. (i) Demonstrate 4-bit magnitude comparator with three outputs: A>B, A=B and A<B. (7) (ii) Build a 4-bit even parity generator circuit using gates. (6) 11. (i) Give a combinational circuit that converts 4 bit Gray Code to a 4 bit binary number. Implement the circuit. (8) (ii) Develop a Full adder using decoder. (5) 12. (i) How would you design a 3:8 decoder using basic gates? (7) (ii) How would you design a binary to gray code convertor? (6) 13. (i) Examine the design of a full adder using two half adders and an OR gate. (6) (ii) Analyze the design of excess 3 to BCD code converter using minimum number of NAND gates (7) 14. (7) (i) Estimate the logic diagram of BCD-Decimal decoder and explain its operations. (8) (ii) Deduce the design of a 1:4 demultiplexer circuit. (5) PART C 1. Conclude that the carry look ahead adder is faster than a ripple carry Adder by using necessary equations. (15) 2. Create the design of a BCD to seven segment decoder with neat diagrams. (15)

8 UNIT III SEQUENTIAL CIRCUITS Latches, Flip-flops - SR, JK, D, T, and Master-Slave Characteristic table and equation Application table Edge triggering Level Triggering Realization of one flip flop using other flip flops serial adder/subtractor- Asynchronous Ripple or serial counter Asynchronous Up/Down counter - Synchronous counters Synchronous Up/Down counters Programmable counters Design of Synchronous counters: state diagram- State table State minimization State assignment - Excitation table and maps-circuit implementation - Modulo n counter, Registers shift registers - Universal shift registers Shift register counters Ring counter Shift counters - Sequence generators. PART A Q. No Questions BT Domain Level 1. Show the state diagram of MOD 10 counters. 2. Define the terms: state table and state assignment. 3. Summarize the design of 3 bit ring counter and find the mod of designed counter. 4. State setup and hold time. 5. Summarize the race around condition. How do you eliminate it? 6. Analyze the differences between latch and flip flop. 7. Build a T Flip-flop from a D Flip-flop. 8. Illustrate the logic diagram of a clocked SR flip flop. 9. State the difference between Mealy and Moore state machines. 10. Compare the logics of synchronous counter and ripple counter. 11. Point out the condition on JK FF to work as D FF. 12. Model a NAND based logic diagram of Master Slave JK FF. 13. Build the state diagram and characteristics equation of a D FF. 14. Find minimum number of flip-flops needed to design a counter of Modulus Generalize how does JK flip flop differs from SR Flip flop. 16. What is meant by programmable counter? Mention its applications.

9 17. Point out two differences between edge triggering and level triggering. 18. Distinguish and compare the asynchronous and synchronous logic. 19. How many flip-flops are required to build a binary counter that counts from 0 to 1023? 20. List out the classifications of sequential circuits PART B 1. How would you design the Sequential circuit has three flip flops A, B, and C; one input X_in ; and one output Y_out. The state diagram is shown in below figure. The circuit is to be designed by treating the unused states as don t care conditions. Analyze the circuit obtain from the design to determine the effect of the unused states. Use T flip flops in the design. (13) 2. (i) Compare the diagram of a 4-bit SISO SIPO, PIPO and PISO shift register and draw its waveforms. (8) (ii) Realize D flip-flop using SR flip-flop. (5) 3. (i) Construct and explain the working of an 4-bit Up/Down ripple counter (7) (ii) Model a synchronous MOD-5 counter and explain with waveforms. (6) BTL5

10 4. (i) Analyze the number of states reduction in the following state table, and tabulate the reduced state table. (7) Present Next State Output state X = 0 X =1 X =0 X=1 a f B 0 0 b d C 0 0 c f E 0 0 d g A 1 0 e d C 0 0 f f B 1 1 g g H 0 1 h g A 1 0 (ii) Examine a BCD ripple counter with timing diagram. (6) 5. Analyze state reduction if possible after designing a clocked synchronous sequential logic circuit using JK flip flops for the following state diagram. Use state reduction if possible. (13) 6. (i) Show the operation of universal shift register with neat block diagram. (7) (ii) Estimate the design a counter to count the sequence 0, 1, 2, 4, 5, 6,...using SR FF s. (6)

11 7. (i) Interpret design of a 3 bit synchronous counter using JK flip-flop. (10) (ii) Differentiate between a state table, characteristic table and an excitation table. (3) 8. Explain the following design of (i) A synchronous counter with states 0, 1, 2, 3, 0, 1,... using JK flip flop. (7) (ii) A JK FF using a D FF, a 2:1 Multiplexer and an inverter. (6) 9. (i) Use T flip-flop to design counter with the following repeated binary sequence 0, 4, 7, 2, 3. (8) (ii) Realize JK Flip Flop using SR Flip Flop (5) 10. (i) Illustrate with diagram an asynchronous decade counter & its operation with neat waveforms. (7) (ii) Predict the design of a synchronous 3-bit counter which counts in the sequence 1, 3, 2, 6, 7, 5, 4, (repeat ) 1, 3... using T FF. (6) 11. Create the design of a clocked sequential machine using JK Flip Flops for the state diagram shown in figure. Use state reduction if possible and make proper state assignment. (13)

12 12. (i) Paraphrase the operation of master/slave Flip Flop and show how the race around condition is eliminated? (7) (ii) Deduce a clocked synchronous sequential machine using T flip flops for the following state diagram. Use state reduction if possible.also use straight binary state assignment. (6) 13. (i) Using D flip-flop, Design a synchronous counter which counts in the sequence 000,001,010,011,100,101,110,111,000. (10) (ii) Discuss the working of 4 bit Johnson counter with neat diagram. (3) 14. (i) Point out a sequence detector design which detects the sequence using D flip flop. (7) (ii) Enumerate about Triggering of Flip-Flop. (6) PART C 1. Design a sequence detector which detects the sequence using D flip flop? (15) 2. Explain the functions with the state diagram and characteristics equation of T FF, D FF and JK FF and compare and contrast among the FFs? (15)

13 UNIT IV MEMORY DEVICES Classification of memories ROM - ROM organization - PROM EPROM EEPROM EAPROM, RAM RAM organization Write operation Read operation Memory cycle - Timing wave forms Memory decoding memory expansion Static RAM Cell- Bipolar RAM cell MOSFET RAM cell Dynamic RAM cell Programmable Logic Devices Programmable Logic Array (PLA) - Programmable Array Logic (PAL) Field Programmable Gate Arrays (FPGA) - Implementation of combinational logic circuits using ROM, PLA, PAL. PART A Q. No Questions BT Level Domain 1. Compare and contrast static RAM and dynamic RAM. 2. Describe briefly memory decoding. 3. Point out the advantages of RAM. 4. How read and write operations are done. 5. Distinguish between volatile and non-volatile memory. 6. Define memory expansion and Mention its limit. 7. Show the implementation of Y= AB A. 8. List out the advantages of PLDs. 9. Classify the different types of programmable logic device. 10. State access time and cycle time of a memory. 11. Classify the memories. 12. What is programmable logic array? How it differs from ROM? 13. Implement the function F1= (0, 1, 2, 5, 7) and F2 = (1, 2, 4, 6) using PROM. 14. Enumerate about EPROM. 15. Generalize the implementation of 2bit multiplier using ROM. 16. Formulate the implementation of Ex OR function using PROM. 17. Explain the advantages of EEPROM over EPROM. 18. Describe various features of PROM, PAL and PLA. 19. Differentiate between PAL and PLA. 20. How the bipolar RAM cell is different from MOSFET RAM cell?

14 PART B 1. (i) Describe read cycle and write cycle timing parameter with the help of timing diagram. (7) (ii) Construct a combinational circuit is defined as the function F1 = AB C +AB C+ABC and F2 = A BC+AB C+ABC. Implement the digital circuit with a PLA having 3 inputs, 3 product terms and 2 outputs. (6) 2. (i) Classify the types of PLDs and write notes on PLDs (7) (ii) Implement the following Boolean function using PLA, F1(x, y, z) = (0, 1, 3, 5) and F2(x, y, z) = (3, 5, 7). (6) 3. (i) Demonstrate the realization of the following function using PAL F1(x, y, z) = (1, 2, 4, 5, 7). And F2(x, y, z) = (0,1,3,5,7). (7) (ii) Write a note on FPGA with neat diagram. (6) accepts a three bit number and outputs a binary number equal to 4. (i) Paraphrase the various features of RAM organization. (7) (ii) Analyze a combinational circuit using ROM. The circuit the square of the input number. (6) 5. Create the design of BCD to Excess 3 using PLA? (13) 6. (i) Demonstrate the classification of semiconductor memories (7) (ii) Manipulate the following function using PLA F1= (2, 4, 5, 10, 12, 13, 14) and F2 = (2, 9, 10, 11, 13, 14, 15). (6) 7. (i) Discuss the basic concepts and the principle of operation of Bipolar SRAM cell. (7) How can one make 64 8 ROM using 32 4 ROMs? Draw such a circuit & explain. (6) 8. How can you create the design of 32 8 ROM and give an explanation about it? (13) 9. (i) Describe the implementation of Binary to Gray code converter using PROM devices. (7) (ii) Realize the following function using PLA F (w, x, y, z) = Π (0, 3, 5, 7, 12, 15) + d (2, 9). (6) 10. (i) Explain the implementation of function F1 = A B +AC and F2= (AC +AB +BC) with a PLA circuit. (7) (ii) Write short notes on EPROM and EEPROM. (6) 11. (i) Compare types of ROMs and explain a short note on RAM, (8) (ii) Implement the following function using PLA F1= (0, 1, 2, 4) and F2 = (0, 5, 6, 7). (5)

15 12. Recognize the implementation of the following Boolean functions 13. using PAL. (13) i. W(A,B,C,D)= (0,2, 6,7,8,9,12,13) ii. X(A,B,C,D)= (0, 2, 6, 7, 8, 9, 12, 13, 14) iii. Y(A, B, C, D) = ( 2, 3, 8, 9, 10, 12, 13) iv. Z(A,B,C,D)= (1, 3, 4, 6, 9, 12, 14) (i) Examine the structure of PLA and PAL. (7) (ii) Quote how a combinational logic function is implemented in PAL and PLA. Explain with example. (6) 14. (i) Explain EAPROM and static RAM cell using MOSFET? (5) (ii) Recognize 512 X 8 ROM using eight 64x8 ROM chips with an enable input and a decoder? (8) PART C 1. Design a combinational circuit using a ROM. The circuit accepts a three bit number and outputs a binary number equal to the square of the input number. (15) 2. (i) Interpret how does Programmable logic devices differ from FPGA? (8) (ii) Formulate the implementation of the following functions with PLA having three inputs, four product terms, and two outputs. (7). F1 (A, B, C) = (3, 5, 6, 7) F2 (A, B, C) = (0, 2, 4, 7)

16 UNIT V SYNCHRONOUS AND ASYNCHRONOUS SEQUENTIAL CIRCUITS Synchronous Sequential Circuits: General Model Classification Design Use of Algorithmic State Machine Analysis of Synchronous Sequential Circuits. Asynchronous Sequential Circuits: Design of fundamental mode and pulse mode circuits Incompletely specified State Machines Problems in Asynchronous Circuits Design of Hazard Free Switching circuits. Design of Combinational and Sequential circuits using VERILOG. PART A Q. No Questions BT Level Domain 1. State flow table and primitive flow table. 2. Classify Asynchronous sequential circuits. 3. Inspect the Concept of Merger graphs. 4. Build a Verilog HDL model for half subtractor circuit. 5. Show the basic building blocks of an Algorithmic State Machine chart. 6. Distinguish between stable and unstable state. 7. Write a Verilog behavioral model of a Transparent flip flop with reset input. 8. Define the terms race and critical race. 9. Apply gate level model to write a Verilog code for 4-to-2 Encoder. 10. What are Hazards? How it can be avoided? 11. Compare the ASM chart with a conventional flow chart. 12. Compile fundamental mode and pulse mode asynchronous sequential circuits. 13. List out the causes of essential Hazard. 14. Construct a Verilog model of a half adder circuit. 15. Explain the analysis procedure of synchronous sequential circuits. 16. Name the problems that arise in asynchronous circuits. 17. Model a D flip flop using Verilog List the types of Hazards that exist in asynchronous sequential circuits. Interpret critical race and give the methods for critical-race free state assignment.

17 20. What is most important consideration in making state assignment for asynchronous network? PART B 1. Design an asynchronous sequential circuit with 2 inputs T and C. The output attains a value of 1 when T=1 and C moves from 1 to 0. Otherwise the output is 0. (13) 2. (i) What are the types of hazards? Check whether the following circuit contains a hazard or not Y = x1x2 + x2 x3.if the hazard is present, demonstrate its removal. (8) (ii) Describe Moore and Mealy machines with block diagram (5) Derive the transition table, state table and state diagram for Moore sequential circuit shown in below figure. (13) (i) What is a Hazard? Give hazard free realization for the following Boolean function. F(A, B, C, D) = m(0, 2, 6, 7, 8, 10, 12). (8) (ii) Find the ASM chart for binary multiplier. (5) 5. Summarize the various problems arises in an asynchronous sequential circuits. Explain any two problems in detail. (13) 6. Construct the state table and state diagram of the sequential circuit shown in below figure. Explain the function that the circuit performs. (13)

18 7. (i) Demonstrate a sequential pattern detector that receives a stream of input bits. The circuit should recognize the pattern 010 and produce an output whenever this pattern is received. (10) (ii) When is a sequential machine set to be strongly connected? (3) Analyze the given synchronous sequential circuit shown in below figure. (13) (i) Evaluate and test Full adder and JK Flip-flop with Verilog code. (7) (ii) Explain the different types of Hazards. Design Hazard free circuits for Y=X1X2+X2 Y. (6) Using Verilog model for the given logic (i) 3:8 decoder. (7) (ii) 2 bit Up/Down synchronous counter. (6) (i) Build a full adder using Two Half adders by writing Verilog program. (8) (ii) Write explanatory notes on algorithmic state machines. (5) 12. (i) For the state diagram shown in below figure, model a synchronous

19 sequential circuit using JK flip flops. (10) (ii) What is ASM? Give the basic notations. (3) Classify the methods of Race Free State assignment and explain in detail. (13) (i) What are static and dynamic hazards? Give static 0 hazard free realizations for the following Boolean function. F(A, B, C, D) = ΠM(3, 4, 5, 7, 9, 13, 14, 15). (10) (ii) Write the design procedure for Asynchronous sequential logic circuits. (3) PART C Propose a design of T flip flop using logic gates. Derive the state table, state diagram, primitive flow table, transition table and Merger graph. Draw the logic circuit. (15) Deduce the transition table, state table and state diagram for the moore sequential circuit given below. (15) 2.

1. Realization of gates using Universal gates

1. Realization of gates using Universal gates 1. Realization of gates using Universal gates Aim: To realize all logic gates using NAND and NOR gates. Apparatus: S. No Description of Item Quantity 1. IC 7400 01 2. IC 7402 01 3. Digital Trainer Kit

More information

LOGIC DESIGN LABORATORY MANUAL

LOGIC DESIGN LABORATORY MANUAL LOGIC DESIGN LABORATORY MANUAL Logic Design Laboratory Manual 1 EXPERIMENT: 1 LOGIC GATES AIM: To study and verify the truth table of logic gates LEARNING OBJECTIVE: Identify various ICs and their specification.

More information

LAB MANUAL SUBJECT: DIGITAL LOGIC DESIGN AND APPLICATIONS SE (COMPUTERS) SEM III

LAB MANUAL SUBJECT: DIGITAL LOGIC DESIGN AND APPLICATIONS SE (COMPUTERS) SEM III LAB MANUAL SUBJECT: DIGITAL LOGIC DESIGN AND APPLICATIONS SE (COMPUTERS) SEM III 1 INDEX Sr. No Title of the Experiment 1 Study of BASIC Gates 3 2 Universal Gates 6 3 Study of Full & Half Adder & Subtractor

More information

2012-13 Department of Electronics & Communication

2012-13 Department of Electronics & Communication (A constituent college of Sri Siddhartha University) 2012-13 Department of Electronics & Communication LOGIC DESIGN LAB MANUAL III SEM BE Name : Sem :. Sec: Logic Design Lab Manual Contents Exp No Title

More information

DIGITAL SYSTEM DESIGN LAB

DIGITAL SYSTEM DESIGN LAB EXPERIMENT NO: 7 STUDY OF FLIP FLOPS USING GATES AND IC S AIM: To verify various flip-flops like D, T, and JK. APPARATUS REQUIRED: Power supply, Digital Trainer kit, Connecting wires, Patch Chords, IC

More information

Lab Manual. Digital System Design (Pr): COT-215 Digital Electronics (P): IT-211

Lab Manual. Digital System Design (Pr): COT-215 Digital Electronics (P): IT-211 Lab Manual Digital System Design (Pr): COT-215 Digital Electronics (P): IT-211 Lab Instructions Several practicals / programs? Whether an experiment contains one or several practicals /programs One practical

More information

Digital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng

Digital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng Digital Logic Design Basics Combinational Circuits Sequential Circuits Pu-Jen Cheng Adapted from the slides prepared by S. Dandamudi for the book, Fundamentals of Computer Organization and Design. Introduction

More information

Chapter - 5 FLIP-FLOPS AND SIMPLE FLIP-FLOP APPLICATIONS

Chapter - 5 FLIP-FLOPS AND SIMPLE FLIP-FLOP APPLICATIONS Chapter - 5 FLIP-FLOPS AND SIMPLE FLIP-FLOP APPLICATIONS Introduction : Logic circuit is divided into two types. 1. Combinational Logic Circuit 2. Sequential Logic Circuit Definition : 1. Combinational

More information

2 hrs lecture 2 hrs lab 2 hrs section

2 hrs lecture 2 hrs lab 2 hrs section Arab Academy for Science and Technology & Maritime Transport University/Academy: Arab Academy for Science and Technology & Maritime Transport Faculty/Institute: College of Computing and Information Technology

More information

VIDYARTHIPLUS - Anna University Students Online Community CS-6201-DIGITAL PRINCIPLE AND SYSTEM DESIGN TWO MARKS II-SEMESTER ANNA UNIVERSITY REGULATIONS 2013 UNIT I BOOLEAN ALGEBRA AND LOGIC GATES 1. Define

More information

DEPARTMENT OF INFORMATION TECHNLOGY

DEPARTMENT OF INFORMATION TECHNLOGY DRONACHARYA GROUP OF INSTITUTIONS, GREATER NOIDA Affiliated to Mahamaya Technical University, Noida Approved by AICTE DEPARTMENT OF INFORMATION TECHNLOGY Lab Manual for Computer Organization Lab ECS-453

More information

SECTION C [short essay] [Not to exceed 120 words, Answer any SIX questions. Each question carries FOUR marks] 6 x 4=24 marks

SECTION C [short essay] [Not to exceed 120 words, Answer any SIX questions. Each question carries FOUR marks] 6 x 4=24 marks UNIVERSITY OF KERALA First Degree Programme in Computer Applications Model Question Paper Semester I Course Code- CP 1121 Introduction to Computer Science TIME : 3 hrs Maximum Mark: 80 SECTION A [Very

More information

RAM & ROM Based Digital Design. ECE 152A Winter 2012

RAM & ROM Based Digital Design. ECE 152A Winter 2012 RAM & ROM Based Digital Design ECE 152A Winter 212 Reading Assignment Brown and Vranesic 1 Digital System Design 1.1 Building Block Circuits 1.1.3 Static Random Access Memory (SRAM) 1.1.4 SRAM Blocks in

More information

Digital Electronics Part I Combinational and Sequential Logic. Dr. I. J. Wassell

Digital Electronics Part I Combinational and Sequential Logic. Dr. I. J. Wassell Digital Electronics Part I Combinational and Sequential Logic Dr. I. J. Wassell Introduction Aims To familiarise students with Combinational logic circuits Sequential logic circuits How digital logic gates

More information

BOOLEAN ALGEBRA & LOGIC GATES

BOOLEAN ALGEBRA & LOGIC GATES BOOLEAN ALGEBRA & LOGIC GATES Logic gates are electronic circuits that can be used to implement the most elementary logic expressions, also known as Boolean expressions. The logic gate is the most basic

More information

Modeling Sequential Elements with Verilog. Prof. Chien-Nan Liu TEL: 03-4227151 ext:34534 Email: jimmy@ee.ncu.edu.tw. Sequential Circuit

Modeling Sequential Elements with Verilog. Prof. Chien-Nan Liu TEL: 03-4227151 ext:34534 Email: jimmy@ee.ncu.edu.tw. Sequential Circuit Modeling Sequential Elements with Verilog Prof. Chien-Nan Liu TEL: 03-4227151 ext:34534 Email: jimmy@ee.ncu.edu.tw 4-1 Sequential Circuit Outputs are functions of inputs and present states of storage elements

More information

Digital Electronics Detailed Outline

Digital Electronics Detailed Outline Digital Electronics Detailed Outline Unit 1: Fundamentals of Analog and Digital Electronics (32 Total Days) Lesson 1.1: Foundations and the Board Game Counter (9 days) 1. Safety is an important concept

More information

Gondwana University, Gadchiroli. Proposed Syllabus. B.Sc. II. Subject: Electronics. Semester-III & IV. Board of Studies - Electronics

Gondwana University, Gadchiroli. Proposed Syllabus. B.Sc. II. Subject: Electronics. Semester-III & IV. Board of Studies - Electronics Gondwana University, Gadchiroli Proposed Syllabus B.Sc. II Subject: Electronics Semester-III & IV Board of Studies - Electronics Gondwana University Gadchiroli Scheme of Bachelor of Science for Semester

More information

The equation for the 3-input XOR gate is derived as follows

The equation for the 3-input XOR gate is derived as follows The equation for the 3-input XOR gate is derived as follows The last four product terms in the above derivation are the four 1-minterms in the 3-input XOR truth table. For 3 or more inputs, the XOR gate

More information

Karnaugh Maps. Example A B C X 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 1 1 0 0 1 1 0 1 0 1 1 0 1 1 1 1 1. each 1 here gives a minterm e.g.

Karnaugh Maps. Example A B C X 0 0 0 0 0 0 1 0 0 1 0 0 0 1 1 1 1 0 0 1 1 0 1 0 1 1 0 1 1 1 1 1. each 1 here gives a minterm e.g. Karnaugh Maps Yet another way of deriving the simplest Boolean expressions from behaviour. Easier than using algebra (which can be hard if you don't know where you're going). Example A B C X 0 0 0 0 0

More information

ANALOG & DIGITAL ELECTRONICS

ANALOG & DIGITAL ELECTRONICS ANALOG & DIGITAL ELECTRONICS Course Instructor: Course No: PH-218 3-1-0-8 Dr. A.P. Vajpeyi E-mail: apvajpeyi@iitg.ernet.in Room No: #305 Department of Physics, Indian Institute of Technology Guwahati,

More information

Chapter 7 Memory and Programmable Logic

Chapter 7 Memory and Programmable Logic NCNU_2013_DD_7_1 Chapter 7 Memory and Programmable Logic 71I 7.1 Introduction ti 7.2 Random Access Memory 7.3 Memory Decoding 7.5 Read Only Memory 7.6 Programmable Logic Array 77P 7.7 Programmable Array

More information

CHAPTER 3 Boolean Algebra and Digital Logic

CHAPTER 3 Boolean Algebra and Digital Logic CHAPTER 3 Boolean Algebra and Digital Logic 3.1 Introduction 121 3.2 Boolean Algebra 122 3.2.1 Boolean Expressions 123 3.2.2 Boolean Identities 124 3.2.3 Simplification of Boolean Expressions 126 3.2.4

More information

Module 3: Floyd, Digital Fundamental

Module 3: Floyd, Digital Fundamental Module 3: Lecturer : Yongsheng Gao Room : Tech - 3.25 Email : yongsheng.gao@griffith.edu.au Structure : 6 lectures 1 Tutorial Assessment: 1 Laboratory (5%) 1 Test (20%) Textbook : Floyd, Digital Fundamental

More information

Karnaugh Maps & Combinational Logic Design. ECE 152A Winter 2012

Karnaugh Maps & Combinational Logic Design. ECE 152A Winter 2012 Karnaugh Maps & Combinational Logic Design ECE 52A Winter 22 Reading Assignment Brown and Vranesic 4 Optimized Implementation of Logic Functions 4. Karnaugh Map 4.2 Strategy for Minimization 4.2. Terminology

More information

Counters and Decoders

Counters and Decoders Physics 3330 Experiment #10 Fall 1999 Purpose Counters and Decoders In this experiment, you will design and construct a 4-bit ripple-through decade counter with a decimal read-out display. Such a counter

More information

l What have discussed up until now & why: l C Programming language l More low-level then Java. l Better idea about what s really going on.

l What have discussed up until now & why: l C Programming language l More low-level then Java. l Better idea about what s really going on. CS211 Computer Architecture l Topics Digital Logic l Transistors (Design & Types) l Logic Gates l Combinational Circuits l K-Maps Class Checkpoint l What have discussed up until now & why: l C Programming

More information

Practical Workbook Digital Logic Design / Logic Design & Switching Theory

Practical Workbook Digital Logic Design / Logic Design & Switching Theory Practical Workbook Digital Logic Design / Logic Design & Switching Theory Name : Year : Batch : Roll No : Department: Second edition - 2015 Dept. of Computer & Information Systems Engineering NED University

More information

Lab 1: Study of Gates & Flip-flops

Lab 1: Study of Gates & Flip-flops 1.1 Aim Lab 1: Study of Gates & Flip-flops To familiarize with circuit implementations using ICs and test the behavior of different logic gates and Flip-flops. 1.2 Hardware Requirement a. Equipments -

More information

Operating Manual Ver.1.1

Operating Manual Ver.1.1 4 Bit Binary Ripple Counter (Up-Down Counter) Operating Manual Ver.1.1 An ISO 9001 : 2000 company 94-101, Electronic Complex Pardesipura, Indore- 452010, India Tel : 91-731- 2570301/02, 4211100 Fax: 91-731-

More information

Design Example: Counters. Design Example: Counters. 3-Bit Binary Counter. 3-Bit Binary Counter. Other useful counters:

Design Example: Counters. Design Example: Counters. 3-Bit Binary Counter. 3-Bit Binary Counter. Other useful counters: Design Eample: ers er: a sequential circuit that repeats a specified sequence of output upon clock pulses. A,B,C,, Z. G, O, T, E, R, P, S,!.,,,,,,,7. 7,,,,,,,.,,,,,,,,,,,. Binary counter: follows the binary

More information

ETEC 2301 Programmable Logic Devices. Chapter 10 Counters. Shawnee State University Department of Industrial and Engineering Technologies

ETEC 2301 Programmable Logic Devices. Chapter 10 Counters. Shawnee State University Department of Industrial and Engineering Technologies ETEC 2301 Programmable Logic Devices Chapter 10 Counters Shawnee State University Department of Industrial and Engineering Technologies Copyright 2007 by Janna B. Gallaher Asynchronous Counter Operation

More information

TECHGURU CLASSES for SSC-JE/RAILWAYS/ORDINANCE

TECHGURU CLASSES for SSC-JE/RAILWAYS/ORDINANCE TECHGURU CLASSES for SSC-E/RAILWAYS/ORDINANCE DIGITAL ELECTRONICS : CHAPTER - 4 (SEUENTIAL CIRCUITS Problems on Sequential Cicuits : Flip - Flop. In sequential circuit the output state depend upon past

More information

Digital Systems Laboratory

Digital Systems Laboratory Digital Systems Laboratory Rev 1.2 Agust 2014 LIST OF EXPERIMENTS 1. INTRODUCTION TO LAB, USING MATERIALS 2. DIGITAL LOGIC GATES 3. INTRODUCTION TO PROTEUS 4. BINARY AND DECIMAL NUMBERS 5. CODE CONVERSION

More information

Tutorial 1: Chapter 1

Tutorial 1: Chapter 1 Tutorial 1: hapter 1 1. Figure 1.1 shows the positive edge triggered D flip flop, determine the output of Q 0, assume output is initially LOW. Figure 1.1 2. For the positive edge-triggered J-K flip-flop

More information

Course Requirements & Evaluation Methods

Course Requirements & Evaluation Methods Course Title: Logic Circuits Course Prefix: ELEG Course No.: 3063 Sections: 01 & 02 Department of Electrical and Computer Engineering College of Engineering Instructor Name: Justin Foreman Office Location:

More information

BINARY CODED DECIMAL: B.C.D.

BINARY CODED DECIMAL: B.C.D. BINARY CODED DECIMAL: B.C.D. ANOTHER METHOD TO REPRESENT DECIMAL NUMBERS USEFUL BECAUSE MANY DIGITAL DEVICES PROCESS + DISPLAY NUMBERS IN TENS IN BCD EACH NUMBER IS DEFINED BY A BINARY CODE OF 4 BITS.

More information

ASYNCHRONOUS COUNTERS

ASYNCHRONOUS COUNTERS LB no.. SYNCHONOUS COUNTES. Introduction Counters are sequential logic circuits that counts the pulses applied at their clock input. They usually have 4 bits, delivering at the outputs the corresponding

More information

Asynchronous Counters. Asynchronous Counters

Asynchronous Counters. Asynchronous Counters Counters and State Machine Design November 25 Asynchronous Counters ENGI 25 ELEC 24 Asynchronous Counters The term Asynchronous refers to events that do not occur at the same time With respect to counter

More information

CONTENTS PREFACE 1 INTRODUCTION 1 2 NUMBER SYSTEMS AND CODES 25. vii

CONTENTS PREFACE 1 INTRODUCTION 1 2 NUMBER SYSTEMS AND CODES 25. vii 2006 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. This material is CONTENTS PREFACE xv 1 INTRODUCTION 1 1.1 About Digital Design 1 1.2 Analog versus Digital 3 1.3 Digital Devices

More information

DIGITAL ELECTRONICS LAB

DIGITAL ELECTRONICS LAB L AB MANUAL IV SEMESTER Department Of Electronics & Communication Engg Bhagwant university, Sikar road Ajmer LIST OF EXPERIMENTS SR. NO. NAME OF EXPERIMENT Introduction to Digital Electronics lab- nomenclature

More information

4 BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION

4 BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION 4 BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION BOOLEAN OPERATIONS AND EXPRESSIONS Variable, complement, and literal are terms used in Boolean algebra. A variable is a symbol used to represent a logical quantity.

More information

Chapter 2 Digital Components. Section 2.1 Integrated Circuits

Chapter 2 Digital Components. Section 2.1 Integrated Circuits Chapter 2 Digital Components Section 2.1 Integrated Circuits An integrated circuit (IC) is a small silicon semiconductor crystal, called a chip, containing the electronic components for the digital gates

More information

Module-3 SEQUENTIAL LOGIC CIRCUITS

Module-3 SEQUENTIAL LOGIC CIRCUITS Module-3 SEQUENTIAL LOGIC CIRCUITS Till now we studied the logic circuits whose outputs at any instant of time depend only on the input signals present at that time are known as combinational circuits.

More information

LABORATORY MODULE. EKT 121/4 Digital Electronics I

LABORATORY MODULE. EKT 121/4 Digital Electronics I LABORATORY MODULE EKT 121/4 Digital Electronics I Mohd. Najmuddin Mohd. Hassan Zahereel Ishwar Abdul Khalib Mohammad Nazri Md. Noor Rafikha Aliana A.Raof School of Computer & Communications Engineering

More information

Digital Logic Design Laboratory

Digital Logic Design Laboratory Digital Logic Design Laboratory EE2731 Gabriel Augusto Marques Tarquinio de Souza Department of Electrical and Computer Engineering Louisiana State University and Agricultural and Mechanical College Baton

More information

DR. BABASAHEB AMBEDKAR

DR. BABASAHEB AMBEDKAR DR. BABASAHEB AMBEDKAR MARATHWADA UNIVERSITY, AURANGABAD SYLLABUS B.Sc. FIRST & SECOND SEMESTER [ELECTRONICS (OPTIONAL)] {Effective from June- 2009 onwards} B.Sc. Electronics (Optional) Course Structure

More information

Latches, the D Flip-Flop & Counter Design. ECE 152A Winter 2012

Latches, the D Flip-Flop & Counter Design. ECE 152A Winter 2012 Latches, the D Flip-Flop & Counter Design ECE 52A Winter 22 Reading Assignment Brown and Vranesic 7 Flip-Flops, Registers, Counters and a Simple Processor 7. Basic Latch 7.2 Gated SR Latch 7.2. Gated SR

More information

Sequential Logic Design

Sequential Logic Design Lab #4 Sequential Logic Design Objective: To study the behavior and applications of flip flops and basic sequential circuits including shift registers and counters. Preparation: Read the following experiment.

More information

Experiment # 9. Clock generator circuits & Counters. Eng. Waleed Y. Mousa

Experiment # 9. Clock generator circuits & Counters. Eng. Waleed Y. Mousa Experiment # 9 Clock generator circuits & Counters Eng. Waleed Y. Mousa 1. Objectives: 1. Understanding the principles and construction of Clock generator. 2. To be familiar with clock pulse generation

More information

United States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1

United States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1 United States Naval Academy Electrical and Computer Engineering Department EC262 Exam 29 September 2. Do a page check now. You should have pages (cover & questions). 2. Read all problems in their entirety.

More information

To design digital counter circuits using JK-Flip-Flop. To implement counter using 74LS193 IC.

To design digital counter circuits using JK-Flip-Flop. To implement counter using 74LS193 IC. 8.1 Objectives To design digital counter circuits using JK-Flip-Flop. To implement counter using 74LS193 IC. 8.2 Introduction Circuits for counting events are frequently used in computers and other digital

More information

Two-level logic using NAND gates

Two-level logic using NAND gates CSE140: Components and Design Techniques for Digital Systems Two and Multilevel logic implementation Tajana Simunic Rosing 1 Two-level logic using NND gates Replace minterm ND gates with NND gates Place

More information

Shift registers. 1.0 Introduction

Shift registers. 1.0 Introduction Shift registers 1.0 Introduction Shift registers are a type of sequential logic circuit, mainly for storage of digital data. They are a group of flip-flops connected in a chain so that the output from

More information

CSE140: Components and Design Techniques for Digital Systems

CSE140: Components and Design Techniques for Digital Systems CSE4: Components and Design Techniques for Digital Systems Tajana Simunic Rosing What we covered thus far: Number representations Logic gates Boolean algebra Introduction to CMOS HW#2 due, HW#3 assigned

More information

Module 4 : Propagation Delays in MOS Lecture 20 : Analyzing Delay in few Sequential Circuits

Module 4 : Propagation Delays in MOS Lecture 20 : Analyzing Delay in few Sequential Circuits Module 4 : Propagation Delays in MOS Lecture 20 : Analyzing Delay in few Sequential Circuits Objectives In this lecture you will learn the delays in following circuits Motivation Negative D-Latch S-R Latch

More information

Upon completion of unit 1.1, students will be able to

Upon completion of unit 1.1, students will be able to Upon completion of unit 1.1, students will be able to 1. Demonstrate safety of the individual, class, and overall environment of the classroom/laboratory, and understand that electricity, even at the nominal

More information

Programmable Logic Devices (PLDs)

Programmable Logic Devices (PLDs) Programmable Logic Devices (PLDs) Lesson Objectives: In this lesson you will be introduced to some types of Programmable Logic Devices (PLDs): PROM, PAL, PLA, CPLDs, FPGAs, etc. How to implement digital

More information

BELS Digital IC Report

BELS Digital IC Report CMOS Digital IC Report 74HC00, Quad 2-Input NAND Gate DIP-14 3 - A 500 0.24 74HCT00, Quad 2-Input NAND Gate DIP-14 3 - A 501 0.36 74HC02, Quad 2 Input NOR DIP-14 3 - A 417 0.24 74HC04, Hex Inverter, buffered

More information

IE1204 Digital Design F12: Asynchronous Sequential Circuits (Part 1)

IE1204 Digital Design F12: Asynchronous Sequential Circuits (Part 1) IE1204 Digital Design F12: Asynchronous Sequential Circuits (Part 1) Elena Dubrova KTH / ICT / ES dubrova@kth.se BV pp. 584-640 This lecture IE1204 Digital Design, HT14 2 Asynchronous Sequential Machines

More information

Combinational Logic Design Process

Combinational Logic Design Process Combinational Logic Design Process Create truth table from specification Generate K-maps & obtain logic equations Draw logic diagram (sharing common gates) Simulate circuit for design verification Debug

More information

Unit 4 Session - 15 Flip-Flops

Unit 4 Session - 15 Flip-Flops Objectives Unit 4 Session - 15 Flip-Flops Usage of D flip-flop IC Show the truth table for the edge-triggered D flip-flop and edge-triggered JK flip-flop Discuss some of the timing problems related to

More information

List of Experiment. 8. To study and verify the BCD to Seven Segments DECODER.(IC-7447).

List of Experiment. 8. To study and verify the BCD to Seven Segments DECODER.(IC-7447). G. H. RAISONI COLLEGE OF ENGINEERING, NAGPUR Department of Electronics & Communication Engineering Branch:-4 th Semester[Electronics] Subject: - Digital Circuits List of Experiment Sr. Name Of Experiment

More information

2.0 Chapter Overview. 2.1 Boolean Algebra

2.0 Chapter Overview. 2.1 Boolean Algebra Thi d t t d ith F M k 4 0 2 Boolean Algebra Chapter Two Logic circuits are the basis for modern digital computer systems. To appreciate how computer systems operate you will need to understand digital

More information

Combinational Logic Design

Combinational Logic Design Chapter 4 Combinational Logic Design The foundations for the design of digital logic circuits were established in the preceding chapters. The elements of Boolean algebra (two-element switching algebra

More information

Digital Logic: Boolean Algebra and Gates

Digital Logic: Boolean Algebra and Gates Digital Logic: Boolean Algebra and Gates Textbook Chapter 3 CMPE2 Summer 28 Basic Logic Gates CMPE2 Summer 28 Slides by ADB 2 Truth Table The most basic representation of a logic function Lists the output

More information

ENEE 244 (01**). Spring 2006. Homework 5. Due back in class on Friday, April 28.

ENEE 244 (01**). Spring 2006. Homework 5. Due back in class on Friday, April 28. ENEE 244 (01**). Spring 2006 Homework 5 Due back in class on Friday, April 28. 1. Fill up the function table (truth table) for the following latch. How is this latch related to those described in the lectures

More information

Operating Manual Ver.1.1

Operating Manual Ver.1.1 Flip-Flops Operating Manual Ver.1.1 An ISO 9001 : 2000 company 94-101, Electronic Complex Pardesipura, Indore- 452010, India Tel : 91-731- 2570301/02, 4211100 Fax: 91-731- 2555643 e mail : info@scientech.bz

More information

1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.

1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1. File: chap04, Chapter 04 1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1. 2. True or False? A gate is a device that accepts a single input signal and produces one

More information

Chapter 14 Sequential logic, Latches and Flip-Flops

Chapter 14 Sequential logic, Latches and Flip-Flops Chapter 14 Sequential logic, Latches and Flip-Flops Flops Lesson 2 Sequential logic circuit, Flip Flop and Latch Introduction Ch14L2--"Digital Principles and Design", Raj Kamal, Pearson Education, 2006

More information

Lecture 8: Flip-flops

Lecture 8: Flip-flops Points Addressed in this Lecture Properties of synchronous and asynchronous sequential circuits Overview of flip-flops and latches Lecture 8: Flip-flops Professor Peter Cheung Department of EEE, Imperial

More information

Counters & Shift Registers Chapter 8 of R.P Jain

Counters & Shift Registers Chapter 8 of R.P Jain Chapter 3 Counters & Shift Registers Chapter 8 of R.P Jain Counters & Shift Registers Counters, Syllabus Design of Modulo-N ripple counter, Up-Down counter, design of synchronous counters with and without

More information

Read-only memory Implementing logic with ROM Programmable logic devices Implementing logic with PLDs Static hazards

Read-only memory Implementing logic with ROM Programmable logic devices Implementing logic with PLDs Static hazards Points ddressed in this Lecture Lecture 8: ROM Programmable Logic Devices Professor Peter Cheung Department of EEE, Imperial College London Read-only memory Implementing logic with ROM Programmable logic

More information

Digital Systems Based on Principles and Applications of Electrical Engineering/Rizzoni (McGraw Hill

Digital Systems Based on Principles and Applications of Electrical Engineering/Rizzoni (McGraw Hill Digital Systems Based on Principles and Applications of Electrical Engineering/Rizzoni (McGraw Hill Objectives: Analyze the operation of sequential logic circuits. Understand the operation of digital counters.

More information

CSE140: Midterm 1 Solution and Rubric

CSE140: Midterm 1 Solution and Rubric CSE140: Midterm 1 Solution and Rubric April 23, 2014 1 Short Answers 1.1 True or (6pts) 1. A maxterm must include all input variables (1pt) True 2. A canonical product of sums is a product of minterms

More information

Digital Systems CCPS1573

Digital Systems CCPS1573 1. Name of Course 2. Course Code 3. Name(s) of academic staff 4. Rationale for the inclusion of the course/module in the programme Digital Systems CCPS1573 Faculty This module provides foundation knowledge

More information

Counters are sequential circuits which "count" through a specific state sequence.

Counters are sequential circuits which count through a specific state sequence. Counters Counters are sequential circuits which "count" through a specific state sequence. They can count up, count down, or count through other fixed sequences. Two distinct types are in common usage:

More information

Simplifying Logic Circuits with Karnaugh Maps

Simplifying Logic Circuits with Karnaugh Maps Simplifying Logic Circuits with Karnaugh Maps The circuit at the top right is the logic equivalent of the Boolean expression: f = abc + abc + abc Now, as we have seen, this expression can be simplified

More information

DIGITAL ELECTRONICS. Counters. By: Electrical Engineering Department

DIGITAL ELECTRONICS. Counters. By: Electrical Engineering Department Counters By: Electrical Engineering Department 1 Counters Upon completion of the chapter, students should be able to:.1 Understand the basic concepts of asynchronous counter and synchronous counters, and

More information

WEEK 8.1 Registers and Counters. ECE124 Digital Circuits and Systems Page 1

WEEK 8.1 Registers and Counters. ECE124 Digital Circuits and Systems Page 1 WEEK 8.1 egisters and Counters ECE124 igital Circuits and Systems Page 1 Additional schematic FF symbols Active low set and reset signals. S Active high set and reset signals. S ECE124 igital Circuits

More information

University of St. Thomas ENGR 230 ---- Digital Design 4 Credit Course Monday, Wednesday, Friday from 1:35 p.m. to 2:40 p.m. Lecture: Room OWS LL54

University of St. Thomas ENGR 230 ---- Digital Design 4 Credit Course Monday, Wednesday, Friday from 1:35 p.m. to 2:40 p.m. Lecture: Room OWS LL54 Fall 2005 Instructor Texts University of St. Thomas ENGR 230 ---- Digital Design 4 Credit Course Monday, Wednesday, Friday from 1:35 p.m. to 2:40 p.m. Lecture: Room OWS LL54 Lab: Section 1: OSS LL14 Tuesday

More information

Flip-Flops and Sequential Circuit Design. ECE 152A Winter 2012

Flip-Flops and Sequential Circuit Design. ECE 152A Winter 2012 Flip-Flops and Sequential Circuit Design ECE 52 Winter 22 Reading ssignment Brown and Vranesic 7 Flip-Flops, Registers, Counters and a Simple Processor 7.5 T Flip-Flop 7.5. Configurable Flip-Flops 7.6

More information

Flip-Flops and Sequential Circuit Design

Flip-Flops and Sequential Circuit Design Flip-Flops and Sequential Circuit Design ECE 52 Winter 22 Reading ssignment Brown and Vranesic 7 Flip-Flops, Registers, Counters and a Simple Processor 7.5 T Flip-Flop 7.5. Configurable Flip-Flops 7.6

More information

Sequential Circuit Design

Sequential Circuit Design Sequential Circuit Design Lan-Da Van ( 倫 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 2009 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines

More information

CpE358/CS381. Switching Theory and Logical Design. Class 10

CpE358/CS381. Switching Theory and Logical Design. Class 10 CpE358/CS38 Switching Theory and Logical Design Class CpE358/CS38 Summer- 24 Copyright 24-373 Today Fundamental concepts of digital systems (Mano Chapter ) Binary codes, number systems, and arithmetic

More information

DIGITAL TECHNICS. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute 5. LECTURE: SEQUENTIAL CIRCUITS BASICS AND FLIP-FLOPS

DIGITAL TECHNICS. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute 5. LECTURE: SEQUENTIAL CIRCUITS BASICS AND FLIP-FLOPS DIGITAL TECHNICS Dr. Bálint Pődör Óbuda University, Microelectronics and Technology Institute 5. LECTURE: SEQUENTIAL CIRCUITS BASICS AND FLIP-FLOPS 1st (Autumn) term 2014/2015 5. LECTURE 1. Sequential

More information

DIGITAL TECHNICS II. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute. 2nd (Spring) term 2012/2013

DIGITAL TECHNICS II. Dr. Bálint Pődör. Óbuda University, Microelectronics and Technology Institute. 2nd (Spring) term 2012/2013 DIGITAL TECHNICS II Dr. Bálint Pődör Óbuda University, Microelectronics and Technology Institute 4. LECTURE: COUNTERS AND RELATED 2nd (Spring) term 2012/2013 1 4. LECTURE: COUNTERS AND RELATED 1. Counters,

More information

Contents COUNTER. Unit III- Counters

Contents COUNTER. Unit III- Counters COUNTER Contents COUNTER...1 Frequency Division...2 Divide-by-2 Counter... 3 Toggle Flip-Flop...3 Frequency Division using Toggle Flip-flops...5 Truth Table for a 3-bit Asynchronous Up Counter...6 Modulo

More information

Standart TTL, Serie 74... Art.Gruppe 13.15. 1...

Standart TTL, Serie 74... Art.Gruppe 13.15. 1... Standart TTL, Serie 74... Art.Gruppe 13.15. 1... Standart TTL, Serie 74... 7400 Quad 2-Input Nand Gate (TP) DIL14 7402 Quad 2 Input Nor Gate (TP) DIL14 7403 Quad 2 Input Nand Gate (OC) DIL14 7404 Hex Inverter

More information

Combinational Logic Circuits

Combinational Logic Circuits Chapter 2 Combinational Logic Circuits J.J. Shann Chapter Overview 2-1 Binary Logic and Gates 2-2 Boolean Algebra 2-3 Standard Forms 2-4 Two-Level Circuit Optimization 2-5 Map Manipulation 補 充 資 料 :Quine-McCluskey

More information

Sequential Circuits. Prof. MacDonald

Sequential Circuits. Prof. MacDonald Sequential Circuits Prof. MacDonald Sequential Element Review l Sequential elements provide memory for circuits heart of a state machine saving current state used to hold or pipe data data registers, shift

More information

Operating Manual Ver.1.1

Operating Manual Ver.1.1 Code Conversion Binary to Gray Gray to Binary Operating Manual Ver.1.1 An ISO 9001 : 2000 company 94-101, Electronic Complex Pardesipura, Indore- 452010, India Tel : 91-731- 2570301/02, 4211100 Fax: 91-731-

More information

Chapter 4. Gates and Circuits. Chapter Goals. Chapter Goals. Computers and Electricity. Computers and Electricity. Gates

Chapter 4. Gates and Circuits. Chapter Goals. Chapter Goals. Computers and Electricity. Computers and Electricity. Gates Chapter Goals Chapter 4 Gates and Circuits Identify the basic gates and describe the behavior of each Describe how gates are implemented using transistors Combine basic gates into circuits Describe the

More information

Chapter 6 Digital Arithmetic: Operations & Circuits

Chapter 6 Digital Arithmetic: Operations & Circuits Chapter 6 Digital Arithmetic: Operations & Circuits Chapter 6 Objectives Selected areas covered in this chapter: Binary addition, subtraction, multiplication, division. Differences between binary addition

More information

Lecture 8: Synchronous Digital Systems

Lecture 8: Synchronous Digital Systems Lecture 8: Synchronous Digital Systems The distinguishing feature of a synchronous digital system is that the circuit only changes in response to a system clock. For example, consider the edge triggered

More information

COMBINATIONAL and SEQUENTIAL LOGIC CIRCUITS Hardware implementation and software design

COMBINATIONAL and SEQUENTIAL LOGIC CIRCUITS Hardware implementation and software design PH-315 COMINATIONAL and SEUENTIAL LOGIC CIRCUITS Hardware implementation and software design A La Rosa I PURPOSE: To familiarize with combinational and sequential logic circuits Combinational circuits

More information

Digital Fundamentals

Digital Fundamentals Digital Fundamentals Tenth Edition Floyd hapter 8 2009 Pearson Education, Upper 2008 Pearson Saddle River, Education NJ 07458. All Rights Reserved ounting in Binary As you know, the binary count sequence

More information

Copyright Peter R. Rony 2009. All rights reserved.

Copyright Peter R. Rony 2009. All rights reserved. Experiment No. 1. THE DIGI DESIGNER Experiment 1-1. Socket Connections on the Digi Designer Experiment No. 2. LOGIC LEVELS AND THE 7400 QUADRUPLE 2-INPUT POSITIVE NAND GATE Experiment 2-1. Truth Table

More information

Having read this workbook you should be able to: recognise the arrangement of NAND gates used to form an S-R flip-flop.

Having read this workbook you should be able to: recognise the arrangement of NAND gates used to form an S-R flip-flop. Objectives Having read this workbook you should be able to: recognise the arrangement of NAND gates used to form an S-R flip-flop. describe how such a flip-flop can be SET and RESET. describe the disadvantage

More information

Lecture 5: Gate Logic Logic Optimization

Lecture 5: Gate Logic Logic Optimization Lecture 5: Gate Logic Logic Optimization MAH, AEN EE271 Lecture 5 1 Overview Reading McCluskey, Logic Design Principles- or any text in boolean algebra Introduction We could design at the level of irsim

More information