1. Design the state diagram and create the state table for a synchronous to detect the sequence 0101. The circuit has a single input, x, and a single output z. The output is logic-1 whenever the input sequence 0101 is detected, logic-0 otherwise. Note that overlapping sequences are allowed (that is: If the input is 01010101, the output is high on every 1 beginning with the second). Write the equations for the state variables and the output z. 2. Design the state diagram and create the state table for a synchronous modulo-3 counter (that is, one that continually counts in the sequence 0, 1, 2, 0, 1, 2, ...). Write the equations for the state variables. Note: In this case, the state variables can be used as the outputs.

Programming Logic & Design Comprehensive
9th Edition
ISBN:9781337669405
Author:FARRELL
Publisher:FARRELL
Chapter4: Making Decisions
Section: Chapter Questions
Problem 4RQ
icon
Related questions
Question
100%
1. Design the state diagram and create the state table for a synchronous to detect the sequence
0101. The circuit has a single input, x, and a single output z. The output is logic-1 whenever
the input sequence 0101 is detected, logic-0 otherwise. Note that overlapping sequences are
allowed (that is: If the input is 01010101, the output is high on every 1 beginning with the
second). Write the equations for the state variables and the output z.
2. Design the state diagram and create the state table for a synchronous modulo-3 counter (that
is, one that continually counts in the sequence 0, 1, 2, 0, 1, 2, . . .). Write the equations for the
state variables. Note: In this case, the state variables can be used as the outputs.
Transcribed Image Text:1. Design the state diagram and create the state table for a synchronous to detect the sequence 0101. The circuit has a single input, x, and a single output z. The output is logic-1 whenever the input sequence 0101 is detected, logic-0 otherwise. Note that overlapping sequences are allowed (that is: If the input is 01010101, the output is high on every 1 beginning with the second). Write the equations for the state variables and the output z. 2. Design the state diagram and create the state table for a synchronous modulo-3 counter (that is, one that continually counts in the sequence 0, 1, 2, 0, 1, 2, . . .). Write the equations for the state variables. Note: In this case, the state variables can be used as the outputs.
1. Your goal is to design a circuit which has as input a number 0-9 represented in binary form.
The inputs are labeled A, B, C, D where A is the most significant bit. 10-15 represent "don't
care" conditions. The output is the sum of 3 and the input represented in binary form. The
outputs are labeled W, X, Y, Z where W is the most significant bit.
a. Create a truth table for the circuit.
b. Complete the Karnaugh maps for W and Y, minimizing the Boolean functions. Blank
K-maps are attached.
Write the Boolean equations for W and Y from the K-maps.
с.
2. Implement the following truth table directly (without any minimization) using a PLA. Properly
label the inputs and outputs.
Inputs
Outputs
A
C
D
X
Y
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
Transcribed Image Text:1. Your goal is to design a circuit which has as input a number 0-9 represented in binary form. The inputs are labeled A, B, C, D where A is the most significant bit. 10-15 represent "don't care" conditions. The output is the sum of 3 and the input represented in binary form. The outputs are labeled W, X, Y, Z where W is the most significant bit. a. Create a truth table for the circuit. b. Complete the Karnaugh maps for W and Y, minimizing the Boolean functions. Blank K-maps are attached. Write the Boolean equations for W and Y from the K-maps. с. 2. Implement the following truth table directly (without any minimization) using a PLA. Properly label the inputs and outputs. Inputs Outputs A C D X Y 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 7 images

Blurred answer
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Programming Logic & Design Comprehensive
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage