A memory selection algorithm for high-performance pipelines
Smita Bakshi, Daniel D. Gajski · eScholarship (California Digital Library) · 1994
In order to perform high-throughput DSP computations, that are predominantly vector or array based, it is essential that the memory organization satisfy both the storage and the performance requirements of the design. In this report, we present an algorithm to select a memory organization, in addition to selecting a pipeline and other datapath components, given performance constraints. We also conduct experiments to give a quantitative measure of the impact of memory selection on DSP design.