WestminsterResearch will not be accepting deposits until 9th March 2015. This is to allow for a system upgrade and server migration.

Systolic designs for Aitken's root finding method

Megson, Graham M. and Brudaru, Octav and Comish, D. (1992) Systolic designs for Aitken's root finding method. Parallel Computing, 18 (4). pp. 415-429. ISSN 0167-8191

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1016/0167-8191(92)90137-V


1-D and 2-D systolic arrays for computing the roots of a transcendental function via table generating methods are considered. In particular we show how to derive systolic arrays systematically for a problem with an unbounded computation domain. A non-linear scheduling function is introduced to partition the domain into finite-sized blocks and normal synthesis techniques used to derive block arrays. A m × n block can be computed in at most 3n + m − 1 steps using O(n) cells in a 1-D array and O(mn + n2) cells in a 2-D array. Different problem instances can be pipelined in the latter and the whole table can be produced by using the arrays iteratively.

Item Type:Article
Research Community:University of Westminster > Electronics and Computer Science, School of
ID Code:5746
Deposited On:29 Jan 2009 13:47
Last Modified:19 Oct 2009 16:43

Repository Staff Only: item control page