{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:29:33Z","timestamp":1748334573003,"version":"3.32.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of VLSI Signal Processing"],"published-print":{"date-parts":[[1995,10]]},"DOI":"10.1007\/bf02106826","type":"journal-article","created":{"date-parts":[[2005,9,13]],"date-time":"2005-09-13T02:45:45Z","timestamp":1126579545000},"page":"113-131","source":"Crossref","is-referenced-by-count":6,"title":["Converting affine recurrence equations to quasi-uniform recurrence equations"],"prefix":"10.1007","volume":"11","author":[{"given":"Yoav","family":"Yaacoby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Cappello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1995,10,1]]},"reference":[{"key":"BF02106826_CR1","first-page":"271","volume-title":"Introduction to VLSI Systems","author":"H.-T. Kung","year":"1980","unstructured":"H.-T. Kung and Charles E. Leiserson, \u201cAlgorithms for VLSI processor arrays,\u201dIntroduction to VLSI Systems, Menlo Park, CA: Addison-Wesley Publishing Co., 1980, pp. 271\u2013292."},{"issue":"No. 1","key":"BF02106826_CR2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/MC.1982.1653825","volume":"15","author":"H.-T. Kung","year":"1982","unstructured":"H.-T. Kung, \u201cWhy systolic architectures?,\u201dComputer, Vol. 15, No. 1, pp. 37\u201345, January 1982.","journal-title":"Computer"},{"key":"BF02106826_CR3","unstructured":"S.-Y. Kung, \u201cOn supercomputing with systolic\/wavefront array processors,\u201dProceedings of the IEEE, July 1984."},{"key":"BF02106826_CR4","doi-asserted-by":"crossref","unstructured":"Charles E. Leiserson, and James B. Saxe, \u201cOptimizing synchronous systems,\u201dProc. IEEE 22nd Annual Symp. Foundations of Computer Science, Oct. 1981.","DOI":"10.1109\/SFCS.1981.34"},{"key":"BF02106826_CR5","volume-title":"Proc. Third Caltech Conf. on VLSI","author":"Charles E. Leiserson","year":"1983","unstructured":"Charles E. Leiserson, Flavio M. Rose, and James B. Saxe, \u201cOptimizing synchronous circuitry by retiming,\u201dProc. Third Caltech Conf. on VLSI, Rockville, MD: Computer Science Press, 1983."},{"key":"BF02106826_CR6","volume-title":"Computational Aspects of VLSI","author":"Jeffrey D. Ullman","year":"1984","unstructured":"Jeffrey D. Ullman,Computational Aspects of VLSI, Rockville, MD: Computer Science Press, Inc., 1984."},{"issue":"No. 3","key":"BF02106826_CR7","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1137\/0213034","volume":"13","author":"R.G. Melhem","year":"1984","unstructured":"R.G. Melhem and W.C. Rheinboldt, \u201cA mathematical model for the verification of systolic networks,\u201dSIAM J. Computing, Vol. 13, No. 3, pp. 541\u2013565, 1984.","journal-title":"SIAM J. Computing"},{"key":"BF02106826_CR8","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/321406.321418","volume":"14","author":"Richard M. Karp","year":"1967","unstructured":"Richard M. Karp, Richard E. Miller, and Shmuel Winograd, \u201cThe organization of computations for uniform recurrence equations,\u201dJ. ACM, Vol. 14, pp. 563\u2013590, 1967.","journal-title":"J. ACM"},{"key":"BF02106826_CR9","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1137\/0114108","volume":"14","author":"Richard M. Karp","year":"1966","unstructured":"Richard M. Karp, Richard E. Miller, and Shmuel Winograd, \u201cProperties of a model for parallel computations: Determinacy, termination, queueing,\u201dSIAM J. Appl. Math, Vol. 14, pp. 1390\u20131411, 1966.","journal-title":"SIAM J. Appl. Math"},{"key":"BF02106826_CR10","volume-title":"VLSI & Modern Signal Processing","author":"Marina C. Chen","year":"1985","unstructured":"Marina C. Chen and Carver Mead, \u201cConcurrent algorithms as space-time recursion equations,\u201d S.-Y. Kung, H. J. Whitehouse, and Thomas Kailath (Eds.),VLSI & Modern Signal Processing, Englewood Cliffs: Prentice-Hall, 1985."},{"key":"BF02106826_CR11","doi-asserted-by":"crossref","unstructured":"Patrice Quinton, \u201cAutomatic synthesis of systolic arrays from uniform recurrent equations,\u201dProc. 11th Ann. Symp. on Computer Architecture, pp. 208\u2013214, 1984.","DOI":"10.1145\/800015.808184"},{"key":"BF02106826_CR12","volume-title":"Ph.D. Thesis","author":"Peter R. Cappello","year":"1982","unstructured":"Peter R. Cappello, \u201cVLSI Architectures for Digital Signal Processing,\u201d Ph.D. Thesis, Princeton University, Princeton, NJ, October 1982."},{"key":"BF02106826_CR13","first-page":"23","volume-title":"Advances in Computing Research, Vol. 2: VLSI Theory","author":"Peter R. Cappello","year":"1984","unstructured":"Peter R. Cappello and Kenneth Steiglitz, \u201cUnifying VLSI array design with linear transformations of space-time,\u201d Franco P. Preparata (Ed.),Advances in Computing Research, Vol. 2: VLSI Theory, Greenwich, CT: JAI Press, Inc., 1984, pp. 23\u201365."},{"key":"BF02106826_CR14","doi-asserted-by":"crossref","unstructured":"Jos\u00e9 A. B. Fortes, King-Sun Fu, and Benjamin W. Wah, \u201cSystematic approaches to the design of algorithmically specified systolic arrays,\u201dProc. Int. Conf. on Acoustics, Speech, and Signal Processing, Tampa, 1985, pp. 300\u2013303.","DOI":"10.1109\/ICASSP.1985.1168513"},{"key":"BF02106826_CR15","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1109\/PROC.1983.12532","volume":"71","author":"Dan I. Moldovan","year":"1983","unstructured":"Dan I. Moldovan, \u201cOn the design of algorithms for VLSI systolic arrays,\u201dProc. IEEE, Vol. 71, pp. 113\u2013120, 1983.","journal-title":"Proc. IEEE"},{"key":"BF02106826_CR16","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1109\/TC.1982.1675929","volume":"C-31","author":"Dan I. Moldovan","year":"1982","unstructured":"Dan I. Moldovan, \u201cOn the analysis and synthesis of VLSI algorithms,\u201dIEEE Trans. Comput., Vol. C-31, pp. 1121\u20131126, 1982.","journal-title":"IEEE Trans. Comput."},{"key":"BF02106826_CR17","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF02253685","volume":"32","author":"Willard L. Miranker","year":"1984","unstructured":"Willard L. Miranker and Andrew Winkler, \u201cSpacetime representations of computational structures,\u201dComputing, Vol. 32, pp. 93\u2013114, 1984.","journal-title":"Computing"},{"key":"BF02106826_CR18","first-page":"37","volume-title":"Systolic Arrays","author":"Jean-Marc Delosme","year":"1987","unstructured":"Jean-Marc Delosme and Ilse Ipsen, \u201cEfficient systolic arrays for the solution of toeplitz systems: An illustration of a methodology for the construction of systolic architectures in VLSI,\u201d W. Moore et al. (Ed.),Systolic Arrays, Bristol: Adam Hilger, 1987, pp. 37\u201346."},{"key":"BF02106826_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TC.1986.1676652","volume":"C-35","author":"Dan I. Moldovan","year":"1986","unstructured":"Dan I. Moldovan and Jos\u00e9 A. B. Fortes, \u201cPartitioning and mapping algorithms into fixed systolic arrays,\u201dIEEE Trans. Comput., Vol. C-35, pp. 1\u201312, 1986.","journal-title":"IEEE Trans. Comput."},{"key":"BF02106826_CR20","unstructured":"Sailesh K. Rao, \u201cRegular Iterative Algorithms and Their Implementation on Processor Arrays,\u201d Ph.D. Thesis, Stanford University, October 1985."},{"key":"BF02106826_CR21","unstructured":"Jean-Marc Delosme and Ilse C. F. Ipsen, \u201cSystolic array synthesis: Computability and time cones,\u201d Technical Report Yale\/DCS\/RR-474, Yale, May 1986."},{"key":"BF02106826_CR22","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0020-0190(83)90055-8","volume":"17","author":"C. Choffrut","year":"1983","unstructured":"C. Choffrut and K. Culik II, \u201cFolding of the plane and the design of systolic arrays,\u201dInformation Processing Letters, Vol. 17, pp. 149\u2013153, 1983.","journal-title":"Information Processing Letters"},{"key":"BF02106826_CR23","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1109\/VLSISP.1992.641069","volume-title":"VLSI Signal Processing V","author":"Sanjay Rajopadhye","year":"1992","unstructured":"Sanjay Rajopadhye, Lap Mui, and Sayfe Kiaei, \u201cPiecewise linear schedules for recurrence equations,\u201d Kung Yao et al. (Eds.),VLSI Signal Processing V, New York: IEEE Press, October 1992, pp. 375\u2013384."},{"key":"BF02106826_CR24","doi-asserted-by":"crossref","unstructured":"Alain Darte, Leonid Khachiyan, and Yves Robert, \u201cLinear scheduling is close to optimal,\u201d Jos\u00e9 Fortes et al. (Eds.),Application Specific Array Processors, IEEE Computer Society Press, August 1992, pp. 37\u201346.","DOI":"10.1109\/ASAP.1992.218583"},{"key":"BF02106826_CR25","volume-title":"Computer science","author":"Xiaoxiong Zhong","year":"1992","unstructured":"Xiaoxiong Zhong and Sanjay Rajopadhye, \u201cOptimal parallel schedules for uniform recurrence equations,\u201d Computer science, University of Oregon, Eugene, 1992."},{"key":"BF02106826_CR26","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1109\/12.90251","volume":"40","author":"Weijia Shang","year":"1991","unstructured":"Weijia Shang and Jos\u00e9 A. B. Fortes, \u201cTime optimal linear schedules for algorithms with uniform dependencies,\u201dIEEE Trans. Comput., Vol. 40, pp. 723\u2013742, 1991.","journal-title":"IEEE Trans. Comput."},{"key":"BF02106826_CR27","volume-title":"Ph.D. Thesis","author":"Yoav Yaacoby","year":"1988","unstructured":"Yoav Yaacoby, \u201cComputing Systems of Affine Recurrence Equations on Processor Arrays,\u201d Ph.D. Thesis, University of California, Santa Barbara, Santa Barbara, CA, May 1988."},{"key":"BF02106826_CR28","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/TASSP.1983.1164051","volume":"31","author":"Sun-Yuan Kung","year":"1983","unstructured":"Sun-Yuan Kung and Y. H. Hu, A highly concurrent algorithm and pipelined architecture for solving toeplitz systems,IEEE Trans. on Acoustics, Speech, and Signal Processing, Vol. 31, pp. 66\u201374, 1983.","journal-title":"IEEE Trans. on Acoustics, Speech, and Signal Processing"},{"key":"BF02106826_CR29","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0024-3795(86)90163-1","volume":"77","author":"J.-M. Delosme","year":"1986","unstructured":"J.-M. Delosme and I. C. F. Ipsen, \u201cParallel solution of symmetric positive definite systems with hyperbolic rotations,\u201dLinear Algebra Appl., Vol. 77, pp.75\u2013111, 1986.","journal-title":"Linear Algebra Appl."},{"key":"BF02106826_CR30","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1109\/TC.1979.1675434","volume":"C-28","author":"U. Banerjee","year":"1979","unstructured":"U. Banerjee, S.-C. Chen, D. J. Kuck, and R. A. Towle, \u201cTime and parallel processor bounds for Fortran-like loops,\u201dIEEE Trans. Computers, Vol. C-28, pp. 660\u2013670, 1979.","journal-title":"IEEE Trans. Computers"},{"key":"BF02106826_CR31","volume-title":"Graph Theory","author":"F. Harary","year":"1972","unstructured":"F. Harary,Graph Theory, Reading, MA: Addison-Wesley, 1972."},{"key":"BF02106826_CR32","volume-title":"Algebraic Coding Theory","author":"E.R. Berlekamp","year":"1968","unstructured":"E.R. Berlekamp,Algebraic Coding Theory, New York: McGraw-Hill Book Company, 1968."},{"key":"BF02106826_CR33","volume-title":"Applied Mathematics Series -60","author":"M. Newman","year":"1968","unstructured":"M. Newman, \u201cMatrix representation of groups,\u201dApplied Mathematics Series -60. Institute for Basic Standards, National Bureau of Standards, Washington D.C. 20234, July 1968."},{"key":"BF02106826_CR34","volume-title":"Representation Theory of Finite Groups and Associative Algebras","author":"C.W. Curtis","year":"1962","unstructured":"C.W. Curtis and I. Reiner,Representation Theory of Finite Groups and Associative Algebras, New York: John Wiley & Sons, 1962."},{"key":"BF02106826_CR35","volume-title":"Technical Report 4","author":"Yoav Yaacoby","year":"1988","unstructured":"Yoav Yaacoby, Peter R. Cappello, D. Witt, and K.C. Millett, \u201cComputing a fundamental region for a finite matrix group acting on a Euclidean space,\u201d Technical Report 4, Dept. Computer Science, UCSB, Santa Barbara, CA 93106, Feb. 1988."},{"key":"BF02106826_CR36","unstructured":"Yoav Yaacoby, Peter R. Cappello, D. Witt, and K.C. Millett, Computing a fundamental region for a finite matrix group acting on a Euclidean space, Submitted toSIAM J. Computing, 1988."},{"key":"BF02106826_CR37","volume-title":"Regular Polytopes","author":"H.S.M. Coxeter","year":"1973","unstructured":"H.S.M. Coxeter,Regular Polytopes, New York: Dover Publications, Inc., third edition, 1973.","edition":"third edition"},{"key":"BF02106826_CR38","volume-title":"Graph Algorithms","author":"Shimon Even","year":"1979","unstructured":"Shimon Even,Graph Algorithms, Rockville, MD: Computer Science Press, Inc., 1979."},{"key":"BF02106826_CR39","doi-asserted-by":"crossref","unstructured":"Yuepeng Zheng and Sayfe Kiaei, \u201cMulti-rate transformation of directional affine recurrence equations,\u201d Luigi Dadda and Benjamin Wah (Eds.),Proc. Int. Conf. Application-Specific Array Processors, Venice, Italy, October 1993, pp. 392\u2013403.","DOI":"10.1109\/ASAP.1993.397161"}],"container-title":["Journal of VLSI signal processing systems for signal, image and video technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02106826.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02106826\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02106826","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T01:50:48Z","timestamp":1735955448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02106826"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":39,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["BF02106826"],"URL":"https:\/\/doi.org\/10.1007\/bf02106826","relation":{},"ISSN":["0922-5773"],"issn-type":[{"type":"print","value":"0922-5773"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}