Solve Ax=b on FPGA

Significant improvements on Field Programmable Gate Arrays (FPGAs) have been developed recent years. Consequently, solving linear equation system, which is one type of the scientific computation, has been accelerated by the development of hardware. In many scientific fields, linear equation systems...

Full description

Bibliographic Details
Main Author: Liu, Huan Yu
Other Authors: Ling Keck Voon
Format: Final Year Project (FYP)
Language:English
Published: 2015
Subjects:
Online Access:http://hdl.handle.net/10356/63414
_version_ 1811694280987639808
author Liu, Huan Yu
author2 Ling Keck Voon
author_facet Ling Keck Voon
Liu, Huan Yu
author_sort Liu, Huan Yu
collection NTU
description Significant improvements on Field Programmable Gate Arrays (FPGAs) have been developed recent years. Consequently, solving linear equation system, which is one type of the scientific computation, has been accelerated by the development of hardware. In many scientific fields, linear equation systems are commonly used, and the variables of the system can be from a range of a few to millions. However, for the linear system with high dimensions, very long computational time is needed to solve it. In the past years, many methods for the solution of linear system have been proposed [1]. The principal objective of this project is to solve Ax=b on FPGA board, in which Ax=b is a system of linear equations. To solve this linear system of equations (LSE), Gaussian elimination with partial pivoting method was used in the programming algorithm. As an embedded system, FPGA has limited hardware resources. So, to find a most efficient programming design is important, which means the FPGA size could be smaller and the computing speed could be as fast as possible.
first_indexed 2024-10-01T07:05:04Z
format Final Year Project (FYP)
id ntu-10356/63414
institution Nanyang Technological University
language English
last_indexed 2024-10-01T07:05:04Z
publishDate 2015
record_format dspace
spelling ntu-10356/634142023-07-07T17:50:13Z Solve Ax=b on FPGA Liu, Huan Yu Ling Keck Voon School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering Significant improvements on Field Programmable Gate Arrays (FPGAs) have been developed recent years. Consequently, solving linear equation system, which is one type of the scientific computation, has been accelerated by the development of hardware. In many scientific fields, linear equation systems are commonly used, and the variables of the system can be from a range of a few to millions. However, for the linear system with high dimensions, very long computational time is needed to solve it. In the past years, many methods for the solution of linear system have been proposed [1]. The principal objective of this project is to solve Ax=b on FPGA board, in which Ax=b is a system of linear equations. To solve this linear system of equations (LSE), Gaussian elimination with partial pivoting method was used in the programming algorithm. As an embedded system, FPGA has limited hardware resources. So, to find a most efficient programming design is important, which means the FPGA size could be smaller and the computing speed could be as fast as possible. Bachelor of Engineering 2015-05-13T06:49:11Z 2015-05-13T06:49:11Z 2015 2015 Final Year Project (FYP) http://hdl.handle.net/10356/63414 en Nanyang Technological University 53 p. application/pdf
spellingShingle DRNTU::Engineering::Electrical and electronic engineering
Liu, Huan Yu
Solve Ax=b on FPGA
title Solve Ax=b on FPGA
title_full Solve Ax=b on FPGA
title_fullStr Solve Ax=b on FPGA
title_full_unstemmed Solve Ax=b on FPGA
title_short Solve Ax=b on FPGA
title_sort solve ax b on fpga
topic DRNTU::Engineering::Electrical and electronic engineering
url http://hdl.handle.net/10356/63414
work_keys_str_mv AT liuhuanyu solveaxbonfpga