Address generation for memories containing multiple arrays
- Publication date
- Publisher
Abstract
Abstract—We present techniques for generating addresses for memories containing multiple arrays. Because these techniques rely on the inversion or rearrangement of address bits, they are faster and require less hardware to compute than the traditional technique of addition. Use of these techniques can improve performance and cost of application-specific memory subsystems by decreasing effective access time to arrays and by reducing address generation hardware. The primary drawback to this approach is that extra memory space is occasionally required, but in over a million tested cases, this extra memory space is on average only 2 % and no worse than 17.4 % of the utilized memory space. This amount of wasted address space is significantly less than the amount required by the only known similar technique [7] and rarely necessitates the allocation of additional memory components. These techniques provide a foundation for adderfree address generation for manually and automatically generated application-specific memory designs. Index Terms — Arrays, compilers (silicon), digital arithmetic, high-level synthesis, memory management, number theoretic transforms. I