Scribd Logo
Upload

Welcome to Scribd!

  • 3 views

    Ec 361 DSD - CT - 1

    Uploaded by

    Krishnapriyasudhakaran Krishna

    Copyright:

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

    Ec 361 DSD - CT - 1

    Uploaded by

    Krishnapriyasudhakaran Krishna
    3 views2 pages

    Original Title

    EC 361 DSD_CT_1

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

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

    Ec 361 DSD - CT - 1

    Uploaded by

    Krishnapriyasudhakaran Krishna

    Copyright:

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

    Name : ……………………………

    Roll no: ……………………………

    MUTHOOT INSTITUTE OF TECHNOLOGY AND SCIENCE

    DEPARTMENT OF ELECTRONICS AND COMMUNICATION

    INTERNAL TEST-I, August-September 2017

    Fifth Semester

    EC 361 DIGITAL SYSTEM DESIGN

    Time: 1 hour Maximum Marks: 20

    (Answer any FOUR questions; each carries 5 marks)

    1. The state diagram shown is for a clocked synchronous sequential network. Assign
    codes to the states using a state assignment satisfying as many as possible of the
    state adjacencies recommended by the rules.

    NS Output (z)
    PS Input (x) Input (x)
    0 1 0 1
    A B C 0 0
    B A A 0 1
    C D A 0 1
    D A D 0 1

    2. For the clocked synchronous sequential network shown in the figure, obtain the
    transition table, state table and state diagram.
    3. Obtain the state table for a clocked synchronous sequential network having a single
    input line x, in which the symbols 0 and 1 are applied and a single output line z. An
    output of 1 is to be produced coincident with each third multiple of the input symbol
    1. At all other times the network is to produce 0 outputs. An example of
    input/output sequences that satisfy the conditions of the network specifications is :

    x = 01101011110001110
    z = 00001000100000100

    4. For the Mealy network state table given, determine a minimal state table.

    NS Output (z)
    PS Input (x) Input (x)
    0 1 0 1
    A B C 1 1
    B D B 0 0
    C B A 0 1
    D D E 0 0
    E F G 1 1
    F D F 0 0
    G F H 0 1
    H F I 1 1
    I B E 0 1

    5. Design a simplified traffic-light controller that switches traffic lights on a crossing


    where a north-south (NS) street intersects an east-west (EW) street. The input to
    the controller is the WALK button pushed by pedestrians who want to cross the
    street. The outputs are two signals NS and EW that control the traffic lights in NS
    and EW directions. When NS or EW is 0, the red light is on and when they are 1, the
    green light is on. When there are no pedestrians, NS=0 and EW=1 for 1 minute,
    followed by NS=1 and EW=0 for 1 minute and so on. When a WALK button is
    pushed, NS and EW both become 1 for a minute when the present minute expires.
    After that the NS and EW signals continue alternating. For the traffic-light controller:

    (a) Develop a state diagram and state/output table.


    (b) Minimize the number of states.

    *********

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy