For indirect addressing DSPs, a novel memory address allocation method based on graph representation is presented. The method translates a given memory access sequence into a graph notation, and transforms it into line-shaped graphs. At the transformation, a cost evaluation measure is newly introduced, so that efficient memory allocation is given. The proposed cost functions are applied to the existing memory allocation method, and memory allocation results derived for several examples show its effectiveness.
['Nobuhiko Sugino', 'Tomoyuki Matsuura', 'Akinori Nishihara']
New graph transformation schemes in graph-based memory allocation method for an indirect addressing DSP