×
Log in to StudySoup
Get Full Access to Fundamentals Of Logic Design - 7 Edition - Chapter 12 - Problem 12.10
Join StudySoup for FREE
Get Full Access to Fundamentals Of Logic Design - 7 Edition - Chapter 12 - Problem 12.10

Already have an account? Login here
×
Reset your password

Design a counter which counts in the sequence that has

Fundamentals of Logic Design | 7th Edition | ISBN: 9781133628477 | Authors: Charles h. Roth ISBN: 9781133628477 165

Solution for problem 12.10 Chapter 12

Fundamentals of Logic Design | 7th Edition

  • Textbook Solutions
  • 2901 Step-by-step solutions solved by professors and subject experts
  • Get 24/7 help from StudySoup virtual teaching assistants
Fundamentals of Logic Design | 7th Edition | ISBN: 9781133628477 | Authors: Charles h. Roth

Fundamentals of Logic Design | 7th Edition

4 5 1 364 Reviews
20
2
Problem 12.10

Design a counter which counts in the sequence that has been assigned to you. Use D flip-flops and NAND gates. Simulate your design using SimUaid. (a) 000, 001, 011, 101, 111, 010, (repeat) 000, . . . (b) 000, 011, 101, 111, 010, 110, (repeat) 000, . . . (c) 000, 110, 111, 100, 101, 001, (repeat) 000, . . . (d) 000, 100, 001, 110, 101, 111, (repeat) 000, . . . (e) 000, 010, 111, 101, 011, 110, (repeat) 000, . . . Present State Next State Q Q+ M N 0 0 0 1 1 0 1 1 404 Unit 12 (f ) 000, 100, 001, 111, 110, 101, (repeat) 000, . . . (g) 000, 010, 111, 101, 001, 110, (repeat) 000, . . . (h) 000, 101, 010, 011, 001, 110, (repeat) 000, . . . (i) 000, 100, 010, 001, 110, 111, (repeat) 000, . . . (j) 000, 001, 111, 010, 110, 011, (repeat) 000, . . . (k) 000, 100, 010, 001, 101, 111, (repeat) 000, . . . (l) 000, 011, 111, 110, 001, 100, (repeat) 000, . . . (m) 000, 100, 111, 110, 010, 011, (repeat) 000, . . . (n) 000, 011, 111, 110, 010, 100, (repeat) 000, . . .

Step-by-Step Solution:

12.10 Design a counter which counts in the sequence that has been assigned to you. Use D flip-flops and NAND gates. Simulate your design using SimUaid.

(a) 000, 001, 011, 101, 111, 010, (repeat) 000,...

(b) 000, 011, 101, 111, 010, 110, (repeat) 000,...

(c) 000, 110, 111, 100, 101, 001, (repeat) 000,...

(d) 000, 100, 001, 110, 101, 111, (repeat) 000,...

(e) 000, 010, 111, 101, 011, 110, (repeat) 000,...

(f ) 000, 100, 001, 111, 110, 101, (repeat) 000,...

(g) 000, 010, 111, 101, 001, 110, (repeat) 000,...

(h) 000, 101, 010, 011, 001, 110, (repeat) 000,...

(i) 000, 100, 010, 001, 110, 111, (repeat) 000,..

(j) 000, 001, 111, 010, 110, 011, (repeat) 000,...

(l) 000, 011, 111, 110, 001, 100, (repeat) 000,...

(m) 000, 100, 111, 110, 010, 011, (repeat) 000,...

(n) 000, 011, 111, 110, 010, 100, (repeat) 000,...

Step By Step Solution

Step 1 of 15

To design a counter, first let's have a look at the transition diagram showing the counter sequence. Then write the excitation table of the required flip flop and derive the flip flop input equations using k-map. After that convert these equations into NAND form using double negation and De-Morgan’s Theorem.


Step 2 of 15

Chapter 12, Problem 12.10 is Solved
Step 3 of 15

Textbook: Fundamentals of Logic Design
Edition: 7
Author: Charles h. Roth
ISBN: 9781133628477

The answer to “Design a counter which counts in the sequence that has been assigned to you. Use D flip-flops and NAND gates. Simulate your design using SimUaid. (a) 000, 001, 011, 101, 111, 010, (repeat) 000, . . . (b) 000, 011, 101, 111, 010, 110, (repeat) 000, . . . (c) 000, 110, 111, 100, 101, 001, (repeat) 000, . . . (d) 000, 100, 001, 110, 101, 111, (repeat) 000, . . . (e) 000, 010, 111, 101, 011, 110, (repeat) 000, . . . Present State Next State Q Q+ M N 0 0 0 1 1 0 1 1 404 Unit 12 (f ) 000, 100, 001, 111, 110, 101, (repeat) 000, . . . (g) 000, 010, 111, 101, 001, 110, (repeat) 000, . . . (h) 000, 101, 010, 011, 001, 110, (repeat) 000, . . . (i) 000, 100, 010, 001, 110, 111, (repeat) 000, . . . (j) 000, 001, 111, 010, 110, 011, (repeat) 000, . . . (k) 000, 100, 010, 001, 101, 111, (repeat) 000, . . . (l) 000, 011, 111, 110, 001, 100, (repeat) 000, . . . (m) 000, 100, 111, 110, 010, 011, (repeat) 000, . . . (n) 000, 011, 111, 110, 010, 100, (repeat) 000, . . .” is broken down into a number of easy to follow steps, and 213 words. Since the solution to 12.10 from 12 chapter was answered, more than 502 students have viewed the full step-by-step answer. The full step-by-step solution to problem: 12.10 from chapter: 12 was answered by , our top Engineering and Tech solution expert on 11/23/17, 05:09AM. Fundamentals of Logic Design was written by and is associated to the ISBN: 9781133628477. This textbook survival guide was created for the textbook: Fundamentals of Logic Design, edition: 7. This full solution covers the following key subjects: . This expansive textbook survival guide covers 20 chapters, and 727 solutions.

Other solutions

People also purchased

Related chapters

Unlock Textbook Solution

Enter your email below to unlock your verified solution to:

Design a counter which counts in the sequence that has