• Corpus ID: 32319948

Binary Sequences with Minimum Peak Sidelobe Level up to Length 68

@article{Leukhin2012BinarySW,
  title={Binary Sequences with Minimum Peak Sidelobe Level up to Length 68},
  author={Anatolii Leukhin and Egor Potehin},
  journal={ArXiv},
  year={2012},
  volume={abs/1212.4930}
}
Results of an exhaustive search for minimum peak sidelobe level binary sequences are presented. Several techniques for efficiency implementation of search algorithm are described. A table of number of non-equivalent optimal binary sequences with minimum peak sidelobe (MPS) level up to length 68 is given. This number can be used in prediction of the longest length for a given sidelobe level of binary sequences. The examples of optimal binary MPS sequences having high merit factor are shown. 
View PDF on arXiv
13 Citations
Background Citations
3
Methods Citations
2

Figures and Tables from this paper

13 Citations

Optimal peak sidelobe level sequences up to length 74
TLDR
Results of an exhaustive search for minimum peak sidelobe (MPS) level sequences are presented and examples of optimal binary MPS sequences having high merit factor are shown.
Optimal peak sidelobe level sequences up to length 74
TLDR
Results of an exhaustive search for minimum peak sidelobe (MPS) level sequences are presented and examples of optimal binary MPS sequences having high merit factor are shown.
Efficient Generation of Low Autocorrelation Binary Sequences
TLDR
Improvements are obtained in almost half of the considered lengths while for the rest of the lengths, binary sequences with the same PSL values as reported in the state-of-the-art publications are found.
Graph Traversal Applied to Search for Optimal Minimum Peak Sidelobe Level Binary Sequences
TLDR
A proposition that an equivalent sequence set is a closed set, and give the exact set is proved, and an improved method to exclude equivalent sequences is proposed based on this proposition.
Hybrid Constructions of Binary Sequences With Low Autocorrelation Sideobes
TLDR
This work revisited a classical problem of the digital sequence design, or more precisely, finding binary sequences with optimal peak sidelobe level (PSL), and outlines few strategies for finding highly competitive binary sequences, which could be efficiently optimized, in terms of PSL, by the proposed algorithms.
A Bernasconi model for constructing ground-state spin systems and optimal binary sequences
A Bernasconi model for a one-dimensional chain of quantum particles is considered. It is shown that searching for the ground state of such a quantum system is equivalent to searching for optimal…
Mismatched Filters for Incoherent Pulse Compression in Laser Radar
  • M. Lindenfeld
  • Physics
    IEEE Transactions on Aerospace and Electronic Systems
  • 2021
TLDR
A pulsed laser system is considered for long-range target detection and incoherent pulse compression sums received power from numerous pulses to increase SNR while maintaining single pulse range resolution is employed.
Optimization of Matched and Mismatched Filters in Short Range Pulse Radars using Genetic Algorithm
TLDR
This paper produced mismatched filter coefficients (Mis-co) for each code using floating point genetic algorithm (FGA) and could generate and test the filter coefficients with maximum peak to sidelobe level ratio (PSR) and tested the filter with Doppler shift.
Almost perfect auto-correlation sequences for binary phase-modulated continuous wave radar
TLDR
Simulation examples show that a pedestrian with a radar cross section of -20 dBsm can be clearly distinguished from a bus of 30 dBsm even when they are only half a meter apart.
On the Generation of Long Binary Sequences With Record-Breaking PSL Values
TLDR
The efficiency and simplicity of the proposed method are particularly beneficial to the lightweightness of the implementation, which allowed the proposed algorithm to reach record-breaking PSL values for less than a second.
...
...

References

SHOWING 1-10 OF 10 REFERENCES
Efficient exhaustive search for optimal-peak-sidelobe binary codes
  • G. Coxson, J. Russo
  • Computer Science
    Proceedings of the 2004 IEEE Radar Conference (IEEE Cat. No.04CH37509)
  • 2004
An efficient exhaustive search routine is given which finds all binary codes of a given length having autocorrelation PSL under a given size. It was applied to two tasks, the first of which was to…
Best-known autocorrelation peak sidelobe levels for binary codes of length 71 to 105
  • C. Nunn, G. Coxson
  • Computer Science
    IEEE Transactions on Aerospace and Electronic Systems
  • 2008
TLDR
Best-known binary code autocorrelation peak sidelobe levels (PSLs) are updated for lengths 71 to 105 and PSL-5 codes are produced for all lengths from 83 to 105, in many cases improving on best-known values.
Minimum peak sidelobe pulse compression codes
TLDR
It is shown that one can obtain about +or-10/sup degrees / per pulse of improved Doppler tolerance by a judicious choice of code.
Binary sequences up to length 40 with best possible autocorrelation function
The problem of finding binary sequences with autocorrelation sidelobes as small as possible for any given length of the sequence is still unsolved today. However, solutions were found up to length 40…
Binary sequences with good correlation properties
A computer-oriented method for designing binary sequences with low autocorrelation sidelobes is discussed. It is shown that this method yields binary codes that are only marginally worse than known…
Longest binary pulse compression codes with given peak sidelobe levels
For peak sidelobe levels of 3, 4, and 5, three new binary pulse compression codes are presented of lengths 51, 69, and 88, respectively.
Efficient exhaustive search for optimal-peak-sidelobe binary codes
  • G. Coxson, J. Russo
  • Computer Science
    IEEE Transactions on Aerospace and Electronic Systems
  • 2005
TLDR
An exhaustive search for minimum peak sidelobe level (PSL) binary codes is described, combining several devices for efficiency including combinatoric tree search techniques, the use of PSL-preserving symmetries to reduce search space, data representations and operations for fast sidelobe computation, and a partitioning scheme for parallelism.
marstu.net. Preparing for INTERNATIONAL WORKSHOP ON CODING AND CRYPTOGRAPHY, WCC 2013
  • marstu.net. Preparing for INTERNATIONAL WORKSHOP ON CODING AND CRYPTOGRAPHY, WCC 2013
  • 2013
Preparing for INTERNATIONAL WORKSHOP ON CODING AND CRYPTOGRAPHY
    Minimum peak sidelobes pulse compression codes// Proceedings of the IEEE International Radar Conference