Scribd Logo
Upload

Welcome to Scribd!

  • 176 views

    Tutorial11 Soln

    Uploaded by

    tanmay
    This document contains instructions for 8 exercises related to digital design and circuit analysis. The exercises involve obtaining primitive and reduced flow tables from descriptions of circuits with multiple inputs and outputs. Additional tasks include designing circuits based on the flow tables, merging flow tables, obtaining state assignments, and developing transition diagrams and expanded flow tables. The focus is on asynchronous sequential circuits and ensuring race-free logic designs.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Tutorial11 Soln

    Uploaded by

    tanmay
    176 views28 pages
    This document contains instructions for 8 exercises related to digital design and circuit analysis. The exercises involve obtaining primitive and reduced flow tables from descriptions of circuits with multiple inputs and outputs. Additional tasks include designing circuits based on the flow tables, merging flow tables, obtaining state assignments, and developing transition diagrams and expanded flow tables. The focus is on asynchronous sequential circuits and ensuring race-free logic designs.

    Original Description:

    digital logic questions

    Original Title

    Tutorial11 soln

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains instructions for 8 exercises related to digital design and circuit analysis. The exercises involve obtaining primitive and reduced flow tables from descriptions of circuits with multiple inputs and outputs. Additional tasks include designing circuits based on the flow tables, merging flow tables, obtaining state assignments, and developing transition diagrams and expanded flow tables. The focus is on asynchronous sequential circuits and ensuring race-free logic designs.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    176 views28 pages

    Tutorial11 Soln

    Uploaded by

    tanmay
    This document contains instructions for 8 exercises related to digital design and circuit analysis. The exercises involve obtaining primitive and reduced flow tables from descriptions of circuits with multiple inputs and outputs. Additional tasks include designing circuits based on the flow tables, merging flow tables, obtaining state assignments, and developing transition diagrams and expanded flow tables. The focus is on asynchronous sequential circuits and ensuring race-free logic designs.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 28

    BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI - K. K.

    BIRLA GOA CAMPUS


    DIGITAL DESIGN Tutorial 11

    Ex 1: Obtain a primitive flow table for a circuit with two inputs, x1 and x2 , and two outputs, z1 and
    z2 , that satisfy the following four conditions:

    (a) When x1 x2 =00,the output is z1 z2 =00.

    (b) When x1 =1 and x2 changes from 0 to 1, the output is z1 z2 =01.

    (c) When x2 =1 and x1 changes from 0 to 1, the output is z1 z2 =10.

    (d) Otherwise, the output does not change.

    Ex 2: A traffic light is installed at a junction of a railroad and a road. The light is controlled by
    two switches in the rails placed 1 mile apart on either side of the junction. A switch is turned on
    when the train is over it and is turned off otherwise. The traffic light changes from green (logic 0)
    to red (logic 1) when the beginning of the train is 1 mile from the junction. the light changes back
    to green when the end of the train is 1 mile away from the junction. Assume that the length of the
    train is less than 2 miles.

    (a) Obtain the primitive flow table of the circuit.

    (b) Show that the flow table can be reduced to four rows.

    (c) Design the circuit for this problem.

    Ex 3: It is necessary to design an asynchronous sequential circuit with two inputs, x1 and x2 ,


    and one output, z. Initially, both inputs and output are equal to 0. When x1 or x2 becomes 1, z
    becomes 1. When the second input also becomes 1, the output changes to 0. The output stays
    at 0 until the circuit goes back to the initial state.

    (a) Obtain a primitive flow table for the circuit, and show that it can be reduced to the low table
    shown in figure.

    (b) Complete the design of the circuit.


    Digital Design (CS F215/ECE F215/EEE F215/INSTR F215) Page 2 of 4
    Ex 4: Assign output values to the don’t-care states in the flow tables of figure in such a way as to
    avoid transient output pulses.

    Ex 5: Merge each of the primitive flow tables shown in figure. Proceed as follows:

    (a) Find all compatible pairs by means of an implication table

    (b) Find maximal compatibles by means of a merger diagram.

    (c) Find a minimal set of compatibles that covers all the states and is closed.
    Digital Design (CS F215/ECE F215/EEE F215/INSTR F215) Page 3 of 4
    Ex 6:

    (a) Obtain the binary state assignment for the reduced flow table shown in figure. Avoid critical
    race conditions.

    (b) Obtain the logic diagram of the circuit, using NAND latches and gates.

    Ex 7: Find a critical race free state assignment for the reduced flow table show in figure.
    Digital Design (CS F215/ECE F215/EEE F215/INSTR F215) Page 4 of 4
    Ex 8: Consider the reduced flow table shown in figure.

    (a) Obtain the transition diagram, and show that three state variables are needed for a race-free
    binary state assignment.

    (b) Obtain the expanded flow table, using the multiple-row method of assignment.

    You might also like