Graph Traversal Applied to Search for Optimal Minimum Peak Sidelobe Level Binary Sequences

Yi Yang, Wei Ren, Yuanyuan Song, Hao Li

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Binary sequences with low aperiodic autocorrelation levels are widely used in improving the ability of anti-intercept and detection of small targets of radar systems. Searching for optimal binary sequences is an intractable problem due to its extremely high complexity. In this paper, we present two exhaustive methods from the perspective of graph traversal. We prove a proposition that an equivalent sequence set is a closed set, and give the exact set. Moreover, an improved method to exclude equivalent sequences is proposed based on this proposition. The experiment results demonstrate that the time complexity of the two proposed methods is slightly reduced compared to the existing methods.

Original languageEnglish
Title of host publicationICSIDP 2019 - IEEE International Conference on Signal, Information and Data Processing 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728123455
DOIs
Publication statusPublished - Dec 2019
Event2019 IEEE International Conference on Signal, Information and Data Processing, ICSIDP 2019 - Chongqing, China
Duration: 11 Dec 201913 Dec 2019

Publication series

NameICSIDP 2019 - IEEE International Conference on Signal, Information and Data Processing 2019

Conference

Conference2019 IEEE International Conference on Signal, Information and Data Processing, ICSIDP 2019
Country/TerritoryChina
CityChongqing
Period11/12/1913/12/19

Keywords

  • binary sequences
  • exhaustive search
  • graph traversal
  • optimal minimum peak sidelobe

Fingerprint

Dive into the research topics of 'Graph Traversal Applied to Search for Optimal Minimum Peak Sidelobe Level Binary Sequences'. Together they form a unique fingerprint.

Cite this