Problem 1
Show how to implement a 6:64 decoder using smaller decoder parts.
Circuit Diagram:
Problem 2
Implement these functions in a LogicWorks Circuit diagram using a 154 decoder chip and
any 04, 00, 10, 20, or 30 devices needed. Compare the resulting c
Problem 1:
Implement all four functions from Problem 2 on HW 6 using the minimum number of 4-1
and 2-1 MUX's and no additional gates.
A
B
C
0 0 11 10
D
0 1
00 0 1 1
0
01 0 1 1
1
11 0 0 1
1
10 0 0 1
0
W = A' * B * C' + A * B + A * B' * D
I0=0 I1=C I2=D I3=
Problem 1:
In class we have looked at the design of an equality compare module. For this problem you
should design a magnitude compare module for 4 bit unsigned binary numbers. The module
inputs are A[3.0] and B[3.0]. The two outputs are G and L, such tha
Problem 1
4.6: Use switching algebra theorems to simplify each of the following logic functions
a) F + W * X * Y * Z * (W * X * Y * Z + W * X * Y * Z + W * X * Y * Z + W * X * Y *
Z)
= (W * X * Y * Z) * (W * X * Y * Z) + (W * X * Y * Z) * (W * X * Y * Z)
EE260 Lab
Sec. 003
Perpetual Motion
Brandon Leung
Anh Lam
Cody Shinsato
Lab2 Report
Introduction:
The objectives of this lab is to become familiar with the Quartus II software. This includes
creating a project, entering a design in VHDL, compiling a desig
Problem 1:
The code below is a C program that determines if there is an odd number of ones in an 8-bit input. (Note: this
is an iterative-in-time approach). Hand compile this program into an EE 260 Computer assembly program.
Then hand assemble your code i
Problem 1
a) Problem 1a: Show how to implement a JK FF using a D FF.
b) Problem 1b: Show how to implement a JK FF using a T FF.
c) Problem 1c: Show how to implement a D FF using a JK FF.
Problem 2
For each problem:
1. A State Table for the counter.
2. The