WestminsterResearch

On systolic arrays for complex matrix problems

Megson, Graham M. and Evans, David J. (1989) On systolic arrays for complex matrix problems. International Journal of Computer Mathematics, 30 (1&2). pp. 103-116. ISSN 0020-7160

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1080/00207168908803772

Abstract

We consider systolic arrays for matrix computations involving complex elements, and show that in certain circumstances the complex calculations can be decomposed into a number of real matrix sub-problems which can be used to good effect in reducing computation times and increasing array cell efficiency. Computations involving matrix vector, matrix product and matrix factorisation are examined. It was found that matrix vector and product calculation produce arrays which have e= 1 cell efficiency and the same computation time as their real counterparts, with only an increase in hardware related to the bandwidth of the systems. Matrix factorisation is achieved by using 2*2 block factorisation requiring four times the hardware and is only twice as slow as the real version of the factorisation.

Item Type:Article
Research Community:University of Westminster > Electronics and Computer Science, School of
ID Code:5771
Deposited On:30 Jan 2009 10:06
Last Modified:19 Oct 2009 16:52

Repository Staff Only: item control page