{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,5]],"date-time":"2023-10-05T12:33:48Z","timestamp":1696509228498},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2008,6,14]],"date-time":"2008-06-14T00:00:00Z","timestamp":1213401600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst Sign Image Video Technol"],"published-print":{"date-parts":[[2008,11]]},"DOI":"10.1007\/s11265-008-0244-0","type":"journal-article","created":{"date-parts":[[2008,6,13]],"date-time":"2008-06-13T15:56:22Z","timestamp":1213372582000},"page":"51-71","source":"Crossref","is-referenced-by-count":11,"title":["Storage Estimation and Design Space Exploration Methodologies for the Memory Management of Signal Processing Applications"],"prefix":"10.1007","volume":"53","author":[{"given":"F.","family":"Balasa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. G.","family":"Kjeldsberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Vandecappelle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Palkovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Q.","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Catthoor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,6,14]]},"reference":[{"key":"244_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2849-1","volume-title":"Custom memory management methodology: Exploration of memory organization for embedded multimedia system design","author":"F. Catthoor","year":"1998","unstructured":"Catthoor, F., Wuytack, S., De Greef, E., Balasa, F., Nachtergaele, L., & Vandecappelle, A. (1998). Custom memory management methodology: Exploration of memory organization for embedded multimedia system design. Boston: Kluwer Academic Publishers."},{"issue":"2","key":"244_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1145\/375977.375978","volume":"6","author":"P. R. Panda","year":"2001","unstructured":"Panda, P. R., Catthoor, F., Dutt, N., Dankaert, K., Brockmeyer, E., Kulkarni, C., et al. (2001). Data and memory optimization techniques for embedded systems. ACM Transactions on Design Automation of Electronic System, 6(2), 149\u2013206, April.","journal-title":"ACM Transactions on Design Automation of Electronic System"},{"key":"244_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4903-8","volume-title":"Data access and storage management for embedded programmable processors","author":"F. Catthoor","year":"2002","unstructured":"Catthoor, F., Danckaert, K., Kulkarni, C., Brockmeyer, E., Kjeldsberg, P. G., Van Achteren, T., et al. (2002). Data access and storage management for embedded programmable processors. Boston: Kluwer Acad. Publ."},{"key":"244_CR4","unstructured":"Van Achteren, T., Deconinck, G., Catthoor, F., & Lauwereins, R. (2002). Data reuse exploration methodology for loop-dominated applications. In Proc. ACM\/IEEE design and test in Europe conf. (pp. 428\u2013435). Paris, France (April)."},{"key":"244_CR5","doi-asserted-by":"crossref","unstructured":"Hu, Q., Vandecappelle, A., Palkovic, M., Kjeldsberg, P. G., Brockmeyer, E., & Catthoor, F. (2006). Hierarchical memory size estimation for loop fusion and loop shifting in data-dominated applications. In Proc. Asia & S.-Pacific design automation conf. (pp. 606\u2013611). Yokohama, Japan (January)","DOI":"10.1145\/1118299.1118442"},{"key":"244_CR6","unstructured":"Luican, I. I., Zhu, H., & Balasa, F. (2006). Formal model of data reuse analysis for hierarchical memory organizations. In Proc. IEEE\/ACM int. conf. comp.-aided design (pp. 595\u2013600). San Jose CA (November)."},{"key":"244_CR7","first-page":"1070","volume-title":"Proc. ACM\/IEEE design automation and test in Europe conf","author":"E. Brockmeyer","year":"2003","unstructured":"Brockmeyer, E., Miranda, M., Catthoor, F., & Corporaal, H. (2003). Layer assignment techniques for low energy in multi-layered memory organisations. In Proc. ACM\/IEEE design automation and test in Europe conf. (pp. 1070\u20131075). Munich, Germany (March)."},{"issue":"3","key":"244_CR8","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1109\/TCAD.1986.1270207","volume":"CAD-5","author":"C. J. Tseng","year":"1986","unstructured":"Tseng, C. J., & Siewiorek, D. (1986). Automated synthesis of data paths in digital systems. IEEE Transactions on Computer-Aided Design of ICs and Systems, CAD-5(3), 379\u2013395, July.","journal-title":"IEEE Transactions on Computer-Aided Design of ICs and Systems"},{"key":"244_CR9","unstructured":"Goossens, G., Rabaey, J., Vandewalle, J., & De Man, H. (1987). An efficient microcode compiler for custom DSP processors. In Proc. IEEE int. conf. comp.-aided design (pp. 24\u201327). Santa Clara CA (November)."},{"key":"244_CR10","doi-asserted-by":"crossref","unstructured":"Hashimoto, A., & Stevens, J. (1971). Wire routing by optimizing channel assignment within large apertures. In Proc. 8th design automation workshop (pp. 155\u2013169).","DOI":"10.1145\/800158.805069"},{"key":"244_CR11","doi-asserted-by":"crossref","unstructured":"Kurdahi, F. J., & Parker, A. C. (1987). REAL: A program for register allocation. In Proc. 24th ACM\/IEEE design automation conf. (pp. 210\u2013215).","DOI":"10.1145\/37888.37920"},{"key":"244_CR12","unstructured":"Goossens, G. (1989). Optimization techniques for automated synthesis of application-specific signal-processing architectures. Ph.D. thesis, K.U. Leuven, Belgium."},{"issue":"6","key":"244_CR13","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1109\/43.31522","volume":"8","author":"P. G. Paulin","year":"1989","unstructured":"Paulin, P. G., & Knight, J. P. (1989). Force-directed scheduling for the behavioral synthesis of ASIC\u2019s. IEEE Transactions on Computer-Aided Design of ICs and System, 8(6), 661\u2013679, June.","journal-title":"IEEE Transactions on Computer-Aided Design of ICs and System"},{"key":"244_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4018-2","volume-title":"Optimal VLSI architectural synthesis","author":"C. H. Gebotys","year":"1992","unstructured":"Gebotys, C. H., & Elmasry, M. I. (1992). Optimal VLSI architectural synthesis. Boston: Kluwer Academic Publ."},{"key":"244_CR15","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1002\/cta.4490200304","volume":"20","author":"L. Stok","year":"1992","unstructured":"Stok, L., & Jess, J. (1992). Foreground memory management in data path synthesis. International Journal of Circuit Theory and Applications, 20, 235\u2013255.","journal-title":"International Journal of Circuit Theory and Applications"},{"issue":"6","key":"244_CR16","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1109\/82.300209","volume":"41","author":"K. K. Parhi","year":"1994","unstructured":"Parhi, K. K. (1994). Calculation of minimum number of registers in arbitrary life time chart. IEEE Transactions on Circuits and Systems - II: Analog and Digital Signal Processing, 41(6), 434\u2013436.","journal-title":"IEEE Transactions on Circuits and Systems - II: Analog and Digital Signal Processing"},{"key":"244_CR17","unstructured":"Ohm, S. Y., Kurdahi, F. J., & Dutt, N. (1994). Comprehensive lower bound estimation from behavioral descriptions. In Proc. IEEE\/ACM int. conf. on computer-aided design (pp. 182\u2013187)."},{"key":"244_CR18","volume-title":"Specification and design of embedded systems","author":"D. Gajski","year":"1994","unstructured":"Gajski, D., Vahid, F., Narayan, S., & Gong, J. (1994). Specification and design of embedded systems. Englewood Cliffs: Prentice Hall."},{"key":"244_CR19","first-page":"143","volume-title":"Proc. 31st ACM\/IEEE design automation conf","author":"I. Verbauwhede","year":"1994","unstructured":"Verbauwhede, I., Scheers, C., & Rabaey, J. M. (1994). Memory estimation for high level synthesis. In Proc. 31st ACM\/IEEE design automation conf. (pp. 143\u2013148) (June)."},{"key":"244_CR20","unstructured":"Verbauwhede, I., Catthoor, F., Vandewalle, J., & De Man, H. (1989). Background memory management for the synthesis of algebraic algorithms on multi-processor dsp chips. In Proc. int. conf. on VLSI (pp. 209\u2013218). Munich, Germany (August)."},{"key":"244_CR21","doi-asserted-by":"crossref","unstructured":"Grun, P., Balasa, F., & Dutt, N. (1998). Memory size estimation for multimedia applications. In Proc. 6th int. workshop hardware\/software co-design (pp. 145\u2013149). Seattle WA (March).","DOI":"10.1109\/HSC.1998.666252"},{"issue":"5","key":"244_CR22","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1109\/92.894155","volume":"8","author":"Y. Zhao","year":"2000","unstructured":"Zhao, Y., & Malik, S. (2000). Exact memory size estimation for array computations. IEEE Transactions on VLSI System, 8(5), 517\u2013521.","journal-title":"IEEE Transactions on VLSI System"},{"key":"244_CR23","doi-asserted-by":"crossref","unstructured":"Ramanujam, J., Hong, J., Kandemir, M., & Narayan, A. (2001). Reducing memory requirements of nested loops for embedded systems. In Proc. 38th ACM\/IEEE design automation conf. (pp. 359\u2013364) (June).","DOI":"10.1145\/378239.378523"},{"issue":"2","key":"244_CR24","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/92.386218","volume":"3","author":"F. Balasa","year":"1995","unstructured":"Balasa, F., Catthoor, F., & De Man, H. (1995). Background memory area estimation for multi-dimensional signal processing systems. IEEE Transactions on VLSI System, 3(2), 157\u2013172, June.","journal-title":"IEEE Transactions on VLSI System"},{"issue":"2","key":"244_CR25","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/43.573828","volume":"16","author":"F. Balasa","year":"1997","unstructured":"Balasa, F., Catthoor, F., & De Man, H. (1997). Practical solutions for counting scalars and dependences in ATOMIUM \u2013 a memory management system for multi-dimensional signal processing. IEEE Transactions on CAD of IC\u2019s and System, 16(2), 133\u2013145, February.","journal-title":"IEEE Transactions on CAD of IC\u2019s and System"},{"key":"244_CR26","doi-asserted-by":"crossref","first-page":"1242","DOI":"10.1109\/TC.2005.167","volume":"54","author":"A. Darte","year":"2005","unstructured":"Darte, A., Schreiber, R., & Villard, G. (2005). Lattice-based memory allocation. IEEE Transactions on Computers, 54, 1242\u20131257, October.","journal-title":"IEEE Transactions on Computers"},{"key":"244_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-6894-6","volume-title":"Dependence analysis for supercomputing","author":"U. Banerjee","year":"1988","unstructured":"Banerjee, U. (1988). Dependence analysis for supercomputing. Boston: Kluwer Acad. Publ."},{"key":"244_CR28","unstructured":"IMEC (2006). Atomium web site. http:\/\/www.imec.be\/design\/atomium\/ ."},{"key":"244_CR29","unstructured":"Hu, Q., Vandecappelle, A., Kjeldsberg, P. G., Catthoor, F., & Palkovic, M. (2007). Fast memory footprint estimation based on dependency distance vector calculation. In Proc. ACM\/IEEE design automation and test in Europe (pp. 379\u2013384). Nice, France (April)."},{"issue":"7","key":"244_CR30","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1109\/TCAD.2003.814257","volume":"22","author":"P. G. Kjeldsberg","year":"2003","unstructured":"Kjeldsberg, P. G., Catthoor, F., & Aas, E. J. (2003). Data dependency size estimation for use in memory optimization. IEEE Transactions on CAD of IC\u2019s and System, 22(7), 908\u2013921, July.","journal-title":"IEEE Transactions on CAD of IC\u2019s and System"},{"key":"244_CR31","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/989995.989996","volume":"9","author":"P. G. Kjeldsberg","year":"2004","unstructured":"Kjeldsberg, P. G., Catthoor, F., & Aas, E. J. (2004). Storage requirement estimation for optimized design of data intensive applications. ACM Transactions on Design Automation of Electronic Systems, 9, 133\u2013158, April.","journal-title":"ACM Transactions on Design Automation of Electronic Systems"},{"key":"244_CR32","doi-asserted-by":"crossref","unstructured":"Kjeldsberg, P. G., Catthoor, F., & Aas, E. J. (2001). Detection of partially simultaneously alive signals in storage requirement estimation for data-intensive applications. In Proc. 38th ACM\/IEEE design automation conf. (pp.\u00a0365\u2013370). Las Vegas NV (June).","DOI":"10.1109\/DAC.2001.935536"},{"issue":"4","key":"244_CR33","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1137\/0613061","volume":"13","author":"M. Moonen","year":"1992","unstructured":"Moonen, M., Dooren, P. V., & Vandewalle, J. (1992). An SVD updating algorithm for subspace tracking. SIAM Journal on Matrix Analysis and Applications, 13(4), 1015\u20131038.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"244_CR34","volume-title":"Theory of linear and integer programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A. (1986). Theory of linear and integer programming. New York: Wiley."},{"key":"244_CR35","volume-title":"State-of-the-art in computer science","author":"L. Thiele","year":"1992","unstructured":"Thiele, L. (1992). Compiler techniques for massive parallel architectures. In P. Dewilde (Ed.), State-of-the-art in computer science. Boston: Kluwer Acad. Publ."},{"key":"244_CR36","doi-asserted-by":"crossref","unstructured":"Zhu, H., Luican, I. I., & Balasa, F. (2006). Memory size computation for multimedia processing applications. In Proc. Asia & South-Pacific design automation conf. (pp. 802\u2013807). Yokohama, Japan (January).","DOI":"10.1145\/1118299.1118483"},{"issue":"4","key":"244_CR37","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1109\/TVLSI.2007.895246","volume":"15","author":"F. Balasa","year":"2007","unstructured":"Balasa, F., Zhu, H., & Luican, I. I. (2007). Computation of storage requirements for multi-dimensional signal processing applications. IEEE Transactions on VLSI Systems, 15(4), 447\u2013460, April.","journal-title":"IEEE Transactions on VLSI Systems"},{"key":"244_CR38","unstructured":"Pugh, W., & Wonnacott, D. (1993). An exact method for analysis of value-based array data dependences. In Proc. 6th int. workshop languages and compilers for parallel computing (pp.\u00a0546\u2013566). Portland OR (August)."},{"key":"244_CR39","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-3-540-31985-6_7","volume-title":"Compiler construction: 14th int. conf. Vol. 3443","author":"S. Verdoolaege","year":"2005","unstructured":"Verdoolaege, S., Beyls, K., Bruynooghe, M., & Catthoor, F. (2005). Experiences with enumeration of integer projections of parametric polytopes. In R. Bodik (Ed.), Compiler construction: 14th int. conf. (Vol. 3443, pp. 91\u2013105). Berlin: Springer.","edition":"3443"},{"issue":"2","key":"244_CR40","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1023\/A:1008069920230","volume":"19","author":"Ph. Clauss","year":"1998","unstructured":"Ph Clauss, Loechner, V. (1998). Parametric analysis of polyhedral iteration spaces. Journal of VLSI Signal Processing, 19(2), 179\u2013194.","journal-title":"Journal of VLSI Signal Processing"},{"key":"244_CR41","doi-asserted-by":"crossref","unstructured":"Verdoolaege, S., Seghir, R., Beyls, K., Loechner, V., & Bruynooghe, M. (2004). Analytical computation of Ehrhart polynomials: Enabling more compiler analyses and optimizations. In Proc. int. conf. compilers arch. and synthesis for embedded syst. (pp. 248\u2013258) (September).","DOI":"10.1145\/1023833.1023868"},{"key":"244_CR42","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0097-3165(73)90004-6","volume":"14","author":"G. B. Dantzig","year":"1973","unstructured":"Dantzig, G. B., Eaves, B. C. (1973). Fourier-Motzkin elimination and its dual. Journal of Combinatorial Theory (A), 14, 288\u2013297.","journal-title":"Journal of Combinatorial Theory (A)"},{"issue":"8","key":"244_CR43","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/135226.135233","volume":"35","author":"W. Pugh","year":"1992","unstructured":"Pugh, W. (1992). A practical algorithm for exact array dependence analysis. Communications of the ACM, 35(8), 102\u2013114, August.","journal-title":"Communications of the ACM"},{"issue":"4","key":"244_CR44","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1287\/moor.19.4.769","volume":"19","author":"A. I. Barvinok","year":"1994","unstructured":"Barvinok, A. I. (1994). A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed. Mathematics of Operations Research, 19(4), 769\u2013779, November.","journal-title":"Mathematics of Operations Research"},{"key":"244_CR45","volume-title":"Parallel computing (Vol. 23, no. 12)","author":"E. Greef De","year":"1997","unstructured":"De Greef, E., Catthoor, F., & De Man, H. (1997). Memory size reduction through storage order optimization for embedded parallel multimedia applications. special issue on \u201cParallel Processing and Multi-media. In A. Krikelis (Ed.), Parallel computing (Vol. 23, no. 12). Amsterdam: Elsevier (December)."},{"key":"244_CR46","doi-asserted-by":"crossref","unstructured":"Tron\u00e7on, R., Bruynooghe, M., Janssens, G., & Catthoor, F. (2002). Storage size reduction by in-place mapping of arrays. In A. Coresi (Ed.), Verification, model checking and abstract interpretation (pp. 167\u2013181).","DOI":"10.1007\/3-540-47813-2_12"},{"key":"244_CR47","doi-asserted-by":"crossref","unstructured":"Luican, I. I., Zhu, H., & Balasa, F. (2007). Signal-to-memory mapping analysis for multimedia signal processing. In Proc. Asia & South-Pacific design automation conf. (pp. 486\u2013491). Yokohama, Japan (January).","DOI":"10.1109\/ASPDAC.2007.358033"},{"key":"244_CR48","unstructured":"Absar, J., Catthoor, F., & Das K. (2003). Call-instance based function inlining for increasing data access related optimization opportunities. Technical report, IMEC, Leuven, Belgium."},{"key":"244_CR49","first-page":"540","volume-title":"Proc. systems, architectures, modeling, and simulation, LCNS Vol. 3133","author":"M. Dasygenis","year":"2004","unstructured":"Dasygenis, M., Brockmeyer, E., Durinck, B., Catthoor, F., Soudris, D., & Thanailakis, A. (2004). Power, Performance and Area Exploration for Data Memory Assignment of Multimedia Applications. In A. Pimentel, & S. Vassiliadis (Eds.), Proc. systems, architectures, modeling, and simulation, LCNS (Vol. 3133, pp. 540\u2013549). Samos: Springer-Verlag (June)."},{"key":"244_CR50","unstructured":"Shashidar, K. C., Vandecappelle, A., & Catthoor, F. (2001). Low power design of turbo decoder module with exploration of energy-performance trade-offs. In Proc. workshop on compilers and operating systems for low power in conjunction with Int. Conf. on parallel arch. and compilation techniques (pp. 10.1\u201310.6). Barcelona, Spain (September)."},{"key":"244_CR51","doi-asserted-by":"crossref","unstructured":"Bastoul, C. (2004). Code generation in the polyhedral model is easier than you think. In Proc. int. conf. on parallel arch. and compilation techniques (pp. 7\u201316). Juan-les-Pins, France (September).","DOI":"10.1109\/PACT.2004.1342537"},{"key":"244_CR52","doi-asserted-by":"crossref","unstructured":"Quillere, F., Rajopadhye, S., & Wilde, D. (2000). Generation of efficient nested loops from polyhedra. International Journal of Parallel Programming, 28(5), October.","DOI":"10.1023\/A:1007554627716"},{"issue":"2","key":"244_CR53","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/5.214548","volume":"81","author":"U. Banerjee","year":"1993","unstructured":"Banerjee, U., Eigenmann, R., Nicolau, A., & Padua, D. (1993). Automatic program parallelization. Proceedings of the IEEE, 81(2), 211\u2013243, February.","journal-title":"Proceedings of the IEEE"},{"issue":"1","key":"244_CR54","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01407931","volume":"20","author":"P. Feautrier","year":"1991","unstructured":"Feautrier, P. (1991). Dataflow analysis of array and scalar references. International Journal of Parallel Programming, 20(1), 23\u201352.","journal-title":"International Journal of Parallel Programming"},{"issue":"1","key":"244_CR55","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1006\/jpdc.1995.1105","volume":"29","author":"A. Darte","year":"1995","unstructured":"Darte, A., & Robert, Y. (1995). Affine-by-statement scheduling of uniform and affine loop nests over parametric domains. Journal on Parallel and Distributed Computing, 29(1), 43\u201359.","journal-title":"Journal on Parallel and Distributed Computing"},{"issue":"12","key":"244_CR56","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.1109\/TC.2001.970571","volume":"50","author":"M. Kandemir","year":"2001","unstructured":"Kandemir, M., Ramanujam, J., Choudhary, A., & Banerjee, P. (2001). A layout-conscious iteration space transformation technique. IEEE Transactions on Computers, 50(12), 1321\u20131335.","journal-title":"IEEE Transactions on Computers"},{"key":"244_CR57","unstructured":"Kelly, W., & Pugh, W. (1993). A framework for unifying reordering transformations. Univ. Maryland College Park, CS-TR-3193 (April)."},{"key":"244_CR58","doi-asserted-by":"crossref","unstructured":"Wolf, M. E., & Lam, M. S. (1991). A data locality optimizing algorithm. In Proc. SIGPLAN conf. on programming language design and implementation (pp. 30\u201343) Toronto, Canada (June).","DOI":"10.1145\/113445.113449"},{"key":"244_CR59","unstructured":"Bastoul, C., Cohen, A., Girbal, A., Sharma, S., & Temam, O. (2003). Putting polyhedral loop transformations to work. In Proc. int. workshop languages & compilers for parallel comput. (pp. 209\u2013225) (September)."},{"key":"244_CR60","unstructured":"Semeria, L., & De Micheli, G., (1998). SpC: Synthesis of pointers in C. In Proc. IEEE\/ACM int. conf. comp.-aided design (pp. 340\u2013346). Santa Clara CA (November)."},{"issue":"2","key":"244_CR61","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/643470.643472","volume":"2","author":"B. Franke","year":"2003","unstructured":"Franke, B., & O\u2019Boyle, M. (2003). Array recovery and high-level transformations for DSP applications. ACM Transactions Embedded Computing Systems, 2(2), 132\u2013162, May.","journal-title":"ACM Transactions Embedded Computing Systems"},{"key":"244_CR62","doi-asserted-by":"crossref","unstructured":"Vanbroekhoven, P., Janssens, G., Bruynooghe, M., Corporaal, H., & Catthoor, F. (2005). Transformation to dynamic single assignment using a simple data flow analysis. In Proc. 3rd Asian symp. on programming languages and syst., Tsukuba, Japan, and in Lecture Notes Comp. Sc. (Vol.\u00a03780, pp.\u00a0330\u2013346). Springer Verlag (November).","DOI":"10.1007\/11575467_22"},{"key":"244_CR63","doi-asserted-by":"crossref","unstructured":"Vanbroekhoven, P., Janssens, G., Bruynooghe, M., Corporaal, H., & Catthoor, F. (2003). Advanced copy propagation for arrays. In Proc. SIGPLAN conf. languages, compilers, and tools for embedded syst. (pp. 24\u201333). San Diego CA (June).","DOI":"10.1145\/780732.780736"},{"key":"244_CR64","doi-asserted-by":"crossref","unstructured":"Palkovic, M., Corporaal, H., & Catthoor, F. (2005). Global memory optimisation for embedded systems allowed by code duplication. In Proc. 9th int. Wsh. on software and compilers for embedded systems (pp. 72\u201380) (September).","DOI":"10.1145\/1140389.1140397"},{"key":"244_CR65","unstructured":"Palkovic, M., Corporaal, H., & Catthoor, F. (2008). Dealing with data dependent conditions to enable general global source code transformations. International Journal of Embedded Systems, Interscience Publ. (in press)."},{"issue":"1","key":"244_CR66","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1166\/jolpe.2006.002","volume":"2","author":"M. Palkovic","year":"2006","unstructured":"Palkovic, M., Brockmeyer, E., Vanbroekhoven, P., Corporaal, H., & Catthoor, F. (2006). Systematic pre processing of data dependent constructs for embedded systems. Journal of Low Power Electronics, 2(1), 9\u201317, April.","journal-title":"Journal of Low Power Electronics"},{"key":"244_CR67","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/978-1-4757-3182-8_2","volume-title":"Unified low-power design flow for data-dominated multi-media and telecom applications","author":"F. Catthoor","year":"2000","unstructured":"Catthoor, F., & Brockmeyer, E. (2000). Unified meta-flow summary for low-power data-dominated applications. In F. Catthoor (Ed.), Unified low-power design flow for data-dominated multi-media and telecom applications (pp. 7\u201323). Boston: Kluwer Acad. Publ."},{"key":"244_CR68","unstructured":"Pareto, V. (1896). Cours D\u2019Economie Politique, volume I\u2013II. Lausanne."},{"key":"244_CR69","unstructured":"Tom\u2019s Hardware (2003). Benchmark Marathon: 65 CPUs from 100 MHz to 3066 MHz (Online). Available: http:\/\/www.tomshardware.com\/2003\/02\/17\/benchmark_marathon\/index.html"},{"key":"244_CR70","first-page":"1141","volume-title":"Proc. 4th Eur. signal processing conf.","author":"P. Strobach","year":"1988","unstructured":"Strobach, P. (1988). QSDPCM \u2013 A new technique in scene adaptive coding. In Proc. 4th Eur. signal processing conf. (pp. 1141\u20131144). Grenoble, France, Amsterdam: Elsevier Publ. (September)."},{"key":"244_CR71","unstructured":"Palkovic, M. (2007). Enhanced applicability of loop transformations (Chapter 6). Ph.D. Thesis, Eindhoven University of Technology, Dept. of Electrical Eng. (September)."}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-008-0244-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-008-0244-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-008-0244-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T12:19:28Z","timestamp":1559391568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-008-0244-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,14]]},"references-count":71,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2008,11]]}},"alternative-id":["244"],"URL":"https:\/\/doi.org\/10.1007\/s11265-008-0244-0","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,14]]}}}