2. Suppose you wished to add a new instruction to SCOMP, called ANDI, that would perform a bitwise AND of the Accumulator with the 11-bit operand of the instruction. Assuming that the implementation of the DECODE state is as follows, what would be the machine language equivalent of ANDI O? Write a hexadecimal or binary number in the box on the answer sheet. when decode => IR <= mem data; case mem data (15 downto 11) is when "00000" => state <= ex_nop; when "00001" => state <= ex_load; when "10001" => when others => end case; -- state <= ex_andi; state <= ex_nop; no operation (nop) load -- omitted for space reasons andi

Question

VDHL simple computer question. 

2.
Suppose you wished to add a new instruction to SCOMP, called ANDI, that would
perform a bitwise AND of the Accumulator with the 11-bit operand of the instruction. Assuming
that the implementation of the DECODE state is as follows, what would be the machine
language equivalent of ANDI O? Write a hexadecimal or binary number in the box on the
answer sheet.
when decode =>
IR
<= mem data;
case mem data (15 downto 11) is
when "00000" =>
state <= ex_nop;
when "00001" =>
when "10001" =>
end case;
state <= ex_load;
when others =>
-- no operation (nop)
load
--
state <= ex_andi;
state <= ex_nop;
omitted for space reasons
andi
Transcribed Image Text:2. Suppose you wished to add a new instruction to SCOMP, called ANDI, that would perform a bitwise AND of the Accumulator with the 11-bit operand of the instruction. Assuming that the implementation of the DECODE state is as follows, what would be the machine language equivalent of ANDI O? Write a hexadecimal or binary number in the box on the answer sheet. when decode => IR <= mem data; case mem data (15 downto 11) is when "00000" => state <= ex_nop; when "00001" => when "10001" => end case; state <= ex_load; when others => -- no operation (nop) load -- state <= ex_andi; state <= ex_nop; omitted for space reasons andi
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer