Research on fully parallel matrix algorithm of ternary optical computer for the shortest path problem
Kai Song, Yi Zhang, Liping Yan, Qingqing Jin, Gong Chen · Applied Optics · 2020
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.