Simulation Design And Realization Of DNA Computing Model Based On SOPC

DNA computing is a parallel computation, which utilizes many different DNA molecules to simultaneously try all possibilities. So far the DNA computer is faster and smaller than any other computer for some specific problems. In 1994, Adleman solved the "7-vertex Hamiltonian path problem" using DNA computing method, which was the first successful practical example of using DNA for computational purposes.After several decades of research, DNA computing has been proven to be a potential computing method, which can solve several other large-scale combinations of search problems.But most of the DNA computing models are based on biotechnology.It is prone to deterioration and damage or other issues in the reaction process. In this paper, we introduce a generalized Turing machine (GTM)which does not rely on any particular technology and can solve the NP-complete problem in polynomial time. On the basis of GTM model,academics have proposed the molecular computing which was applied to SAT problem and integer programming problem. And this paper applies the model to 0-1 integer programming problem and subset sum problem.Based on this, a GTM-SOPC model with SOPC technology is proposed.The GTM circuit logic program was packaged for custom IP and was then added to the SOPC system, then together with other peripherals in the SOPC Builder to build SOPC system hardware design, and then write C language software program on NIOS ? IDE to drive hardware devices, and finally complete the development of SOPC system. And the above model was applied to the SAT problem and maximal group problem of figure.The main contents of this paper are described as follows:1. The address decoder in DNA circuit model is realized. GTM research circuit model is put forward to solve 0-1 Integer Programming Problem algorithm, and functional simulation was realized on FPGA.2. GTM research circuit model is put forward to solve subset-sum problem algorithm, and simulation implementation through software and FPGA.3. Based on the GTM model and GTM circuit model, a new GTM-SOPC model is proposed.4. The GTM-SOPC model is put forward to solve satisfiability problem algorithm, and simulation is implemented. We also realizes the GTM research circuit model solving large-scale FPGA function simulation for SAT problem.5. The GTM-SOPC model is put forward to solve maximal group problem algorithm, and simulation is implemented.