Scribd Logo
Upload

Welcome to Scribd!

  • Solution: The Number of Flip-Flops Required Is Three

    Uploaded by

    Murangira Albert
    14 views2 pages
    The document describes a 3-bit synchronous counter that counts through the states 000, 010, 101, 110 and then repeats, with unused states 001, 011, 100, 111 resetting to 000 on the next clock pulse. It uses J-K flip-flops and shows that 3 flip-flops are required, along with a table of the circuit excitation and Karnaugh maps for determining the simplified Boolean expressions for the JA, KA, JB, KB, JC, and KC signals.

    Original Description:

    Original Title

    Main

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a 3-bit synchronous counter that counts through the states 000, 010, 101, 110 and then repeats, with unused states 001, 011, 100, 111 resetting to 000 on the next clock pulse. It uses J-K flip-flops and shows that 3 flip-flops are required, along with a table of the circuit excitation and Karnaugh maps for determining the simplified Boolean expressions for the JA, KA, JB, KB, JC, and KC signals.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    14 views2 pages

    Solution: The Number of Flip-Flops Required Is Three

    Uploaded by

    Murangira Albert
    The document describes a 3-bit synchronous counter that counts through the states 000, 010, 101, 110 and then repeats, with unused states 001, 011, 100, 111 resetting to 000 on the next clock pulse. It uses J-K flip-flops and shows that 3 flip-flops are required, along with a table of the circuit excitation and Karnaugh maps for determining the simplified Boolean expressions for the JA, KA, JB, KB, JC, and KC signals.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    4

    Design a synchronous counter that counts as 000, 010, 101, 110, 000, 010, _ _ _ Ensure that the unused states of 001, 011, 100 and 111 go to 000 on the next clock pulse. Use J-K flip-flops. What will the counter hardware look like if the unused states are to be considered as dont cares. Solution

    The number of flip-flops required is three.

    Table below shows the desired circuit excitation table.

    The Karnaugh maps for JA, KA, JB, KB, JC and KC are shown in Figs below (a) to (f) respectively

    The simplified Boolean expressions are as follows

    You might also like