Requirements: For this assignment you must implement a simulation of a simple game that does not use any arithmetic comp
Posted: Sun May 15, 2022 2:07 pm
Requirements: For this assignment you must implement a
simulation of a simple game that does not use any arithmetic
computation circuitry such as adder or subtraction circuits.
The simulation has two inputs. Input 1 (P) represents the first
input to the computation. P has values ranging from 0-7. Input 2
(Q) represents the second input to the computation, also with
values ranging from 0-7.
The computation will evaluate the following: If P = Q-2, P
equals Q-1, P = Q+1, or P = Q+ 2, the output of the Part A circuit
will be successful with an output value of 1. For any other
combination of P and Q, the output of the Part A circuit will be
unsuccessful with an output value of 0.
Examples:
1. P=0, Q=0: P does not equal Q-2, P does not equal Q-1, P does
not equal Q+1, and P does not equal Q+ 2. This combination is
unsuccessful.
2. P=0, Q=1: P equals Q-1. This combination is successful.
3. P=0, Q=2: P equals Q-2. This combination is successful.
4. P=3, Q=2: P equals Q+1. This combination is successful.
5. P=7, Q=2: P does not equal Q-2, P does not equal Q-1, P does
not equal Q+1, and P does not equal Q+ 2. This combination is
unsuccessful.
6. P=3, Q=6: P does not equal Q-2, P does not equal Q-1, P does
not equal Q+1, and P does not equal Q+ 2. This combination is
unsuccessful.
Note: The examples on this page represent only some selected
cases. There are (many) more cases that result in successful or
unsuccessful combinations. Your circuit must correctly show a
successful or unsuccessful combination for each possible case.
Representing P and Q values: Input Value 1 (P) will be
represented by three inputs (3 bits). The three P inputs are named
P1, P2, and P3. The table below shows the assignment of bits to
each P value for P1, P2, and P3. Note the order of these bits, P1
is the Most Significant Bit (MSB) on the left. Input Value 2 (Q)
will be represented by three inputs (3 bits). The three Q inputs
are named Q1, Q2, and Q3. The table below shows the assignment of
bits to each Q value for Q1, Q2, and Q3. Note the order of these
bits, Q1 is the Most Significant Bit (MSB) on the left.
Part A (40 marks): The implementation for this part must use
only the three basic logic gates (AND, OR, NOT). Each AND gate and
each OR gate can have only 2 inputs. More than 2 inputs for AND and
OR gates is not permitted. Each NOT gate can have only 1 input. No
other logic gates or circuits are permitted to be used in your
circuit for Part A. You are required to implement a circuit where
the user (you) can input a number for Input 1 (P) using value (P1,
P2, and P3) and Input 2 (Q) using value (Q1, Q2, and Q3) and the
circuit decodes the P1, P2, P3 and Q1, Q2, Q3 values using a
decoder (see lecture notes) made up of only the permitted logic
gates. The output of the decoders is used to determine if the
combination is successful or unsuccessful based on the rules
outlined in the requirements section on page 3. Note that because
of the decoding process you do not need and must not use an adder
or other arithmetic circuit to check for successful or unsuccessful
outcomes.
The output of the circuit is via a single output pin (green
circle in Logisim): The output pin must be labelled Successful
which is lit only if the output is successful (1). The output pin
is not lit for any P and Q combinations that are unsuccessful
(0)
vod A WN - P value 0 1 2 3 4 5 6 7 P1 0 0 0 0 1 1 1 1 P2 0 0 1 1 0 0 1 1 P3 O 1 0 1 0 1 0 1 Q value 0 1 2 3 4 5 6 7 Q1 0 0 0 0 1 1 1 1 Q2 0 0 1 1 0 0 1 1 Q3 0 1 0 1 0 1 0 1
simulation of a simple game that does not use any arithmetic
computation circuitry such as adder or subtraction circuits.
The simulation has two inputs. Input 1 (P) represents the first
input to the computation. P has values ranging from 0-7. Input 2
(Q) represents the second input to the computation, also with
values ranging from 0-7.
The computation will evaluate the following: If P = Q-2, P
equals Q-1, P = Q+1, or P = Q+ 2, the output of the Part A circuit
will be successful with an output value of 1. For any other
combination of P and Q, the output of the Part A circuit will be
unsuccessful with an output value of 0.
Examples:
1. P=0, Q=0: P does not equal Q-2, P does not equal Q-1, P does
not equal Q+1, and P does not equal Q+ 2. This combination is
unsuccessful.
2. P=0, Q=1: P equals Q-1. This combination is successful.
3. P=0, Q=2: P equals Q-2. This combination is successful.
4. P=3, Q=2: P equals Q+1. This combination is successful.
5. P=7, Q=2: P does not equal Q-2, P does not equal Q-1, P does
not equal Q+1, and P does not equal Q+ 2. This combination is
unsuccessful.
6. P=3, Q=6: P does not equal Q-2, P does not equal Q-1, P does
not equal Q+1, and P does not equal Q+ 2. This combination is
unsuccessful.
Note: The examples on this page represent only some selected
cases. There are (many) more cases that result in successful or
unsuccessful combinations. Your circuit must correctly show a
successful or unsuccessful combination for each possible case.
Representing P and Q values: Input Value 1 (P) will be
represented by three inputs (3 bits). The three P inputs are named
P1, P2, and P3. The table below shows the assignment of bits to
each P value for P1, P2, and P3. Note the order of these bits, P1
is the Most Significant Bit (MSB) on the left. Input Value 2 (Q)
will be represented by three inputs (3 bits). The three Q inputs
are named Q1, Q2, and Q3. The table below shows the assignment of
bits to each Q value for Q1, Q2, and Q3. Note the order of these
bits, Q1 is the Most Significant Bit (MSB) on the left.
- Requirements For This Assignment You Must Implement A Simulation Of A Simple Game That Does Not Use Any Arithmetic Comp 1 (55.74 KiB) Viewed 64 times
only the three basic logic gates (AND, OR, NOT). Each AND gate and
each OR gate can have only 2 inputs. More than 2 inputs for AND and
OR gates is not permitted. Each NOT gate can have only 1 input. No
other logic gates or circuits are permitted to be used in your
circuit for Part A. You are required to implement a circuit where
the user (you) can input a number for Input 1 (P) using value (P1,
P2, and P3) and Input 2 (Q) using value (Q1, Q2, and Q3) and the
circuit decodes the P1, P2, P3 and Q1, Q2, Q3 values using a
decoder (see lecture notes) made up of only the permitted logic
gates. The output of the decoders is used to determine if the
combination is successful or unsuccessful based on the rules
outlined in the requirements section on page 3. Note that because
of the decoding process you do not need and must not use an adder
or other arithmetic circuit to check for successful or unsuccessful
outcomes.
The output of the circuit is via a single output pin (green
circle in Logisim): The output pin must be labelled Successful
which is lit only if the output is successful (1). The output pin
is not lit for any P and Q combinations that are unsuccessful
(0)
vod A WN - P value 0 1 2 3 4 5 6 7 P1 0 0 0 0 1 1 1 1 P2 0 0 1 1 0 0 1 1 P3 O 1 0 1 0 1 0 1 Q value 0 1 2 3 4 5 6 7 Q1 0 0 0 0 1 1 1 1 Q2 0 0 1 1 0 0 1 1 Q3 0 1 0 1 0 1 0 1