A class of low complexity high concurrence algorithms

Author

Aravena, Jorge L. ; Barbir, Abdulkader O.

Author_Institution

Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA

Volume

2

Issue

4

fYear

1991

fDate

10/1/1991 12:00:00 AM

Firstpage

495

Lastpage

502

Abstract

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

Keywords

computational complexity; least squares approximations; matrix algebra; parallel algorithms; architecture; compute cycles; dedicated computing structures; design parameter; least square approximation; low complexity high concurrence algorithms; matrix multiplication array; real-time applications; transformations families; Arithmetic; Array signal processing; Computer architecture; Least squares approximation; Parallel algorithms; Parallel processing; Signal processing algorithms; Systolic arrays; Time factors; Very large scale integration;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.97905

Filename

97905