DSP address optimization using a minimum cost circulation technique

@article{Gebotys1997DSPAO,
  title={DSP address optimization using a minimum cost circulation technique},
  author={Catherine H. Gebotys},
  journal={1997 Proceedings of IEEE International Conference on Computer Aided Design (ICCAD)},
  year={1997},
  pages={100-103}
}
This paper presents a new approach to solving the DSP address assignment problem. A minimum cost circulation approach is used to efficiently generate high performance addressing code in polynomial time. Addressing code size improvements of up to 7 times are obtained, accounting for up to 1.6 times improvement in code size and performance of compiler-generated DSP code. Results also show that memory layout has a small effect on code size and performance when optimal addressing is used. This… CONTINUE READING
Highly Cited
This paper has 51 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

Storage Optimization through Offset Assignment with Variable Coalescing

ACM Trans. Embedded Comput. Syst. • 2012
View 7 Excerpts
Highly Influenced

Optimal general offset assignment

View 5 Excerpts
Highly Influenced

An optimization framework for embedded processors with auto-addressing mode

ACM Trans. Program. Lang. Syst. • 2010
View 4 Excerpts
Highly Influenced

51 Citations

051015'98'03'09'15
Citations per Year
Semantic Scholar estimates that this publication has 51 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…