Design a counter to count-up from 2 to 6 using D Flip Flops in a piece of paper then submit a screenshot of solution. Use the following as a reference: (3) 3-Bit Count up (3 to 5) Using D Flip-Flop: The State Equation of D Flip-Flop: Q(t+1)=D(t) => Dn=Qn Present State Next State D Flip-Flop n Q2p Q1p Q0p Q2n Q1n Q0n D2 D1 DO 3011 4100 5101 100100 101101 011 011 D2-Sum(3,4) and don't care X-Sum(0,1,2,6,7) D1-Sum(5) and don't care X-Sum(0,1,2,6,7) DO-Sum(4,5) and don't care X-Sum(0,1,2,6,7) Using K-map to simplify the functions: D2=Q1+Q0' D1=Q1'QO DO=Q1' xx1 Q2 10 Qo Q2 01xx Q2 xx Qo D2 Q2 >CK Q2 Qo D1 Q BCD CK Qu DO Q >CK Q0

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

I need help with this problem and an explanation for the solution described below. (Fundamentals of Computer Engineering: Asynchronous Sequential Circuits)

Design a counter to count-up from 2 to 6 using D Flip Flops in a piece of paper then
submit a screenshot of solution.
Use the following as a reference:
(3) 3-Bit Count up (3 to 5) Using D Flip-Flop:
The State Equation of D Flip-Flop:
Q(t+1)=D(t) => Dn=Qn
Present State
Next State D Flip-Flop
n Q2p Q1p Q0p Q2n Q1n Q0n D2 D1 DO
3011
4100
5101
100100
101101
011
011
D2-Sum(3,4) and don't care X-Sum(0,1,2,6,7)
D1-Sum(5) and don't care X-Sum(0,1,2,6,7)
DO-Sum(4,5) and don't care X-Sum(0,1,2,6,7)
Using K-map to simplify the functions:
D2=Q1+Q0'
D1=Q1'QO
DO=Q1'
xx1
Q2 10
Qo
Q2 01xx Q2 xx
Qo
D2 Q2
>CK
Q2
Qo
D1 Q
BCD
CK
Qu
DO Q
>CK
Q0
Transcribed Image Text:Design a counter to count-up from 2 to 6 using D Flip Flops in a piece of paper then submit a screenshot of solution. Use the following as a reference: (3) 3-Bit Count up (3 to 5) Using D Flip-Flop: The State Equation of D Flip-Flop: Q(t+1)=D(t) => Dn=Qn Present State Next State D Flip-Flop n Q2p Q1p Q0p Q2n Q1n Q0n D2 D1 DO 3011 4100 5101 100100 101101 011 011 D2-Sum(3,4) and don't care X-Sum(0,1,2,6,7) D1-Sum(5) and don't care X-Sum(0,1,2,6,7) DO-Sum(4,5) and don't care X-Sum(0,1,2,6,7) Using K-map to simplify the functions: D2=Q1+Q0' D1=Q1'QO DO=Q1' xx1 Q2 10 Qo Q2 01xx Q2 xx Qo D2 Q2 >CK Q2 Qo D1 Q BCD CK Qu DO Q >CK Q0
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY