{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:40:03Z","timestamp":1752460803419,"version":"3.41.2"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Design Automation for Embedded Systems"],"published-print":{"date-parts":[[1999,3]]},"DOI":"10.1023\/a:1008961206784","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T12:46:35Z","timestamp":1040561195000},"page":"167-185","source":"Crossref","is-referenced-by-count":9,"title":["Minimization of Data Address Computation Overhead in DSP Programs"],"prefix":"10.1007","volume":"4","author":[{"given":"Bernhard","family":"Wess","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"205903_CR1","first-page":"715","volume":"1","author":"V. Zivojnovic","year":"1994","unstructured":"V. Zivojnovic, J. M. Velarde, C. Schl\u00e4ger, and H. Meyr. DSPstone: a DSP-oriented benchmarking methodology. In Proc. 5th Int. Conf. on Signal Processing Applications & Technology, volume 1, pp. 715-720, Dallas, October 1994.","journal-title":"Proc. 5th Int. Conf. on Signal Processing Applications & Technology"},{"key":"205903_CR2","unstructured":"P. Marwedel and G. Goossens, Eds. Code Generation for Embedded Processors. Kluwer Academic Publishers, 1995."},{"issue":"3","key":"205903_CR3","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1109\/5.558718","volume":"85","author":"G. Goossens","year":"1997","unstructured":"G. Goossens, J. V. Praet, D. Lanneer, W. Geurts, A. Kifli, C. Liem, and P. G. Paulin. Embedded software in real-time signal processing systems: design technologies. Proc. IEEE, 85(3): 436-454, March 1997.","journal-title":"Proc. IEEE"},{"key":"205903_CR4","doi-asserted-by":"crossref","unstructured":"R. Leupers. Retargetable Code Generation for Digital Signal Processors. Kluwer Academic Publishers, 1997.","DOI":"10.1007\/978-1-4757-2570-4"},{"key":"205903_CR5","doi-asserted-by":"crossref","unstructured":"C. Liem. Retargetable Compilers for Embedded Core Processors. Kluwer Academic Publishers, 1997.","DOI":"10.1007\/978-1-4757-6422-2"},{"issue":"2","key":"205903_CR6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1002\/spe.4380220202","volume":"22","author":"D. H. Bartley","year":"1992","unstructured":"D. H. Bartley. Optimizing stack frame accesses for processors with restricted addressing modes. Software-Practice and Experience, 22(2): 101-110, February 1992.","journal-title":"Software-Practice and Experience"},{"issue":"3","key":"205903_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1145\/229542.229543","volume":"18","author":"S. Liao","year":"1996","unstructured":"S. Liao, S. Devadas, K. Keutzer, S. Tjiang, and A. Wang. Storage assignment to decrease code size. ACM Trans. on Programming Languages and Systems, 18(3): 235-253, May 1996.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"205903_CR8","doi-asserted-by":"crossref","unstructured":"R. Leupers and P. Marwedel. Algorithms for address assignment in DSP code generation. In Proc. IEEE Int. Conf. on Computer-Aided Design, pp. 109-112, San Jose, November 1996.","DOI":"10.1109\/ICCAD.1996.569409"},{"key":"205903_CR9","first-page":"249","volume":"2","author":"N. Sugino","year":"1996","unstructured":"N. Sugino, H. Myiazaki, S. Iimuro, and A. Nishihara. Improved code optimization method utilizing memory addressing and its application to compilers. In Proc. IEEE Int. Symp. on Circuits and Systems, volume 2, pp. 249-252, Atlanta, May 1996.","journal-title":"Proc. IEEE Int. Symp. on Circuits and Systems"},{"key":"205903_CR10","first-page":"683","volume":"1","author":"B. Wess","year":"1997","unstructured":"B. Wess and M. Gotschlich. Constructing memory layouts for address generation units supporting offset 2 access. In Proc. IEEE Int. Conf. on Acoustics, Speech, and Signal Processing, volume 1, pp. 683-686, Munich, April 1997.","journal-title":"Proc. IEEE Int. Conf. on Acoustics, Speech, and Signal Processing"},{"key":"205903_CR11","unstructured":"N. Kogure, N. Sugino, and A. Nishihara. Memory address allocation method for a DSP with \u00b12 update operations in indirect addressing. In Proc. Europ. Conf. on Circuit Theory and Design, Budapest, September 1997."},{"key":"205903_CR12","doi-asserted-by":"crossref","unstructured":"A. Sudarsanam, S. Liao, and S. Devadas. Analysis and evaluation of address arithmetic capabilities in custom DSP architectures. In Proc. 34th ACM\/IEEE Design Automation Conf., Anaheim, June 1997.","DOI":"10.1145\/266021.266103"},{"key":"205903_CR13","unstructured":"Analog Devices, Inc. ADSP-2100 Family User's Manual, September 1995."},{"key":"205903_CR14","unstructured":"Motorola, Inc. DSP56000 Digital Signal Processor Family Manual, 1992."},{"key":"205903_CR15","unstructured":"Texas Instruments, Inc. TMS320C5x User's Guide, 1997."},{"key":"205903_CR16","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"C. H. Papadimitriou","year":"1976","unstructured":"C. H. Papadimitriou. The NP-completeness of the bandwidth minimization problem. Computing, 16: 263-270, 1976.","journal-title":"Computing"},{"issue":"4","key":"205903_CR17","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1137\/0601042","volume":"1","author":"J. B. Saxe","year":"1980","unstructured":"J. B. Saxe. Dynamic-programming algorithms for recognizing small-bandwidth graphs in polynomial time. SIAM J. Alg. Disc. Meth., 1(4): 363-369, December 1980.","journal-title":"SIAM J. Alg. Disc. Meth."},{"issue":"3","key":"205903_CR18","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1137\/0134037","volume":"34","author":"M. R. Garey","year":"1978","unstructured":"M. R. Garey, R. L. Graham, D. S. Johnson, and D. E. Knuth. Complexity results for bandwidth minimization. SIAM J. Appl. Math., 34(3): 477-495, May 1978.","journal-title":"SIAM J. Appl. Math."},{"key":"205903_CR19","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0377-2217(84)90093-6","volume":"15","author":"R. E. Burkard","year":"1984","unstructured":"R. E. Burkard. Quadratic assignment problems. Europ. Journal of Operational Research, 15: 283-289, 1984.","journal-title":"Europ. Journal of Operational Research"},{"key":"205903_CR20","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0377-2217(84)90231-5","volume":"17","author":"R. E. Burkard","year":"1984","unstructured":"R. E. Burkard and F. Rendl. A thermodynamically motivated simulation procedure for combinatorial optimization problems. Europ. Journal of Operational Research, 17: 169-174, 1984.","journal-title":"Europ. Journal of Operational Research"},{"issue":"1","key":"205903_CR21","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1287\/ijoc.2.1.33","volume":"2","author":"J. Skorin-Kapov","year":"1990","unstructured":"J. Skorin-Kapov. Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing, 2(1): 33-45, 1990.","journal-title":"ORSA Journal on Computing"},{"issue":"4598","key":"205903_CR22","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick Jr.","year":"1983","unstructured":"S. Kirkpatrick, Jr., C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220(4598): 671-680, May 1983.","journal-title":"Science"},{"key":"205903_CR23","first-page":"305","volume":"10","author":"P. C. Gilmore","year":"1962","unstructured":"P. C. Gilmore. Optimal and suboptimal algorithms for the quadratic assignment problem. J. SIAM, 10: 305-313, 1962.","journal-title":"J. SIAM"},{"key":"205903_CR24","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/mnsc.9.4.586","volume":"9","author":"E. L. Lawler","year":"1963","unstructured":"E. L. Lawler. The quadratic assignment problem. Management Science, 9: 586-599, 1963.","journal-title":"Management Science"}],"container-title":["Design Automation for Embedded Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008961206784.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008961206784\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008961206784.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:09:30Z","timestamp":1752458970000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008961206784"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":24,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["205903"],"URL":"https:\/\/doi.org\/10.1023\/a:1008961206784","relation":{},"ISSN":["0929-5585","1572-8080"],"issn-type":[{"type":"print","value":"0929-5585"},{"type":"electronic","value":"1572-8080"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}