This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Sequential Circuits Problems(I) Prof. SinMin Lee Department of Mathematics and Computer Science Algorithm = Logic + Control We wish to design a synchronous sequential circuit whose state diagram is shown in Figure. The type of flipflop to be use is JK Two flipflops are needed to represent the four states and are designated Q0Q1. The input variable is labelled x. . Excitation table for JK flipflop Excitation table of the circuit The simplified Boolean functions for the combinational circuit can now be derived How do we determine the combinatorial ciccuit? • This circuit has three inputs, I, R, and the current A. • It has one output, DA, which is the desired next A. • So we draw a truth table, as before. • For convenience I added the label Next A to the DA column But this table is simply the truth table for the combinatorial circuit. A dividebythree counter which outputs one 1 for every 3 1's seen as input (not necessarily in succession.) After outputting a 1, it starts counting all over again. 1....
View
Full Document
 Spring '08
 NASIS
 Computer Science, The Circuit, State transition table

Click to edit the document details