Abstract

The shortest path is an extensive algorithm problem in graph theory. When faced with a huge amount of data in the shortest path problem, the problem with using traditional algorithms is the slow operation speed and high power consumption. To address these problems, this paper proposes a fully parallel matrix (FPM) algorithm. It uses the matrix multiplication principle and one-step modified signed-digit (MSD) adder, which can effectively implement parallel computing in ternary optical computers (TOCs). Finally, we compare clock cycles, and the results show that the TOC-based FPM algorithm can efficiently reduce the calculation time when solving the shortest path problem.

© 2020 Optical Society of America

Design and implementation of the Walsh–Hadamard transform on a ternary optical computer

Wang Zhehe and Shen Yunfu
Appl. Opt. 60(30) 9254-9262 (2021)

Design and implementation of the one-step MSD adder of optical computer

Kai Song and Liping Yan
Appl. Opt. 51(7) 917-926 (2012)

Design and implementation of the modified signed digit multiplication routine on a ternary optical computer

Qun Xu, Xianchao Wang, and Chao Xu
Appl. Opt. 56(16) 4661-4669 (2017)

Carry-free vector-matrix multiplication on a dynamically reconfigurable optical platform

Xianchao Wang, Junjie Peng, Mei Li, Zhangyi Shen, and Ouyang Shan
Appl. Opt. 49(12) 2352-2362 (2010)

Simulative method for the optical processor reconfiguration on a dynamically reconfigurable optical platform

Hongjian Wang and Kai Song
Appl. Opt. 51(2) 167-175 (2012)