{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T11:44:19Z","timestamp":1648899859764},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,6,20]],"date-time":"2009-06-20T00:00:00Z","timestamp":1245456000000},"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"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s11265-009-0386-8","type":"journal-article","created":{"date-parts":[[2009,6,19]],"date-time":"2009-06-19T06:45:34Z","timestamp":1245393934000},"page":"51-65","source":"Crossref","is-referenced-by-count":2,"title":["Signal Assignment Model for the Memory Management of Multidimensional Signal Processing Applications"],"prefix":"10.1007","volume":"63","author":[{"given":"Florin","family":"Balasa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilie I.","family":"Luican","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongwei","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doru V.","family":"Nasui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,6,20]]},"reference":[{"key":"386_CR1","doi-asserted-by":"crossref","unstructured":"Luican, I.\u00a0I., Zhu, H., & Balasa, F. (2008). Efficient assignment algorithm for mapping multidimensional signals into the physical memory. In Proc. IEEE int. conf. acoustics, speech, and signal processing (pp.\u00a01409\u20131412). Las Vegas NV.","DOI":"10.1109\/ICASSP.2008.4517883"},{"issue":"2","key":"386_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1145\/375977.375978","volume":"6","author":"PR Panda","year":"2001","unstructured":"Panda, P.\u00a0R., 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 Systems, 6(2), 149\u2013206.","journal-title":"ACM Transactions on Design Automation of Electronic Systems"},{"key":"386_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.\u00a0G., Van Achteren, T., et al. (2002). Data access and storage management for embedded programmable processors. Boston: Kluwer."},{"key":"386_CR4","series-title":"Special issue on \u201cParallel Processing and Multimedia\u201d (Vol. 23)","first-page":"1811","volume-title":"Parallel computing","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. In A. Krikelis (Ed.), Parallel computing (Special issue on \u201cParallel Processing and Multimedia\u201d) (Vol.\u00a023, no.\u00a012, pp.\u00a01811\u20131837). Amsterdam: Elsevier."},{"key":"386_CR5","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.\u00a0167\u2013181).","DOI":"10.1007\/3-540-47813-2_12"},{"key":"386_CR6","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/S0167-8191(98)00029-5","volume":"24","author":"V Lefebvre","year":"1998","unstructured":"Lefebvre, V., & Feautrier, P. (1998). Automatic storage management for parallel programs. Parallel Computing, 24, 649\u2013671.","journal-title":"Parallel Computing"},{"issue":"5","key":"386_CR7","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1145\/365151.365152","volume":"22","author":"F Quiller\u00e9","year":"2000","unstructured":"Quiller\u00e9, F., & Rajopadhye, S. (2000). Optimizing memory usage in the polyhedral model. ACM Transactions on Programming Languages and Systems, 22(5), 773\u2013815.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"386_CR8","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":"386_CR9","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.","journal-title":"IEEE Transactions on Computers"},{"key":"386_CR10","volume-title":"Algorithms and parallel VLSI architectures","author":"I Verbauwhede","year":"1991","unstructured":"Verbauwhede, I., Catthoor, F., Vandewalle, J., & De Man, H. (1991). In-place memory management of algebraic algorithms on application specific processors. In E. Deprettere, et al. (Eds.), Algorithms and parallel VLSI architectures. Amsterdam: Elsevier."},{"issue":"7","key":"386_CR11","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1109\/TCAD.2003.814257","volume":"22","author":"PG Kjeldsberg","year":"2003","unstructured":"Kjeldsberg, P.\u00a0G., Catthoor, F., & Aas, E.\u00a0J. (2003). Data dependency size estimation for use in memory optimization. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems, 22(7), 908\u2013921.","journal-title":"IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems"},{"issue":"4","key":"386_CR12","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.\u00a0I. (2007). Computation of storage requirements for multi-dimensional signal processing applications. IEEE Transactions on VLSI Systems, 15(4), 447\u2013460.","journal-title":"IEEE Transactions on VLSI Systems"},{"key":"386_CR13","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."},{"key":"386_CR14","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-3-540-31985-6_7","volume-title":"Compiler construction: 14th int. conf. (Vol.\u00a03443)","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.\u00a03443, pp.\u00a091\u2013105). New York: Springer."},{"key":"386_CR15","doi-asserted-by":"crossref","unstructured":"Luican, I.\u00a0I., Zhu, H., & Balasa, F. (2007). Signal-to-memory mapping analysis for multimedia signal processing. In Proc. asia & south-pacific design automation conf. (pp.\u00a0486\u2013491). Yokohama, Japan.","DOI":"10.1109\/ASPDAC.2007.358033"},{"key":"386_CR16","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C Berge","year":"1957","unstructured":"Berge, C. (1957). Two theorems in graph theory. Proceedings of the National Academy of Sciences of the United States of America, 43, 842\u2013844.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"386_CR17","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J. (1965). Paths, trees, and flowers. Canadian Journal of Mathematics, 17, 449\u2013467.","journal-title":"Canadian Journal of Mathematics"},{"key":"386_CR18","unstructured":"Gabow, H.\u00a0N. (1973). Implementation of algorithms for maximum matching on non-bipartite graphs. Ph.D. Thesis, Stanford University."},{"issue":"4","key":"386_CR19","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1145\/115234.115366","volume":"38","author":"HN Gabow","year":"1991","unstructured":"Gabow, H.\u00a0N., & Tarjan, R.\u00a0E. (1991). Faster scaling algorithms for general graph-matching problems. Journal of the ACM, 38(4), 815\u2013853.","journal-title":"Journal of the ACM"},{"key":"386_CR20","series-title":"DIMACS series in discrete mathematics and theoretical computer science","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1090\/dimacs\/012\/22","volume-title":"Network flows and matchings","author":"D Applegate","year":"1993","unstructured":"Applegate, D., & Cook, W. (1993) Solving large-scale matching problems. In D. Johnson & C.\u00a0C. McGeoch (Eds.), Network flows and matchings. DIMACS series in discrete mathematics and theoretical computer science (Vol.\u00a012, pp.\u00a0557\u2013576). Providence: American Mathematical Society."},{"key":"386_CR21","unstructured":"Rothberg, E. (2009). FTP Directory. ftp:\/\/dimacs.rutgers.edu\/pub\/netflow\/ ."},{"issue":"3","key":"386_CR22","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s11265-008-0165-y","volume":"53","author":"G Talavera","year":"2008","unstructured":"Talavera, G., Jayapala, M., Carrabina, J., & Catthoor, F. (2008) Address generation optimization for embedded high-performance processors: A survey. Journal of Signal Processing Systems, 53(3), 271\u2013284.","journal-title":"Journal of Signal Processing Systems"},{"issue":"4","key":"386_CR23","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1137\/0613061","volume":"13","author":"M Moonen","year":"1992","unstructured":"Moonen, M., Dooren, P.\u00a0V., & 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":"386_CR24","unstructured":"Tom\u2019s Hardware (2009). Benchmark marathon: 65 CPUs from 100 MHz to 3066\u00a0MHz. http:\/\/www.tomshardware.com\/2003\/02\/17\/benchmark_marathon\/index.html ."}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-009-0386-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-009-0386-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-009-0386-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T08:19:31Z","timestamp":1559377171000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-009-0386-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,20]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["386"],"URL":"https:\/\/doi.org\/10.1007\/s11265-009-0386-8","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,20]]}}}