Issue No. 04 - October (1991 vol. 2)

ISSN: 1045-9219

pp: 495-502

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.97905

ABSTRACT

<p>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.</p>

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. Aravena and A. Barbir, "A Class of Low Complexity High Concurrence Algorithms," in

*IEEE Transactions on Parallel & Distributed Systems*, vol. 2, no. , pp. 495-502, 1991.

doi:10.1109/71.97905

CITATIONS