Design a mod-12 synchronous up counter, Computer Engineering

Assignment Help:

Design a mod-12 Synchronous up counter.

Ans. Design of a mod 12 synchronous counter by using D-flipflops.

I state table
Present state Next state Required D Inputs

A	B	C	D	A	B	C	D	DA	DB	DC	DD
0	0	0	0	0	0	0	1	0	0	0	1
0	0	0	1	0	0	1	0	0	0	1	0
0	0	1	0	0	0	1	1	0	0	1	1
0	0	1	1	0	1	0	0	0	1	0	0
0	1	0	0	0	1	0	1	0	1	0	1
0	1	0	1	0	1	1	0	0	1	1	0
0	1	1	0	0	1	1	1	0	1	1	1
0	1	1	1	1	0	0	0	1	0	0	0
1	0	0	0	1	0	0	1	1	0	0	1
1	0	0	1	1	0	1	0	1	0	1	0
1	0	1	0	1	0	1	1	1	0	1	1
1	0	1	1	0	1	0	0	0	1	0	0

Firstly draw the state table containing present state, subsequent state and required flip-flop input to provide the transition. D flip flop offers the output similar as the next state itself. After that, solve through using K maps to determine DA DB DC DD for all states.
Unutilized states are 1100,1101,1110,1111 they can be function as don't care conditions from the table. Depict Karnaugh-maps for DA, DB, DC and DD as follows and acquire Boolean expressions for them.

355_Design a mod-12 Synchronous up counter.png

569_Design a mod-12 Synchronous up counter12.png

2281_Design a mod-12 Synchronous up counter21.png

Related Discussions:- Design a mod-12 synchronous up counter

What do you understand by www, What do you understand by WWW? WWW (Wo...

What do you understand by WWW? WWW (World Wide Web): It is an architectural framework for accessing linked documents outspread over thousands of machines the whole world.

Parallel computer architecture , Parallel Computer Architecture Intr...

Parallel Computer Architecture Introduction We have talked about the classification of parallel computers and their interconnection networks in that order in units 2 and

What are universal gates, What are universal gates. Construct a lo...

What are universal gates. Construct a logic circuit using NAND gates only for the expression x = A . (B + C). Ans. Universal Gates: NAND and NOR Gates both are t

Prove using boolean algebra, Q.Prove using Boolean Algebra 1. X (X+Y) = ...

Q.Prove using Boolean Algebra 1. X (X+Y) = X 2. AB + AC + BC' = AC + BC' 3. (A+B+C) (A+B'+C') (A+B+C') (A+B'+C)=A 4. (A+B'+C) (AB+A'C) = (A+C) (A'+B) 5. XY + XZ + YZ

Explain the significance ipv6 over ipv4, Explain the significance IPV6 over...

Explain the significance IPV6 over IPV4. The maximum size of an Ipv6 datagram is 65575 bytes, with the 0 bytes Ipv6 header. Ipv6 also describe a minimum reassembly buffer size:

Determine about the authoring software, Determine about the Authoring Softw...

Determine about the Authoring Software Also termed as author ware; this is a program which helps in the writing of hypertext or multimedia applications. Authoring tools general

Knowledge representation in artificial intelligence , Knowledge Representat...

Knowledge Representation: To recap, now we have some characterizations of Artificial Intelligence, so when an Artificial Intelligence problem arises, you will enable to put i

Elaborate the various steps in performing a mail merge, COMPUTER FUNDAMENTA...

COMPUTER FUNDAMENTALS 1. Elaborate the various steps in performing a Mail Merge. Perform one mail merge operation for sending invitation for a conference which is being conduc

Name some register output control signals, Name some register output contro...

Name some register output control signals. Pc out , MDR out , Z out , Offset out , R1 out , R2 out , R3 out and TEMP out .

With what symbolic names can be associated, Symbolic names can be associate...

Symbolic names can be associated with? Ans. With data or instruction symbolic names associated.

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages