Help finding out the generation algorithm.

Dear friends ;

I do need help with this problem that my prof gave to us .
He gave several couples of hex numbers (see list below) and we need to know the common algorithm (?) that satisfies for given result. The algorithm is common for all couples. We tried with and, xor, or, mod, and several combinations of these but it must be of course more complex.

This is not a joke and I did not post it here just to increase post number !
Please, we need badly for an help.

oo-Felipe-oo

List:

0B52E2E4
D9774952
--------
AEF74741 (result)

FAC174A8
D9774952
--------
5F64D10D (result)

BCD2ECF7
D9774952
--------
19774952 (result)

8E4D9AE9
D9774952
--------
2BE83F4C (result)

7FDE0C2B ?
F097C9E9
--------
DA7BA98E (result)

AF0A446F ?
F097C9E9
--------
AAFE1CA (result)

B4FB497C ?
F097C9E9
--------
9356531F (result)

Click to expand...

its really tedious to work on this! yet, i think u can try using a Karnough's map solver program to give the input's in biunary and also the output and try to get the function of the output interms of input... incase if the outputs are linearly associated.. i mean input s are not cross linked... try it.. hope this helps..

/cedance

Dear Mr. arunmit168 :
Thanks anyway for answer. We used KarnaughMap 1.2 with no success. This programme is free ( https://www.puz.com/sw/karnaugh/index.htm ) but has many limitations and buying for a featured software is unaffordable from us.
Inputs are not cross-linked among them. Any couple of terms are indipendent from each other, (but the second input term is common in some case). But the algorithm generating the results is the same for all couples.

We thought that someone on edaboard could help us. I don't know other places where to ask from.

oo-Felipe-oo

Is the second last Hex number couple correct? or is there a digit missing in the result?

Use this module and synthesis, you maybe get the alogrithm.
BTW, I don't think it worth ?
module test ( A_in, B_in, R_out) ;
input [31:0] A_in,B_in;
output[31:0] R_out;

always @(A_in or B_in) begin
if ( A_in == 32'h0B52E2E4 && B_in == 32'hD9774952 )
R_out = 32'hAEF74741;
else if ( A_in == 32'hFAC174A8 && B_in == 32'hD9774952 )
R_out = 32'h5F64D10D;
else if (A_in == 32'hBCD2ECF7 && B_in == 32'hD9774952 )
R_out = 32'h19774952;
else if (A_in == 32'h8E4D9AE9 && B_in == 32'hD9774952 )
R_out = 32'h2BE83F4C;
else if (A_in == 32'h7FDE0C2B && B_in == 32'hF097C9E9 )
R_out = 32'hDA7BA98E;
else if (A_in == 32'hAF0A446F && B_in == 32'hF097C9E9)
R_out = 32'hAAFE1CA;
else if (A_in == 32'hB4FB497C && B_in == 32'hF097C9E9 )
R_out = 32'h 9356531F;

end
endmodule

Dear aryajur,

Yes. The second last Hex result has 7 digits. Perhaps with implied zero to left end.


Dear tukken,

I never thought to this solution, by the way I'm not that sure about programming language.. it seems like pascal but not sure. What does it mean the notation 32'h0B52E2E4 for instance ?
I do apologise for my ignorance. We don't have that great experience and resources we have at school reflect poor conditions of small village where we live.

oo-Felipe-oo

Solution by tukken is just writing all the numbers cases given by the prof, it is not an algorithm for generation so when the proff tests this by using another set of number that he did not give to u, the code will have no idea what to do.
Although there is one sure way of doing it but it requires a lot of time and careful effort. Represent each hex digit as a 4 bit binary and start from the rightmost hex digit. The two above numbers give the result, so write down the truth table with all the seven cases and you can get a boolean expression for each bit of each digit. Take the other cases as dont care. This will give you 64 expressions to generate each bit of the 8 hex digit result, but like it sounds the technique may again not work for another set of number that the proff gives. Presently I do not see a full clear relationship in the numbers.