This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Class of Low Complexity High Concurrence Algorithms
October 1991 (vol. 2 no. 4)
pp. 495-502

A nonconventional approach to the analysis of dedicated computing structures in which the number of compute cycles is used as a design parameter to determine families of transformations implementable in the structure is presented. Using this approach, a single architecture can be used to implement a family of transformations with varying degrees of complexity. The transformations generated by a matrix multiplication array are considered in detail. It is shown that, for some real-time applications it becomes possible to incorporate the compute time as a constraint for designs based in optimality criteria. In particular, a least square approximation problem is discussed.

[1] A. Karatsuba and Yu. Ofman, "Multiplication of multidigit numbers on automata,"Soviet Physics Dokl., vol. 7, pp. 595-596, 1963.
[2] V. Strassen, "Gaussian elimination is not optimal,"Number Math., vol. 13, pp. 354-356, 1969.
[3] J. W. Cooley and J. W. Tukey, "An algorithm for the machine calculation of complex Fourier series,"Math. Comp., vol. 19, pp. 297-301, 1965.
[4] R. W. Brockett, and D. Dobkin, "On the optimal evaluation of a set of bilinear forms," inProc. 5th Annu. ACM Symp. Theory Comput., 1973, pp. 88-95.
[5] S. Winograd, "Arithmetic complexity of computations,"CBMS, vol. 33, SIAM, 1980.
[6] H. F. deGroote, "Lectures on the complexity of bilinear problems," inLecture Notes in Computer Science, vol. 245. Berlin, Germany: Springer-Verlag, 1987.
[7] R. E. Blahut,Fast Algorithms for Digital Signal Processing. Reading: MA: Addison-Wesley, 1985.
[8] J. L. Aravena, "Triple matrix product architectures for fast signal processing,"IEEE Trans. Circuit Syst., vol. 35, no. 1, pp. 119-122, Jan. 1988.
[9] J. L. Aravena, and W. A. Porter, "Array based design of digital filters,"IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-38, no. 9, pp. 1628-1632, Sept. 1990.
[10] J. L. Aravena, "Systematic design of fast discrete controllers," inAdvances in Computing and Control, Lecture Notes in Control and Information Sciences, vol. 130. Heidelberg, Germany: Springer-Verlag, 1989, pp. 128-138.
[11] J. L. Aravena and W. A. Porter, "Nonplanar switchable arrays,"J. Cont. Syst. Sig. Proc., vol. 7, no. 2, pp. 213-234, 1988.
[12] W. A. Porter, "An overview of polynomic system theory,"Proc. IEEE, Special Issue on System Theory, Jan. 1976.
[13] A. O. Barbir, "Systolic array implementations with reduced compute time," Ph.D. dissertation, Louisiana State Univ., Baton Rouge, LA, 1989.
[14] W. A. Porter, "Computational aspects of quadratic signal processing,"IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-38, no. 1, pp. 137-144, Jan. 1990.
[15] H. T. Kung, "Why systolic architectures?,"IEEE Comput. Mag., vol. 15, no. 1, pp. 37-46, 1982.
[16] S.Y. Kung, "VLSI Array Processors,"IEEE ASSP Magazine, Vol. 2, No. 3, July 1985, pp. 4-22.
[17] H. G. Yeh, "Systolic implementation of Kalman filtering,"IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-35, no. 9, pp. 1514-1517, Sept. 1987.
[18] S. Y. Kung, "Mapping digital signal processing algorithms onto VLSI systolic/wavefront arrays," inProc. 20th Asilomar Conf. Sig., Syst.,&Comp., 1986, pp. 6-11.
[19] H. K. Kwan and T. S. Okullo-Oballa, "2-D systolic arrays for realization of 2-D convolution,"IEEE Trans. Circuit Syst., vol. CAS-37, no. 2, pp. 267-272, Feb. 1990.

Index Terms:
Index Termstransformations families; low complexity high concurrence algorithms; dedicatedcomputing structures; compute cycles; design parameter; architecture; matrixmultiplication array; real-time applications; least square approximation; computationalcomplexity; least squares approximations; matrix algebra; parallel algorithms
Citation:
J.L. Aravena, A.O. Barbir, "A Class of Low Complexity High Concurrence Algorithms," IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 4, pp. 495-502, Oct. 1991, doi:10.1109/71.97905
Usage of this product signifies your acceptance of the Terms of Use.