Rapid Prototyping Projection Algorithms with FPGA Technology

Authors:
John Cole;Larry Garey;Kenneth B. Kent
Affiliations:
-;-;-
Venue:
RSP '09 Proceedings of the 2009 IEEE/IFIP International Symposium on Rapid System Prototyping
Year:
2009

Citing 3
Cited 0

Embedded System Design

Embedded System Design
Sparse Matrix Computations on Reconfigurable Hardware

Computer
A pipelined-loop-compatible architecture and algorithm to reduce variable-length sets of floating-point data on a reconfigurable computer

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear systems with Toeplitz coefficient matrices often appear in applied science problems. Systems of this form arise as a result of finite difference methods when applied to approximate differential Equations with boundary conditions. The sparse structure of Toeplitz matrices lend themselves well to iterative algorithms, such as projection methods, and are favored techniques for solving large systems. Field Programmable Gate Arrays (FPGAs) have been growing in popularity among the scientific community due to the potential for increased performance when evaluating mathematical operations. The regular, sparse, structure inherent in Toeplitz systems makes it suitable for FPGA acceleration. Here, a framework is developed to support the efficient development of projection algorithms in an FPGA. Results of applying the framework to two projection algorithms are presented.