Division-free algorithms for solving the linear algebra problems and its applications in signal/image processing have attracted interests for parallel processing. In this paper the design of systolic array processors for solving linear systems of equations using division-free Gaussian elimination method is presented. The design is based on a systematic approach which constructs array processors systematically by first investigating parallel versions of the division-free algorithm and their three dimensional dependency graphs, and then generating the planar systolic array processors by projecting the dependency graph along properly selected directions. The resulting array processors are synthesized and analyzed. It is shown that some array processors are optimal. The key for designing an optimal array processor Is to design a parallel algorithm whose dependency graph is a well-structured. The array processors are optimal in terms of number of processing elements, number of input/output ports, time of processing and pipelining period.
[1]
K. J. Ray Liu,et al.
A unified square-root-free approach for QRD-based recursive-least-squares estimation
,
1993,
IEEE Trans. Signal Process..
[2]
Philippe Clauss,et al.
Synthesis of size-optimal toroidal arrays for the Algebraic Path Problem: A new contribution
,
1992,
Parallel Comput..
[3]
Stanislav G. Sedukhin,et al.
Systematic Approach and Software Tool for Systolic Design
,
1994,
CONPAR.
[4]
S. Kung,et al.
VLSI Array processors
,
1985,
IEEE ASSP Magazine.
[5]
K. J. Ray Liu,et al.
A class of square root and division free algorithms and architectures for QRD-based adaptive signal processing
,
1994,
IEEE Trans. Signal Process..
[6]
Uwe Schwiegelshohn,et al.
A Square Root and Division Free Givens Rotation for Solving Least Squares Problems on Systolic Arrays
,
1991,
SIAM J. Sci. Comput..