Abstract

Binary sequences are widely used in many practical fields, such as radar applications, telecommunications and cryptography. Finding low autocorrelation binary sequences with good peak side-lobe level (PSL) values is a difficult optimization problem. In this paper we present an improved heuristic algorithm for searching low autocorrelation PSL sequences. A heuristic algorithm can find a sequence with a PSL value, which is not necessarily optimal, but is usually near optimal, and the algorithm finds it in a reasonable amount of time. In the experimental work we applied our algorithm to find binary sequences with low PSL values, and made a comparison with the state-of-the-art algorithms from literature. With our algorithm many sequences with the currently best-known PSL values have been improved. We found new sequences with better, i.e., lower, PSL values.

Highlights

  • OW autocorrelation binary sequences (LABS) play important roles in many areas, such as communication engineering, synchronization, active sensing systems, cryptography and radar applications [1], [2], [3], [4], [5]

  • We performed an experiment for searching a low peak sidelobe level (PSL) value on these lengths of binary sequences, and the obtained results are collected in Table 3, where PSL, New Best PSL (NPSL), and merit factor (MF) are presented for our algorithm, compared with the current best-known PSL values

  • We propose a new stochastic algorithm for searching long binary sequences with low PSL values

Read more

Summary

INTRODUCTION

OW autocorrelation binary sequences (LABS) play important roles in many areas, such as communication engineering, synchronization, active sensing systems, cryptography and radar applications [1], [2], [3], [4], [5]. Many authors have put considerable computational effort into finding binary sequences with small peak sidelobe level [6], [7], showing that:. Bošković: Low Autocorrelation Binary Sequences: Best-Known PSL Values. The optimal binary PSL sequences up to L = 74 are collected in [8] Another important measure of smallness of AACF is the merit factor [9], given by: MF(S) =. Our goal it to search for long binary sequences with low PSL values via a computational approach. We used a stochastic algorithm for searching binary sequences with low PSL values. A new stochastic algorithm for searching binary sequences with low PSL values is proposed. Algorithm 2: Algorithm for binary sequences PSL optimization [20]

BACKGROUND
OUR PROPOSED ALGORITHM
RESULTS
BINARY SEQUENCES WITH LENGTH FROM 106 TO
BINARY SEQUENCES WITH LENGTH FROM 324 TO
BINARY SEQUENCES WITH LENGTH FROM 2000 TO
VERY LONG BINARY SEQUENCE
M-SEQUENCES
LIMITATIONS
CONCLUSION
Full Text
Published version (Free)

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