z-logo
open-access-imgOpen Access
An Algorithmic Approach towards Construction of Long Binary Sequences using Modified Jacobi Sequences
Author(s) -
B. SuribabuNaick,
P. Kumar
Publication year - 2015
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/21189-3836
Subject(s) - computer science , binary number , theoretical computer science , arithmetic , mathematics
Construction of long low autocorrelation binary sequences (LABS) is a complex process which involves many limitations. LABS have many practical applications. In pulse coding schemes, sequences with low autocorrelation side lobe energies are required to reduce the noise and to increase the capability of radars to detect multiple targets. In literature, numerous techniques were employed to solve the LABS problem. For short length sequences, search algorithms can be applied as the search space is manageable. But in our case of long length binary sequences, construction methods are suitable. The major limitations of search algorithms are time and computational power. DH Green [1] in their research utilized modified Jacobi sequences to construct merit factors for long binary sequences. In our case, we used the same construction methods and applied them to various search algorithms. We obtained better results with this implementation. We achieved a merit factor of 6.4534 whereas Green [1] managed to 5.99.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom