Design a 4-bit counter with one external input using T flip flop based on the following sequence: Input=0,6->2->9->13 (repeat), all undesired state go to 2. Input=1, 15->4->12->10 (repeat), all undesired state go to 4? *MIND TWO INPUTS THERE AREi) State transition diagram = diag salagii) State transition table such a example pic belowiii) Simplification using 8 K-Maps requirediv) circuit design Normal State transition TableInput Current StateA B000000000100100100000000000110000001000C001000001I00I010010101I0001D10000 1 0111I000100FNext StateAB06000 0 1100 1001010010110000000101000 000000100I00000010900100toс000000010000000 00DDA00010010000001000000000100000000D₁₁001000000000000000010000000De D₂D100111010001000000000001 100011101111111I11I1001 100111111 11Position in decimal01.23456786101112131415161718192021222324125262728293031

The question asks for the design of a 4-bit counter with two external inputs, using T flip-flops.…

Answered: Design a 4-bit counter with one…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Design a 4-bit counter with one external input using T flip flop based on the following sequence: Input=0,6->2->9->13 (repeat), all undesired state go to 2. Input=1, 15->4->12->10 (repeat), all undesired state go to 4? *MIND TWO INPUTS THERE ARE

i) State transition diagram = diag salag

ii) State transition table such a example pic below

iii) Simplification using 8 K-Maps required

iv) circuit design

Normal State transition Table
Input Current State
A B
0
0
0
0
0
0
0
0
0
10
01
0
0
10
0
0
0
0
0
0
0
0
0
0
1
1
0
0
0
0
0
0
1
0
0
0
C
0
0
1
0
0
0
0
0
1
I
0
0
I
010
010
10
1
I
0
0
0
1
D
1
0
0
0
0 1 0
1
1
1
I
0
0
0
1
00
F
Next State
A
B
0
6
0
0
0 0 110
0 1
0
01
0
10
010
110
00
0
00
0
10
10
00 0
0
0
00
0
1
0
0
I
0
0
0
00
0
10
9
0
01
0
0
to
с
0
0
0
0
0
0
010
0
0
0
0
0
0 0
0
D
DA
0
0
0
1
0
01
0
0
0
0
0
0
10
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
D₁₁
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
De D₂
D
1
0
0
1
1
1
0
10
0
0
1
0
0
0
0
0
0
0
0
0
0
0
1 1
0
0
0
1
1
1
0
1
1
1
1
1
1
1
I
1
1
I
1
0
0
1 1
0
0
1
1
1
1
1
1 1
1
Position in decimal
0
1.
2
3
4
5
6
7
8
6
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
125
26
27
28
29
30
31

Expert Solution

Step by step

Solved in 6 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Fundamentals of Boolean Algebra and Digital Logics

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions