Scribd Logo
Upload

Welcome to Scribd!

  • Bit Counter

    Uploaded by

    Satya Narayana
    12 views2 pages
    The document describes a bit counter with 3 states (000, 001, 010, 011, 100, 101, 110, 111) and 3 inputs (A, S2, S1, S0). It provides the state diagram, state table, and truth table for the counter. It then solves the Karnaugh map to find the output equations for D2, D1, and D0. Finally, it notes that the machine designed is a Mealy finite state machine.

    Original Description:

    Bit Counter

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a bit counter with 3 states (000, 001, 010, 011, 100, 101, 110, 111) and 3 inputs (A, S2, S1, S0). It provides the state diagram, state table, and truth table for the counter. It then solves the Karnaugh map to find the output equations for D2, D1, and D0. Finally, it notes that the machine designed is a Mealy finite state machine.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    12 views2 pages

    Bit Counter

    Uploaded by

    Satya Narayana
    The document describes a bit counter with 3 states (000, 001, 010, 011, 100, 101, 110, 111) and 3 inputs (A, S2, S1, S0). It provides the state diagram, state table, and truth table for the counter. It then solves the Karnaugh map to find the output equations for D2, D1, and D0. Finally, it notes that the machine designed is a Mealy finite state machine.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 2

    (a)

    The state diagram for the given bit counter is,

    The state table is shown below:


    Draw the state table as shown below:

    Assign the states as shown below.


    a  000
    b  001
    c  010
    d  011
    e  100
    f  101
    g  110
    h  111
    Draw the truth table as shown below:

    A S2 S1 S0 S2* S1* S0* D2 D1 D0


    0 0 0 0 0 0 0 0 0 0
    0 0 0 1 0 0 1 0 0 1
    0 0 1 0 0 1 0 0 1 0
    0 0 1 1 0 1 1 0 1 1
    0 1 0 0 1 0 0 1 0 0
    0 1 0 1 1 0 1 1 0 1
    0 1 1 0 1 1 0 1 1 0
    0 1 1 1 1 1 1 1 1 1
    1 0 0 0 0 0 1 0 0 1
    1 0 0 1 0 1 0 0 1 0
    1 0 1 0 0 1 1 0 1 1
    1 0 1 1 1 0 0 1 0 0
    1 1 0 0 1 0 1 1 0 1
    1 1 0 1 1 1 0 1 1 0
    1 1 1 0 1 1 1 1 1 1
    1 1 1 1 0 0 0 0 0 0

    Solve Karnaugh map for D2, D1, and D0.


    D2  AS2  S 2 S1  S 2 S0  AS 2 S1S0
    D1  AS1  S1S0  AS1S0
    D0  AS0  AS0

    The design is shown below.

    (b)
    The machine designed is Mealy FSM.

    You might also like