Scribd
Upload
13 views3 pages

ELEC0004 Coursework 1

The document outlines coursework for a digital electronics class focusing on JK and T flip-flops. It includes tasks such as sketching state transition diagrams, writing state transition tables, and constructing flip-flops using D flip-flops and combinational logic in a Moore-type finite state machine. The coursework is structured into sections with specific requirements and marks assigned for each task.

Uploaded by

unoruno
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views3 pages

ELEC0004 Coursework 1

The document outlines coursework for a digital electronics class focusing on JK and T flip-flops. It includes tasks such as sketching state transition diagrams, writing state transition tables, and constructing flip-flops using D flip-flops and combinational logic in a Moore-type finite state machine. The coursework is structured into sections with specific requirements and marks assigned for each task.

Uploaded by

unoruno
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

ELEC0004 DIGITAL ELECTRONICS 1 – COURSEWORK

student ID number：21003456

1. A JK flip-flop receives a clock and two inputs, J and K. On the rising edge of the
clock, it updates the output, Q. If J and K are both 0, Q retains its old value. If only J
is 1, Q becomes 1. If only K is 1, Q becomes 0. If both J and K are 1, Q becomes the
opposite of its present state.

(i) Sketch the state transition diagram for the JK flip-flop. [10 marks]

(ii) Write out the state transition table for the JK flip flop. [10 marks]
Inputs Present state Next state
J K Q Q’
0 0 1 1
0 0 0 0
1 0 1 1
1 0 0 1
0 1 1 0
0 1 0 0
1 1 1 0
1 1 0 1

(iii) Construct a JK flip-flop based on a D flip-flop and some combinational logic. Your
design should be in the form of a Moore-type finite state machine. [30 marks]
st
According to the state transition table of the JK flip flop, we can use 1 canonical form
function to build the logic gate:
𝑄 ′ (𝑜𝑢𝑡𝑝𝑢𝑡) = 𝐽. 𝐾. 𝑄 + 𝐽. 𝐾. 𝑄 + 𝐽. 𝐾. 𝑄 + 𝐽. 𝐾. 𝑄
𝑄′ (𝑜𝑢𝑡𝑝𝑢𝑡) = 𝐽. 𝐾. (𝑄 + 𝑄) + 𝐽. 𝐾. 𝑄 + 𝐽. 𝐾. 𝑄
𝑄 ′ (𝑜𝑢𝑡𝑝𝑢𝑡) = 𝐽. 𝐾 + 𝐽. 𝐾. 𝑄 + 𝐽. 𝐾. 𝑄
And since we need to base on the D flip-flop in form of Moore-type finite state
machine in our design, this is what I have built:
When the CLK is 0, the value at propagates to N1, and when CLK is 1, the value at D
is copied to Q’ immediately before the clock rise from 0 to 1.

2. A toggle (T) flip-flop receives a clock and one input, T. On the rising edge of the
clock, it updates the output, Q. If T is 0, Q retains its old value. If T is 1, Q toggles to
the complement of its present state (i.e., Q becomes the opposite of its present
state).

(i) Sketch the state transition diagram for the T flip-flop. [10 marks]

(ii) Write out the state transition table for the T flip flop. [10 marks]
Input Present state Next state
T Q Q’
0 0 0
1 0 1
0 1 1
1 1 0

(iv) Construct a T flip-flop based on a D flip-flop and some combinational logic. Your
design should be in the form of a Moore-type finite state machine. [30 marks]
st
According to the state transition table of the T flip flop, we can use 1 canonical form
function to build the logic gate:
𝑄 ′ (𝑜𝑢𝑡𝑝𝑢𝑡) = 𝑇. 𝑄 + 𝑇. 𝑄
And since we need to base on the D flip-flop in form of Moore-type finite state
machine in our design, this is what I have built:

When the CLK is 0, the value at propagates to N1, and when CLK is 1, the value at D
is copied to Q’ immediately before the clock rise from 0 to 1.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy