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 a parallel OTSU algorithm based on a ternary optical computer

Kai Song, Yongjun Sun, Huaqiong Ma, and Liping Yan
Appl. Opt. 62(36) 9591-9598 (2023)

Parallel depth buffer algorithm based on a ternary optical computer

Kai Song, Jinliang Zhu, Zhenxing Wang, and Liping Yan
Appl. Opt. 61(23) 6841-6852 (2022)

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)

Theory and design of parallel decoding for a ternary optical computer

Honghong Zhang, Shan Ouyang, and Weimin Lian
Appl. Opt. 63(4) 1048-1057 (2024)

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)