An FPGA-based Implementation of the MINRES Algorithm

Add to your list(s) Download to your calendar using vCal

• David Boland, Imperial College London
• Tuesday 05 August 2008, 11:30-12:15
• Mahanakorn Laboratory, EEE.

If you have a question about this talk, please contact Dr George A Constantinides.

Due to continuous improvements in the resources available on FPG As, 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.

This talk is part of the CAS FPGA Talks series.

This talk is included in these lists:

• CAS FPGA Talks
• Mahanakorn Laboratory, EEE

Note that ex-directory lists are not shown.