--- Quote Start ---
d(s1,s2) is the distance between the position of each element in s1 and the position of the same element in s2
which is 1+1+0+1+1=4 then divided by (n^2-1)/2 where n is the number of elements in table
sorry for not clear at first. i want to make a vhdl code for that
so i need help
--- Quote End ---
So in the given case you have the given distances as 1+1+0+1+1 (n = 5) so distance = 1+1+0+1+1 = 4 then normalised to 5^2-1/2 i.e. /12
=.333
is n constant 5 always. How do you get the positions of 1,1,0,1,1? are these five inputs?
Once you are clear about the requirement then you can go for coding.
Honored Contributor
