I need a hash function for a Look Up table, so that if my values are from 0 to N, I need a hash function that give me a value from 0 to n, being n << N. Another piece of information is that I already know N in advance.
I have been investigatinv about different low cost hash functions and I have found only this:
h = z mod n range(z) - 0 to N, range(h) - 0 to n
My hash function needs to be implemented in HW, so it needs to have a very low cost. Can anyone recommend any other formula or algorithm apart from that simple thing?. When I say HW I mean a truly implementation in HW, and not instructions in a microprocessor.
Update with the solution
Thanks for all the answer, I am not going to select a favourite one, because all of them are equally valid depending on the characteristics of the target application.