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
Full Article | PDF ArticleMore Like This
Kai Song, Yongjun Sun, Huaqiong Ma, and Liping Yan
Appl. Opt. 62(36) 9591-9598 (2023)
Kai Song, Jinliang Zhu, Zhenxing Wang, and Liping Yan
Appl. Opt. 61(23) 6841-6852 (2022)
Wang Zhehe and Shen Yunfu
Appl. Opt. 60(30) 9254-9262 (2021)