Binary Sequences with Minimum Peak Sidelobe Level up to Length 68

نویسندگان

  • Anatolii Leukhin
  • Egor Potehin
چکیده

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.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Waveform Design using Second Order Cone Programming in Radar Systems

Transmit waveform design is one of the most important problems in active sensing and communication systems. This problem, due to the complexity and non-convexity, has been always the main topic of many papers for the decades. However, still an optimal solution which guarantees a global minimum for this multi-variable optimization problem is not found. In this paper, we propose an attracting met...

متن کامل

Improved bounds on the peak sidelobe level of binary sequences

Schmidt proved in 2014 that if ε > 0, almost all binary sequences of length n have peak sidelobe level between ( √ 2 − ε)√n log n and ( √ 2 + ε) √ n log n. Because of the small gap between his upper and lower bounds, it is difficult to find improved upper bounds that hold for almost all binary sequences. In this note, we prove that if ε > 0, then almost all binary sequences of length n have pea...

متن کامل

Bounds on the growth rate of the peak sidelobe level of binary sequences

The peak sidelobe level (PSL) of a binary sequence is the largest absolute value of all its nontrivial aperiodic autocorrelations. A classical problem of digital sequence design is to determine how slowly the PSL of a length n binary sequence can grow, as n becomes large. Moon and Moser showed in 1968 that the growth rate of the PSL of almost all length n binary sequences lies between order √ n...

متن کامل

Extending the Radar Dynamic Range using Adaptive Pulse Compression

The matched filter in the radar receiver is only adapted to the transmitted signal version and its output will be wasted due to non-matching with the received signal from the environment. The sidelobes amplitude of the matched filter output in pulse compression radars are dependent on the transmitted coded waveforms that extended as much as the length of the code on both sides of the target loc...

متن کامل

The peak sidelobe level of random binary sequences

Binary sequences with small autocorrelation at nonzero shifts have a wide range of applications in digital communications, including synchronisation and radar. Let Mn be the minimum of M(A) taken over all 2 n binary sequences A of length n. By a parity argument, it is seen that Mn ≥ 1 and it is known that Mn = 1 for n ∈ {2, 3, 4, 5, 7, 11, 13}, which arises from the existence of a Barker sequen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1212.4930  شماره 

صفحات  -

تاریخ انتشار 2012