Efficient exhaustive search for optimal-peak-sidelobe binary codes

Coxson, Gregory E.; Russo, Jon C.

doi:10.1109/nrc.2004.1316465

Cited by 16 publications

(21 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, a full search for L = 64 yields 14872 optimal binary sequences achieving MPS 4, though these sequences have a wide variability of merit factors [5]. The conventional gradient-based and common search approaches are almost always trapped in some poor local minima.…”

Section: Literature Surveymentioning

confidence: 99%

See 1 more Smart Citation

New evolutionary search for long low autocorrelation binary sequences

Mow

2015

IEEE Trans. Aerosp. Electron. Syst.

View full text Add to dashboard Cite

Section: Literature Surveymentioning

confidence: 99%

“…A state-of-the-art exhaustive search algorithm for MPS binary sequences was reported in [5]. The method integrates combinatoric tree search techniques, the use of PSL-preserving symmetries, data representations and operations for fast sidelobe computation, and partitioning for parallelism.…”

Section: This Is the Pre-published Versionmentioning

confidence: 99%

New evolutionary search for long low autocorrelation binary sequences

Mow

2015

IEEE Trans. Aerosp. Electron. Syst.

View full text Add to dashboard Cite

“…Additional speed-ups can be achieved by encorporating other efficiencies into the branch-and-bound approach. Examples are the optimization of low-level computations using bit-level computations or table lookup [4], or taking into account sidelobe-preserving operations to avoid checking sidelobe-equivalent codes [4], [8].…”

Section: Toward Exhaustive Search For Complementary Code Setsmentioning

confidence: 99%

Efficient exhaustive search for binary complementary code sets

Coxson

Russo

2013

2013 47th Annual Conference on Information Sciences and Systems (CISS)

View full text Add to dashboard Cite

Abstract-Binary complementary code sets offer a possibility that single binary codes cannot -zero aperiodic autocorrelation sidelobe levels. These code sets can be viewed as the columns of so-called complementary code matrices, or CCMs. This matrix formulation is particularly useful in gaining the insight needed for developing an efficient exhaustive search for complementary code sets. An exhaustive search approach is described, designed to find all sets of K complementary binary codes of length N , for specified N and K. Results for several cases are examined.

show abstract

“…Also they searched all 64-bit sequences and found all MPSL codes and exhibited all balanced ones in a table. It is the longest power of two codes that have been fully searched (Coxson & Russo, 2004). Next, Levanon and Mozeson provided a summary of optimal PSLs for lengths up to 69 (Levanon & Mozeson, 2004).…”

Section: History Of Scientific Endeavorsmentioning

confidence: 99%