Question Regarding Look-Up Tables and Access Time/Levels of Logic

Is there a standard used for look-up table access time in terms of levels of logic? As an example, if I have a 2^8 x 8 look-up table (8- bit to 8-bit), how many levels of logic are required to perform the look-up operation or is the table considered to be just one level of SRAM?

Thanks!

Adam

Reply to
AdamE
Loading thread data ...

Reply to
Peter Alfke

Peter,

I don't want to build the LUT out of 4 and 5 input LUTs :) I would agree about using the BlockRAM, I guess I was looking for a more generic statement of the form "if you have a 2^n x m LUT (in my case

2^8 x 8), you can expect the access time to be f(n,m) levels of logic" regardless of technology/use of BlockRAM. The real question becomes what is f(n,m), ie can I say something like for a 2^8 x 8 LUT it will be log_2_(2^8) = 8 levels of logic or something like that?

Thanks again!

Adam

Reply to
AdamE

Reply to
Peter Alfke

ElectronDepot website is not affiliated with any of the manufacturers or service providers discussed here. All logos and trade names are the property of their respective owners.