#### Presentation Title

Fast FPGA based computation of shortest path algorithms and its implementation using DE2 FPGA Board

#### Advisor Information

Hassan Farhat

#### Location

MBSC 201

#### Presentation Type

Poster

#### Start Date

6-3-2020 10:45 AM

#### End Date

6-3-2020 12:00 PM

#### Abstract

Many Applications in today’s life require high-speed shortest path computations. These computations are widely used in applications such as telecommunications, Robotics, Maps Navigation. Most commonly used algorithms for such computations are Dijkstra and Travelling salesman problem(TSP) algorithms. In this project we aim to decrease the execution time of such shortest path finding algorithms using Field Programming Gate Arrays (FPGA). Our final goal is to design an FPGA based accelerator to compute the shortest path and apply it to practical Industrial problems. Most of the applications today use algorithms implemented on high level programming languages such as C, C++, JAVA and Python. Using low level programing such as VHDL and implementing FPGA-based accelerator to calculate the shortest path can help us achieve high performance at low cost .

Fast FPGA based computation of shortest path algorithms and its implementation using DE2 FPGA Board

MBSC 201

Many Applications in today’s life require high-speed shortest path computations. These computations are widely used in applications such as telecommunications, Robotics, Maps Navigation. Most commonly used algorithms for such computations are Dijkstra and Travelling salesman problem(TSP) algorithms. In this project we aim to decrease the execution time of such shortest path finding algorithms using Field Programming Gate Arrays (FPGA). Our final goal is to design an FPGA based accelerator to compute the shortest path and apply it to practical Industrial problems. Most of the applications today use algorithms implemented on high level programming languages such as C, C++, JAVA and Python. Using low level programing such as VHDL and implementing FPGA-based accelerator to calculate the shortest path can help us achieve high performance at low cost .