{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:37:22Z","timestamp":1754487442527,"version":"3.41.2"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997,1]]},"DOI":"10.1023\/a:1008806425898","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T11:51:56Z","timestamp":1040557916000},"page":"33-60","source":"Crossref","is-referenced-by-count":29,"title":["APGAN and RPMC: Complementary Heuristics for Translating DSP Block Diagrams into Efficient Software Implementations"],"prefix":"10.1007","volume":"2","author":[{"given":"Shuvra S.","family":"Bhattacharyya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Praveen K.","family":"Murthy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward A.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"120510_CR1","unstructured":"M. Ade, R. Lauwereins and A. Peperstraete. Buffer memory requirements in DSP applications. IEEE Wkshp. on Rapid System Prototyping, June 1994."},{"key":"120510_CR2","volume-title":"Memorandum UCB\/ERL M95\/3","author":"S. S. Bhattacharyya","year":"1995","unstructured":"S. S. Bhattacharyya, P. K. Murthy and E. A. Lee. Two complementary heuristics for translating graphical DSP programs into minimum memory software implementations. Memorandum UCB\/ERL M95\/3, ElectronicsResearch Laboratory, University of California at Berkeley, Jan., 1995."},{"key":"120510_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1389-2","volume-title":"Software Synthesis from Dataflow Graphs","author":"S. S. Bhattacharyya","year":"1996","unstructured":"S. S. Bhattacharyya, P K. Murthy and E. A. Lee. Software Synthesis from Dataflow Graphs. Kluwer Academic Publishers, Norwell MA, 1996."},{"key":"120510_CR4","doi-asserted-by":"crossref","unstructured":"S. S. Bhattacharyya and E. A. Lee. Scheduling synchronous dataflow graphs for efficient looping. Jo. ofVLSI Signal Processing, Dec. 1993.","DOI":"10.1007\/BF01608539"},{"key":"120510_CR5","unstructured":"J. Buck, S. Ha, E. A. Lee and D. G. Messerschmitt. Ptolemy: a framework for simulating and prototyping heterogeneous systems. International Journal of Computer Simulation, Jan. 1995."},{"key":"120510_CR6","unstructured":"T. H. Cormen, C. E. Leiserson and R. L. Rivest. Introduction to Algorithms. McGraw-Hill, 1990."},{"key":"120510_CR7","unstructured":"J. Fabri. Automatic Storage Optimization. UMI Research Press, 1982."},{"key":"120510_CR8","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability-A Guide to the Theory of NP-Completeness.Freeman, 1979."},{"key":"120510_CR9","unstructured":"R. Govindarajan, G. R. Gao and P. Desai. Minimizing memory requirements in rate-optimal schedules. Proc.of the Intl. Conf: on Application Specific Array Processors, San Francisco, Aug. 1994."},{"key":"120510_CR10","doi-asserted-by":"crossref","unstructured":"B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System TechnicaJournal, Feb. 1970.","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"120510_CR11","unstructured":"R. Lauwereins, P. Wauters, M. Ade and J. A. Peperstraete. Geometric parallelism and cyclo-static dataflowin GRAPE-II. IEEE Wkshp. on Rapid System Prototyping, June 1994."},{"key":"120510_CR12","doi-asserted-by":"crossref","unstructured":"E. A. Lee, W. H. Ho, E. Goei, J. Bier and S. S. Bhattacharyya. Gabriel: A design environment for DSP.IEEE Trans. on Acoustics, Speech, and Signal Processing, Nov. 1989.","DOI":"10.1109\/29.46557"},{"key":"120510_CR13","doi-asserted-by":"crossref","unstructured":"E. A. Lee, D. G. Messerschmitt. Static scheduling of synchronous dataflow programs for digital signal processing. IEEE Trans. on Computers, Feb. 1987.","DOI":"10.1109\/TC.1987.5009446"},{"key":"120510_CR14","unstructured":"P. K. Murphy, S. S. Bhaaacharyya and E. A. Lee. \"Joint Minimization of Code and Data for SynchronousDataflow Programs,\" Journal of Formal Methods in System Design, to appear in 1996."},{"key":"120510_CR15","volume-title":"Memorandum CMJ-CS-91-141","author":"D. R. O'Hallaron","year":"1991","unstructured":"D. R. O'Hallaron. The Assign Parallel Program Generator, Memorandum CMJ-CS-91-141, School of Computer Science, Carnegie Mellon University, May 1991."},{"key":"120510_CR16","doi-asserted-by":"crossref","unstructured":"J. Pino, S. Ha, E. A. Lee and J. T. Buck. Software synthesis for DSP using Ptolemy. Invited paper in Jo. of VLSI Signal Processing. Jan. 1995.","DOI":"10.1007\/BF02406468"},{"key":"120510_CR17","unstructured":"S. Ritz, S. Pankert, and H. Meyr. High level software synthesis for signal processing systems. Proc. of the Intl. Conf. on Application Specific Array Processors, Aug. 1992."},{"key":"120510_CR18","unstructured":"S. Ritz, M. Willems and II. Meyr. Scheduling for optimum data memory compaction in block diagram oriented software synthesis. Proceedings of the ICASSP 95, Detroit, Michigan, May 1995."}],"container-title":["Design Automation for Embedded Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008806425898.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008806425898\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008806425898.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:18:19Z","timestamp":1752459499000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008806425898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["120510"],"URL":"https:\/\/doi.org\/10.1023\/a:1008806425898","relation":{},"ISSN":["0929-5585","1572-8080"],"issn-type":[{"type":"print","value":"0929-5585"},{"type":"electronic","value":"1572-8080"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}