Please use this identifier to cite or link to this item:
Title: VLSI based hardware accelerator for compute intensive routing applications
Authors: Lam, Siew Kei
Keywords: DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks
Issue Date: 2000
Abstract: Identifying the most optimal paths (or routes) in a network is one of the most extensively studied problems in the field of graph theory. The advent of complex applications such as the VLSI place and route, vehicle navigation, high-speed communication, graph matching, dynamic robot path planning, etc. justify the need to devise a high-speed route computation unit. It is well recognised that a significant improvement in performance could be realised if the route computations can be efficiently ported to hardware. Since the classical algorithms do not lend well for hardware porting, there exists a need to devise new techniques that are capable of providing parallelism at the hardware level.
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Theses

Files in This Item:
File Description SizeFormat 
  Restricted Access
Main report27.35 MBAdobe PDFView/Open

Page view(s) 50

checked on Sep 24, 2020

Download(s) 50

checked on Sep 24, 2020

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.