 Wysłany: Pon 22:39, 04 Kwi 2011 Temat postu: Chaotic simulated annealing algorithm is the short |
|
| Chaotic simulated annealing algorithm is the shortest route after processing
italsignalprocessorsonlysupplysynchronousserialports, anddontinterfacedirectlytoauniversalasynchronousreceiver / transmitter (UART). Inordertocommunicatewithpersonalcomputerandoth-erdevices, wemustexpandDSPintoanasynchronousport. TakeTMS320C6711ofTexasInstrumentscompanyforinstance, severalmethodstorealizeserialcommunicationbetweendigitalsignalprocessorandpersonalcomputer, in-cludingboththehardwareandsoftware, aredescribedinthepaper. Theadvantagesanddisadvantagesofeachmeth-odarealsodiscussedandcompared. Keywords: DSP; UART; McBSP ( For the convenience of observation, will replace all the output values of 0.000 0) Post - ProcessingMethodfortheShortest - PathRoutingAlgorithmontheCSANeuralNetworksLAIQing. WU ', XIEJian. ying, YEXiao. 1i (1.CollegeofElectronicInformationandElectricalEngineering, NanchangUniversity, Nanchang330029, China; (2.SchoolofElectronicinformationandElectricalEngineering, ShanghaiJiaotongUniversity, Shanghai200030, China) Abstract: Ashortest-pathroutingalgorithmbasedonthechaoticsimulatedannealingneuralnetworks (CSA), canavoidlocalminimumproblemslikeHopfield, togetgloballyoptimalsolutions. Butastosomenetworkswithmorenodes, itstillsuffersomedrawbacks.Soweintroducedapost-processingmethodforSPproblems.Whenwerevisethesolutions, weconsiderthevalidityofsolutionaccordingtothespecificproblems,GHD glätteisen, tofindthemaximumreadingsontheeachrowofoutputmatrix. todeterminethenextshortestpathnodeconnected.Oursimulationstudyshowsthattheproposedalgorithmperformswellandcanfindtheoptimumsolutionwithhighprobability.Keywords: chaoticsimulatedannealing (CSA); optimumsolution; post-processingmethod |
|
