ADDRESS GENERATION FOR MEMORIES CONTAINING MULTIPLE ARRAYS

Citation
H. Schmit et De. Thomas, ADDRESS GENERATION FOR MEMORIES CONTAINING MULTIPLE ARRAYS, IEEE transactions on computer-aided design of integrated circuits and systems, 17(5), 1998, pp. 377-385
Citations number
15
Categorie Soggetti
Computer Science Hardware & Architecture","Computer Science Interdisciplinary Applications","Computer Science Hardware & Architecture","Computer Science Interdisciplinary Applications","Engineering, Eletrical & Electronic
ISSN journal
02780070
Volume
17
Issue
5
Year of publication
1998
Pages
377 - 385
Database
ISI
SICI code
0278-0070(1998)17:5<377:AGFMCM>2.0.ZU;2-G
Abstract
We present techniques for generating addresses for memories containing multiple arrays. Because these techniques rely on the inversion or re arrangement of address bits, they are faster and require less hardware to compute than the traditional technique of addition. Use of these t echniques can improve performance and cost of application-specific mem ory subsystems by decreasing effective access time to arrays and by re ducing address generation hardware, The primary drawback to this appro ach is that extra memory space is occasionally required, but in over a million tested cases, this extra memory space is on average only 2% a nd no worse than 17.4 % of the utilized memory space, This amount of w asted address space is significantly less than the amount required by the only known similar technique [7] and rarely necessitates the alloc ation of additional memory components, These techniques provide a foun dation for adder-free address generation for manually and automaticall y generated application-specific memory designs.