Converting affine recurrence equations to quasi-uniform recurrence equations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 319 LNCS, Issue , 1988, Pages 319-328

  Yaacoby, Yoav ^a   Cappello, Peter R ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SYSTOLIC ARRAYS; VLSI CIRCUITS;

AFFINE RECURRENCE EQUATIONS; AFFINE SYSTEMS; DEPENDENT VARIABLES; EQUIVALENT SYSTEM; PROBLEM SIZE; SPACETIME; SYSTEM OF RECURRENCE EQUATIONS; UNIFORM RECURRENCE EQUATIONS;

COMPUTER ARCHITECTURE;

EID: 0004015608     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0040399     Document Type: Conference Paper

References (11)

1. P. R. Cappello and K. Steiglitz. Unifying VLSI array design with linear transformations of space-time. In F. P. Preparate, editor, Advances in Computing Research, vol. 2, VLSI Theory, pages 23-65, JAI Press, Inc., 1984.
2. C. Choffrut and K. Culik II. Folding of the plane and the design of systolic arrays. Information Processing Letters, 17:149-153, 1983.
3. J.-M. Delosme and I. C. F. Ipsen. An illustration of a methodology for the construction of efficient systolic architectures in VLSI. In Proc. 2nd Int. Symp. on VLSI Technology, Systems and Applications, pages 268-273, Taipei, 1985.
4. J-M Delosme and I. C. F. Ipsen. Systolic Array Synthesis: Computability and Time Cones. Technical Report Yale/DCS/RR-474, Yale, May 1986.
5. J. A. B. Fortes and D. I. Moldovan. Parallelism detection and algorithm transformation techniques useful for VLSI architecture design. J. Parallel Distrib. Comput, 2:277-301, Aug. 1985.
6. R. M. Karp, R. E. Miller, and S. Winograd. The organization of computations for uniform recurrence equations. J. ACM, 14:563-590, 1967.
7. D. I. Moldovan. On the design of algorithms for VLSI systolic arrays. Proc. IEEE, 71(1):113-120, Jan. 1983.
8. M. Newman. Matrix representation of groups. In Applied Mathematics Series-60, Institute for Basic Standards, National Bureau of Standards, Washington D.C. 20234, July 1968.
9. S. K. Rao. Regular Iterative Algorithms and Their Implementation on Processor Arrays. PhD thesis, Stanford University, October 1985.
10. Y. Yaacoby and P. R. Cappello. Converting Affine Recurrence Equations to Quasi-Uniform Recurrence Equations. Technical Report 18, Dept. Computer Science, UCSB, Santa Barbara, CA 93106, Feb. 1988.
11. Y. Yaacoby, P. R. Cappello, D. Witt, and K. C. Millett. Computing a Fundamental Region for a Finite Matrix Group Acting on a Euclidean Space. Technical Report 4, Dept. Computer Science, UCSB, Santa Barbara, CA 93106, Feb. 1988.