Finding a simple hash table implementation example for use as a reference

Question

Finding a simple hash table implementation example for use as a reference

I am looking for some examples of implementing a hash table (insert + search) in Verilog (VHDL will work too). My case is not very complicated, because I know all the values during initialization, so I can pretty much say how much memory I need, find out its boundaries, etc. The hash function is not complicated, and I have an idea on how to map the hash key with memory addresses, manage collisions, etc. But to write all this for the first time from scratch is a resource, and there may be errors that I don’t know about. This will help if I can use some kind of link design. Therefore, if you know about such a thing, please share. Both fees / payment are ok, I could buy an IP implementation of this if it comes with source code that I can use to study.

+3

memory management algorithm vhdl verilog fpga

user405725 Apr 30 '12 at 21:46

source share

1 answer

Paul s · Accepted Answer · 2012-05-01T08:24:01+0000

You probably need CAM or Content Addressable Memory , but it really depends on the problem you are trying to solve. CAMs are typically expensive in terms of logic and inflating read paths. When used, they tend to be small.

Honestly, it looks like you are thinking about hardware problem software. A hash table is not what you usually see in hardware.

Finding a simple hash table implementation example for use as a reference

More articles: