Solving nondeterministic polynomial complete problems optically and the design of its light source

This thesis contains two parts. The first part presents the design and performance of a soliton mode-locked fiber laser. While the second half discusses and validate the proposed optical way in solving Nondeterministic Polynomial (NP) -complete problem. The optimized mode-locked laser is a preferabl...

Full description

Saved in:
Bibliographic Details
Main Author: Zheng, Mengying.
Other Authors: Shum Ping
Format: Final Year Project
Language:English
Published: 2013
Subjects:
Online Access:http://hdl.handle.net/10356/53260
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-53260
record_format dspace
spelling sg-ntu-dr.10356-532602023-07-07T16:30:02Z Solving nondeterministic polynomial complete problems optically and the design of its light source Zheng, Mengying. Shum Ping School of Electrical and Electronic Engineering DRNTU::Engineering This thesis contains two parts. The first part presents the design and performance of a soliton mode-locked fiber laser. While the second half discusses and validate the proposed optical way in solving Nondeterministic Polynomial (NP) -complete problem. The optimized mode-locked laser is a preferable optical source to be utilized in solving NP-complete problem. For mode-locked laser, the output pulse is generally ultra-short and at the order of femtosecond. The mode-locking performances are correlated to cavity loss and net dispersion. We investigated the optimization way to further enhance laser output power and bandwidth of mode-locked laser. The effectiveness of output pulse optimization by varying the laser cavity configuration is evaluated. The obtained mode-locked laser with high peak power and broad laser spectrum is preferred to be used as the laser source in solving NP-complete problems. NP-complete problems are decision problems which remain unsolved for quite a long time. The problem solving time of NP-complete problems increases exponentially with respect to the problem scale. In this thesis, we proposed and verified a novel optical method which can solve one of the famous NP-complete problems, Hamiltonian path problem. Compare with the conventional computer calculation method, the problem solving time is reduced. This result is cheerful since all the NP-complete problems are inter convertible. By solving one of the NP-complete problems, all others can be solved. Bachelor of Engineering 2013-05-31T02:57:24Z 2013-05-31T02:57:24Z 2013 2013 Final Year Project (FYP) http://hdl.handle.net/10356/53260 en Nanyang Technological University 57 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic DRNTU::Engineering
spellingShingle DRNTU::Engineering
Zheng, Mengying.
Solving nondeterministic polynomial complete problems optically and the design of its light source
description This thesis contains two parts. The first part presents the design and performance of a soliton mode-locked fiber laser. While the second half discusses and validate the proposed optical way in solving Nondeterministic Polynomial (NP) -complete problem. The optimized mode-locked laser is a preferable optical source to be utilized in solving NP-complete problem. For mode-locked laser, the output pulse is generally ultra-short and at the order of femtosecond. The mode-locking performances are correlated to cavity loss and net dispersion. We investigated the optimization way to further enhance laser output power and bandwidth of mode-locked laser. The effectiveness of output pulse optimization by varying the laser cavity configuration is evaluated. The obtained mode-locked laser with high peak power and broad laser spectrum is preferred to be used as the laser source in solving NP-complete problems. NP-complete problems are decision problems which remain unsolved for quite a long time. The problem solving time of NP-complete problems increases exponentially with respect to the problem scale. In this thesis, we proposed and verified a novel optical method which can solve one of the famous NP-complete problems, Hamiltonian path problem. Compare with the conventional computer calculation method, the problem solving time is reduced. This result is cheerful since all the NP-complete problems are inter convertible. By solving one of the NP-complete problems, all others can be solved.
author2 Shum Ping
author_facet Shum Ping
Zheng, Mengying.
format Final Year Project
author Zheng, Mengying.
author_sort Zheng, Mengying.
title Solving nondeterministic polynomial complete problems optically and the design of its light source
title_short Solving nondeterministic polynomial complete problems optically and the design of its light source
title_full Solving nondeterministic polynomial complete problems optically and the design of its light source
title_fullStr Solving nondeterministic polynomial complete problems optically and the design of its light source
title_full_unstemmed Solving nondeterministic polynomial complete problems optically and the design of its light source
title_sort solving nondeterministic polynomial complete problems optically and the design of its light source
publishDate 2013
url http://hdl.handle.net/10356/53260
_version_ 1772828992510885888