Abstract

Simulated annealing is a statistical computational technique for obtaining approximate solutions to combinatorial optimization problems. An efficient simulated annealing algorithm is used to design binary sequence sets which have good autocorrelation and crosscorrelation properties. Some of the synthesized results are presented, and their properties are better than any other known in the literature. The synthesized binary sequence sets promise to be practically applicable.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.