Double-precision Gauss-Jordan Algorithm with Partial Pivoting on FPGAs
- 1 August 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 273-280
Abstract
This work presents an architecture to compute matrix inversions in a reconfigurable digital system, benefiting from embedded processing elements present in FPGAs, and using double precision floating point representation. The main module of this system is the processing component for the Gauss-Jordan elimination. This component consists of other smaller arithmetic units, organized in pipeline. These units maintain the accuracy in the results without the need to internally normalize and de-normalize the floating-point data. The implementation of the operations takes advantage of the embedded processing elements available in the Virtex-5 FPGA. This implementation shows performance and resource consumption improvements when compared with "traditional" cascaded implementations of the floating point operators. Benchmarks are done with solutions implemented previously in FPGA and software, such as Matlab and Scilab.Keywords
This publication has 10 references indexed in Scilit:
- Cholesky decomposition using fused datapath synthesis2009
- Multiplier-Based Double Precision Floating Point Divider According to the IEEE-754 StandardLecture Notes in Computer Science, 2008
- High-Performance Designs for Linear Algebra Operations on Reconfigurable HardwareIEEE Transactions on Computers, 2008
- Floating point datapath synthesis for FPGAs2008
- Several approaches to fixed-point implementation of matrix inversion2006
- FPGA Based Acceleration of the Linpack Benchmark: A High Level Code Transformation Approach2006
- On Reconfigurable Architectures for Efficient Matrix Inversion2006
- High-Performance and Parameterized Matrix Factorization on FPGAs2006
- Closing the Gap: CPU and FPGA Trends in Sustainable Floating-Point BLAS Performance2004
- Implementation of a scalable matrix inversion architecture for triangular matrices2003