{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T02:28:39Z","timestamp":1767839319661,"version":"3.49.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1023\/a:1015452903532","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T18:44:51Z","timestamp":1041101091000},"page":"207-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":44,"title":["Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks"],"prefix":"10.1007","volume":"31","author":[{"given":"R.","family":"Govindarajan","sequence":"first","affiliation":[]},{"given":"Guang R.","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Palash","family":"Desai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,1]]},"reference":[{"issue":"1","key":"407312_CR1","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/TC.1987.5009446","volume":"36","author":"E. A. Lee","year":"1987","unstructured":"E. Ashford Lee and D.G. Messerschmitt, \u201cStatic Scheduling of Synchronous Data Flow Programs for Digital Signal Processing, IEEE Transactions on Computers, vol. 36,no. 1, 1987, pp. 24-35.","journal-title":"IEEE Transactions on Computers"},{"key":"407312_CR2","series-title":"Published as Memorandum","volume-title":"Automatic Mapping of Large Signal Processing Systems to a Parallel Machine","author":"H. Printz","year":"1991","unstructured":"H. Printz, \u201cAutomatic Mapping of Large Signal Processing Systems to a Parallel Machine,\u201d Ph.D. Thesis. Published as Memorandum CMU-CS-91-101, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Pennsylvania, 1991."},{"key":"407312_CR3","unstructured":"S. Ritz, M. Pankert, and H. Meyr, \u201cHigh Level Software Synthesis for Signal Processing Systems,\u201d in Proceedings of the 1992 International Conference on Application Specific Array Processors, Berkeley, California, Aug. 4\u20137, 1992."},{"key":"407312_CR4","series-title":"ACAPS Technical Memo","volume-title":"Construction Rules for Well-Behaved Stream Programs","author":"G.R. Gao","year":"1992","unstructured":"G.R. Gao, R. Govindarajan, and P. Panangaden, \u201cConstruction Rules for Well-Behaved Stream Programs,\u201d ACAPS Technical Memo 26, School of Computer Science, McGill University, Montr\u00e9al, Qu\u00e9bec, April 1992."},{"key":"407312_CR5","series-title":"Lecture Notes in Computer Science","first-page":"362","volume-title":"Proceedings of the Colloque sur la Programmation","author":"J.B. Dennis","year":"1975","unstructured":"J.B. Dennis, \u201cFirst Version of a Data-Flow Procedure Language,\u201d in Proceedings of the Colloque sur la Programmation, Lecture Notes in Computer Science, vol. 19, Berlin: Springer-Verlag, 1975, pp. 362-376."},{"key":"407312_CR6","doi-asserted-by":"crossref","unstructured":"B.R. Rau and C.D. Glaeser, \u201cSome Scheduling Techniques and an Easily Schedulable Horizontal Architecture for High Performance Scientific Computing,\u201d in Proceedings of the 14th Annual Microprogramming Workshop, Chatham, Massachusetts, Oct. 12\u201315, 1981, pp. 183-198.","DOI":"10.1145\/1014192.802449"},{"key":"407312_CR7","doi-asserted-by":"crossref","unstructured":"M. Lam, \u201cSoftware Pipelining: An Effective Scheduling Technique for VLIW Machines,\u201d in Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, Atlanta, Georgia, June 22\u201324, 1988, pp. 318-328.","DOI":"10.1145\/53990.54022"},{"issue":"3","key":"407312_CR8","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1145\/212094.212131","volume":"27","author":"V.H. Allan","year":"1995","unstructured":"V.H. Allan, R.B. Jones, R.M. Lee, and S.J. Allan, \u201cSoftware Pipelining,\u201d ACM Computing Surveys, vol. 27,no. 3, 1995, pp. 367-432.","journal-title":"ACM Computing Surveys"},{"key":"407312_CR9","doi-asserted-by":"crossref","unstructured":"R. Govindarajan and G.R. Gao, \u201cA Novel Framework for Multi-Rate Scheduling in DSP Applications,\u201d in Proceedings of the 1993 International Conference on Application Specific Array Processors, Venice, Italy, Oct. 25\u201327, 1993, pp. 77-88.","DOI":"10.1109\/ASAP.1993.397122"},{"issue":"3","key":"407312_CR10","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF02407086","volume":"9","author":"R. Govindarajan","year":"1995","unstructured":"R. Govindarajan and G.R. Gao, \u201cRate-Optimal Schedule for Multi-Rate DSP Computations,\u201d Journal of VLSI Signal Processing, vol. 9,no. 3, 1995, pp. 211-232.","journal-title":"Journal of VLSI Signal Processing"},{"issue":"1","key":"407312_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/92.273152","volume":"2","author":"L.-G. Jeng","year":"1994","unstructured":"L.-G. Jeng and L.-G. Chen, \u201cRate-Optimal DSP Synthesis by Pipeline and Minimum Unfolding,\u201d IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 2,no. 1, 1994, pp. 81-88.","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"},{"key":"407312_CR12","doi-asserted-by":"crossref","unstructured":"D.B. Powell, E.A. Lee, and W.C. Newman, \u201cDirect Synthesis of Optimized DSP Assembly Code from Signal Flow Block Diagrams,\u201d in Proceedings of ICASSP-92, the 1992 International Conference on Acoustics, Speech, and Signal Processing, San Francisco, California, March 23\u201326, 1992, pp. 553-556.","DOI":"10.1109\/ICASSP.1992.226560"},{"key":"407312_CR13","doi-asserted-by":"crossref","unstructured":"Q. Ning and G.R. Gao, \u201cA Novel Framework of Register Allocation for Software Pipelining,\u201d in Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, SC, Jan. 10\u201313, 1993, pp. 29-42.","DOI":"10.1145\/158511.158519"},{"key":"407312_CR14","unstructured":"G.C. Sih, \u201cMultiprocessor Scheduling to Account for Interprocessor Communication,\u201d Ph.D. Thesis, Memorandum no. UCB\/ERL M91\/29, Electronics Research Laboratory, University of California at Berkeley, 1991."},{"key":"407312_CR15","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/71.89067","volume":"2","author":"E.A. Lee","year":"1990","unstructured":"E.A. Lee, \u201cConsistency in Dataflow Graphs,\u201d IEEE Transactions on Parallel and Distributed Systems, vol. 2, 1990, pp. 223-235.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"4","key":"407312_CR16","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1145\/321479.321485","volume":"15","author":"R. Reiter","year":"1968","unstructured":"R. Reiter, \u201cScheduling Parallel Computations,\u201d J. of the ACM, vol. 15,no. 4, 1968, pp. 590-599.","journal-title":"J. of the ACM"},{"key":"407312_CR17","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Ft. Worth, Texas: Saunders College Publishing, 1976."},{"key":"407312_CR18","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","volume":"23","author":"R.M. Karp","year":"1978","unstructured":"R.M. Karp, \u201cA Characterization of the Minimum Cycle Mean in a Digraph,\u201d Discrete Mathematics, vol. 23, 1978, pp. 309-311.","journal-title":"Discrete Mathematics"},{"issue":"11","key":"407312_CR19","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1109\/71.544355","volume":"7","author":"R. Govindarajan","year":"1996","unstructured":"R. Govindarajan, E.R. Altman, and G.R. Gao, \u201cA Framework for Resource-Constrained Rate-Optimal Software Pipelining,\u201d IEEE Transactions on Parallel and Distributed Systems, vol. 7,no. 11, 1996, pp. 1133-1149.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"2","key":"407312_CR20","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1006\/jpdc.1998.1442","volume":"49","author":"E.R. Altman","year":"1998","unstructured":"E.R. Altman, R. Govindarajan, and G.R. Gao, \u201cA Unified Framework for Instruction Scheduling and Mapping for Function Units with Structural Hazards,\u201d Journal of Parallel and Distributed Computing, vol. 49,no. 2, 1998, pp. 259-294.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"407312_CR21","series-title":"Technical Report SFB","volume-title":"Optimal Software Pipelining under Resource Constraints","author":"D. Fimmel","year":"1999","unstructured":"D. Fimmel and J. Muller, \u201cOptimal Software Pipelining under Resource Constraints,\u201d Technical Report SFB 358-A1-1\/99, Dresden University of Technology, Germany, 1999. Available at http:\/\/www.iee.et.tu-dresden.de\/~desa\/A1\/Pipeline.ps.zip."},{"key":"407312_CR22","series-title":"ACAPS Technical Note","volume-title":"An Implementation of a Multi-Rate Scheduling Testbed","author":"P. Desai","year":"1993","unstructured":"P. Desai, \u201cAn Implementation of a Multi-Rate Scheduling Testbed,\u201d ACAPS Technical Note, School of Computer Science, McGill University, Montreal, Qu\u00e9bec, 1993."},{"key":"407312_CR23","doi-asserted-by":"crossref","unstructured":"G. Liao, E.R. Altman, V.K. Agarwal, and G.R. Gao, \u201cA Comparative Study of DSP Multiprocessor List Scheduling Heuristics,\u201d in Proceedings of the International Hawaii System Science Conference, Hawaii, 1994.","DOI":"10.1109\/HICSS.1994.323184"},{"key":"407312_CR24","series-title":"ACAPS Technical Memo","volume-title":"A Petri-Net Model for Fine-Grain Loop Scheduling","author":"G.R. Gao","year":"1991","unstructured":"G.R. Gao, Y.-B. Wong, and Q. Ning, \u201cA Petri-Net Model for Fine-Grain Loop Scheduling,\u201d ACAPS Technical Memo 18, School of Computer Science, McGill University, Montr\u00e9al, Qu\u00e9bec, Jan. 1991."},{"key":"407312_CR25","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0096-0551(81)90048-5","volume":"6","author":"G.J. Chaitin","year":"1981","unstructured":"G.J. Chaitin, M.A. Auslander, A.K. Chandra, J. Cocke, M.E. Hopkins, and P.W. Markstein, \u201cRegister Allocation via Coloring,\u201d Computer Languages, vol. 6, 1981, pp. 47-57.","journal-title":"Computer Languages"},{"key":"407312_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-55984-1_17","volume-title":"Proceedings of the 4th International Conference on Compiler Construction, CC '92","author":"L.J. Hendren","year":"1992","unstructured":"L.J. Hendren, G.R. Gao, E.R. Altman, and C. Mukerji, \u201cA Register Allocation Framework Based on Hierarchical Cyclic Interval Graphs,\u201d in Proceedings of the 4th International Conference on Compiler Construction, CC '92, Paderborn, Germany, Oct. 5\u20137, 1992, U. Kastens and P. Pfahler, (Ed.), Lecture Notes in Computer Science, vol. 641, Berlin: Springer-Verlag pp. 176-191."},{"key":"407312_CR27","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, New York: Academic Press, 1980."},{"key":"407312_CR28","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0196-6774(92)90012-2","volume":"13","author":"T. Kashiwabara","year":"1992","unstructured":"T. Kashiwabara, S. Masuda, K. Nakajsma, and T. Fujisawa, \u201cGeneration of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular Are Graph. Interval, Circular-Arc and Chordal Craphs,\u201d Journal of Algorithms, vol. 13, 1992, pp. 161-1745.","journal-title":"Journal of Algorithms"},{"key":"407312_CR29","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/0196-6774(84)90037-3","volume":"5","author":"J.Y.T. Leung","year":"1984","unstructured":"J.Y.T. Leung, \u201cFast Algorithms for Generating All Maximum Independent Sets of Interval, Circular-Arc and Chordal Graphs,\u201d Journal of Algorithms, vol. 5, 1984, pp. 22-35.","journal-title":"Journal of Algorithms"},{"key":"407312_CR30","doi-asserted-by":"crossref","unstructured":"S.S. Bhattacharyya and E.A. Lee, \u201cScheduling Synchronous Dataflow Graphs for Efficient Looping,\u201d Journal of VLSI Signal Processing, vol. 6,no. 3, 1993.","DOI":"10.1007\/BF01608539"},{"issue":"11","key":"407312_CR31","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1109\/12.102826","volume":"40","author":"S. Ha","year":"1991","unstructured":"S. Ha and E.A. Lee, \u201cCompile-Time Scheduling and Assignment of Data-Flow Program Graphs with Data-Dependent Iteration,\u201d IEEE Transactions on Computers, Vol. 40,no. 11, 1991, pp. 1225-1238.","journal-title":"IEEE Transactions on Computers"},{"key":"407312_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1007\/3-540-57208-2_26","volume-title":"Proceedings of the 4th International Conference on Concurrency Theory","author":"M. \u010cubri\u0107","year":"1993","unstructured":"M. \u010cubri\u0107 and P. Panangaden, \u201cMinimal Memory Schedules for Dataflow Networks,\u201d In Proceedings of the 4th International Conference on Concurrency Theory, Hildesheim, Germany, Aug. 23\u201326, 1993, Eike Best (Ed.), Lecture Notes in Computer Science, vol. 715, Berlin: Springer-Verlag, pp. 368-383."},{"issue":"2","key":"407312_CR33","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/12.73588","volume":"40","author":"K.K. Parhi","year":"1991","unstructured":"K.K. Parhi and D.G. Messerschmitt, \u201cStatic Rate-Optimal Scheduling of Iterative Data-Flow Programs via Optimum Unfolding,\u201d IEEE Transactions on Computers, vol. 40,no. 2, 1991, pp. 178-195.","journal-title":"IEEE Transactions on Computers"},{"key":"407312_CR34","unstructured":"L.E. Lucke and K.K. Parhi, \u201cGeneralized ILP Scheduling and Allocation for High-Level DSP Synthesis,\u201d in Proceedings of the 1993 IEEE Custom Integrated Circuits Conference, 1993."},{"key":"407312_CR35","doi-asserted-by":"crossref","unstructured":"L.-F. Chao and E.H.-M. Sha, \u201cRate-Optimal Static Scheduling for DSP Dataflow Programs,\u201d in Proceedings of 1993 Great Lakes Symposium on VLSI, March 1993, pp. 80-84.","DOI":"10.1109\/GLSV.1993.224475"},{"key":"407312_CR36","doi-asserted-by":"crossref","unstructured":"C.E. Leiserson, F.M. Rose, and J.B. Saxe, \u201cOptimizing Synchronous Circuitry by Retiming,\u201d in Proceedings of the Third Caltech Conference on VLSI, Pasadena, California, March 1983, pp. 87-116.","DOI":"10.1007\/978-3-642-95432-0_7"},{"key":"407312_CR37","unstructured":"P.D. Hoang, \u201cCompiling Real-Time Digital Signal Processing Applications onto Multiprocessor Systems,\u201d Ph.D. Thesis, Memorandum no. UCB\/ERL M92\/68, Electronics Research Laboratory, University of California at Berkeley, 1992."},{"key":"407312_CR38","doi-asserted-by":"crossref","unstructured":"S. Ritz, M. Pankert, V. \u017divojnovi\u0107, and H. Meyr, \u201cOptimum Vectorization of Scalable Synchronous Dataflow Graphs,\u201d in Proceedings of the 1993 International Conference on Application Specific Array Processors, Venice, Italy, Oct. 25\u201327, 1993, pp. 285-296.","DOI":"10.1109\/ASAP.1993.397152"},{"issue":"4","key":"407312_CR39","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1109\/43.75629","volume":"10","author":"C.-T. Hwang","year":"1991","unstructured":"C.-T. Hwang, J.-H. Lee, and Y.-C. Hsu, \u201cA Formal Approach to the Scheduling Problem in High-Level Synthesis,\u201d IEEE Transactions on Computer-Aided Design, vol. 10,no. 4, 1991, pp. 464-475.","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"407312_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/3-540-55895-0_462","volume-title":"Proceedings of the Conference on Vector and Parallel Processing, CONPAR-92","author":"V. van Dongen","year":"1992","unstructured":"V. van Dongen, G.R. Gao, and Q. Ning, \u201cA Polynomial Time Method for Optimal Software Pipelining,\u201d in Proceedings of the Conference on Vector and Parallel Processing, CONPAR-92, Lyon, France, Berlin: Springer-Verlag, Sept. 1\u20134, 1992, Lecture Notes in Computer Science, vol. 634, pp. 613-624."},{"key":"407312_CR41","doi-asserted-by":"crossref","unstructured":"J. Ramanujam, \u201cOptimal Software Pipelining of Nested Loops,\u201d in Proceedings of the 8th International Parallel Processing Symposium, Canc\u00fan, Mexico, April 26\u201329, 1994, pp. 335-342.","DOI":"10.1109\/IPPS.1994.288280"},{"key":"407312_CR42","unstructured":"F. Depuydt, W. Geurts, G. Goossens, and H. De Man, \u201cOptimal Scheduling and Software Pipelining of a Repetitive Signal Flow Graphs with Delay Line Optimization,\u201d in Proc. of the EDDA European Design and Test Conference, Paris, France, Feb. 1994."},{"key":"407312_CR43","doi-asserted-by":"crossref","unstructured":"A.E. Eichenberger and E.S. Davidson, \u201cEfficient Formulation for Optimal Modulo Schedulers,\u201d in Proceedings of the ACM SIGPLAN '97 Conference on Programming Language Design and Implementation, Las Vegas, Nevada, June 15\u201318, 1997, pp. 194-205.","DOI":"10.1145\/258915.258933"},{"key":"407312_CR44","unstructured":"M. Potkonjak and J. Rabey, \u201cRetiming for Scheduling,\u201d in Proceedings of the VLSI Signal Processing Workshop, 1990."},{"issue":"1","key":"407312_CR45","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/71.655240","volume":"9","author":"P.-Y. Calland","year":"1998","unstructured":"P.-Y. Calland, A. Darte, and Y. Robert, \u201cCircuit Retiming Applied to Decomposed Software Pipelining,\u201d IEEE Transactions on Parallel and Distributed Systems, vol. 9,no. 1, 1998, pp. 24-35.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"407312_CR46","doi-asserted-by":"crossref","unstructured":"N. Passos, E.H.-M. Sha, and S. Bass, \u201cScheduled-Based Multi-Dimensional Retiming on Data Flow Graphs,\u201d in Proceedings of the 8th International Parallel Processing Symposium, Canc\u00fan, Mexico, April 26\u201329, 1994, pp. 195-199.","DOI":"10.1109\/IPPS.1994.288301"},{"key":"407312_CR47","doi-asserted-by":"crossref","unstructured":"T.C. Denk, M. Majumdar, and K.K. Parhi, \u201cTwo-Dimensional Retiming with Low Memory Requirements,\u201d in Proceedings of ICASSP-96, the 1996 International Conference on Acoustics, Speech, and Signal Processing, Atlanta, Georgia, May 1996, pp. 3330-3333.","DOI":"10.1109\/ICASSP.1996.550590"},{"key":"407312_CR48","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF00924988","volume":"12","author":"T.C. Denk","year":"1996","unstructured":"T.C. Denk and K.K. Parhi, \u201cLower Bounds on Memory Requirements for Statically Scheduled DSP Programs,\u201d Journal of VLSI Signal Processing, vol. 12, 1996, pp. 247-264.","journal-title":"Journal of VLSI Signal Processing"},{"key":"407312_CR49","unstructured":"P.K. Murthy and S.S. Bhattacharyya, \u201cA Buffer Merging Technique for Reducing Memory Requirements of Synchronous Dataflow Specifications,\u201d in Proceedings of the International Symposium on Systems Synthesis, San Jose, CA, Nov. 1999."},{"issue":"1","key":"407312_CR50","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1008633809454","volume":"11","author":"P.K. Murthy","year":"1997","unstructured":"P.K. Murthy, S.S. Bhattacharyya, and E.A. Lee, \u201cJoint Minimization of Code and Data for Synchronous Data Flow Programs,\u201d Journal on Formal Methods in System Design, vol. 11,no. 1, 1997, pp. 41-70.","journal-title":"Journal on Formal Methods in System Design"},{"key":"407312_CR51","doi-asserted-by":"crossref","unstructured":"E. Teich, J. Zitzler, and S.S. Bhattacharyya, \u201cBuffer Memory Optimization in DSP Applications\u2014An Evolutionary Approach,\u201d in Proceedings of the International Conference on Parallel Problem Solving from Nature, Amsterdam, The Netherlands, Sept. 1999, pp. 885-894.","DOI":"10.1007\/BFb0056930"},{"key":"407312_CR52","unstructured":"S. Ritz, M. Willems, and H. Meyr, \u201cScheduling for Optimum Data Memory Compaction in Block Diagram Oriented Software Synthesis,\u201d in Proceedings of ICASSP-95, the 1995 International Conference on Acoustics, Speech, and Signal Processing, 1995."}],"container-title":["Journal of VLSI signal processing systems for signal, image and video technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015452903532.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1015452903532\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015452903532.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T09:37:01Z","timestamp":1754905021000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1015452903532"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":52,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["407312"],"URL":"https:\/\/doi.org\/10.1023\/a:1015452903532","relation":{},"ISSN":["0922-5773"],"issn-type":[{"value":"0922-5773","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]},"assertion":[{"value":"1 July 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}