1.) 2-bit binary numbers represent the values 0..3 with the following encoding:
Encoding [1:0] Value
0 0 0
0 1 1
1 0 2
1 1 3
Develop the simplest Sum-of-Products equation possible that, when given two 2-bit binary numbers X[1:0] and Y[1:0], will output whether the value of X is greater than the value of Y.
2.) Assume that we have already implemented the solution to problem #1 as a module “isGreater(F, X, Y)” in Verilog, and cannot change that module at all. Using that module, write the simplest possible Verilog module that will compute whether A[1:0] is greater than or equal to B[1:0].
Please help on the modules of problem 1 and 2.
GIVEN,
1)
X[1:0] AND Y[1:0] TWO BIT BINARY NUMBERS; WE NEED TO FIND OUT SUM OF PRODUCTS EQUATION FOR THE OUTPUT WHETHER THE VALUE OF X IS GREATER THAN THE VALUE OF Y
HERE IS THE SOLUTION
IF X[1:0] IS GREATER THAN Y[1:0] THEN
2)
VERILOG CODE FOR
X GREATER THAN Y AND X LESS THAN Y AND X EQUAL TO Y
Get Answers For Free
Most questions answered within 1 hours.