Title :
An FPGA-based implementation of the MINRES algorithm
Author :
Boland, David ; Constantinides, George A.
Author_Institution :
Dept. of Electr. & Electron. Eng., Imperial Coll. London, London
Abstract :
Due to continuous improvements in the resources available on FPGAs, it is becoming increasingly possible to accelerate floating point algorithms. The solution of a system of linear equations forms the basis of many problems in engineering and science, but its calculation is highly time consuming. The minimum residual algorithm (MINRES) is one method to solve this problem, and is highly effective provided the matrix exhibits certain characteristics. This paper examines an IEEE 754 single precision floating point implementation of the MINRES algorithm on an FPGA. It demonstrates that through parallelisation and heavy pipelining of all floating point components it is possible to achieve a sustained performance of up to 53 GFLOPS on the Virtex5-330T. This compares favourably to other hardware implementations of floating point matrix inversion algorithms, and corresponds to an improvement of nearly an order of magnitude compared to a software implementation.
Keywords :
field programmable gate arrays; floating point arithmetic; FPGA-based implementation; IEEE 754; MINRES algorithm; Virtex5-330T; floating point algorithms; floating point matrix inversion; linear equations; minimum residual algorithm; parallelisation; Continuous improvement; Educational institutions; Equations; Field programmable gate arrays; Hardware; Iterative algorithms; Iterative methods; Scientific computing; Sparse matrices; Symmetric matrices;
Conference_Titel :
Field Programmable Logic and Applications, 2008. FPL 2008. International Conference on
Conference_Location :
Heidelberg
Print_ISBN :
978-1-4244-1960-9
Electronic_ISBN :
978-1-4244-1961-6
DOI :
10.1109/FPL.2008.4629967