Research On Full Parallel Matrix Algorithm Of Ternary Optical Computer For Shortest Path Problem

In recent years,with the continuous development of electronic computers,when processing some big data,problems such as high energy consumption,insufficient parallel processing capabilities,and low calculation rates have appeared.The ternary optical computer has the advantages of low energy consumption,large number of data bits and bit reconstruction,which makes it particularly suitable for large-scale data computing.Based on the above advantages of ternary optical computer,this paper will study the use of ternary optical computer to solve largescale shortest path problems.The research content of this article is as follows:Utilizing the characteristics of easy expansion of data bits of ternary optical computer and parallelism of giant digits,a Fully Parallel Matrix algorithm is proposed,which uses "matrix multiplication",MSD(Modified Signed-Digit)data positive/negative determiner and one-step MSD The principle of addition can effectively realize parallel computing in optical computers,and elaborates the algorithm idea,design principle and operation steps of FPM(Fully Parallel Matrix algorithm)in detail.This paper compares and analyzes the clock period between FPM algorithm on ternary optical computer and traditional algorithm on electronic computer.It is proved that in solving the shortest path problem,the FPM algorithm based on ternary optical computer platform designed in this paper can effectively shorten the operation time,can play the characteristics of ternary optical computer giant bit parallel,and has more practical significance.The design scheme of the FPM algorithm proposed in this paper is verified experimentally on the existing ternary optical computer experimental platform.It is proved that the scheme is correct and feasible.The innovations of the paper are as follows:Aiming at the problems of high energy consumption and slow speed in solving the shortest path value of electronic computers,this paper proposes a fully parallel matrix algorithm based on a ternary optical computer.The algorithm can achieve the effect of quickly solving the shortest path value.In the end,the experiment proves that this scheme is feasible and has practical significance.