CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

An Algorithmic Approach towards Construction of Long Binary Sequences using Modified Jacobi Sequences

by B.suribabu Naick, P.rajesh Kumar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 120 - Number 1
Year of Publication: 2015
Authors: B.suribabu Naick, P.rajesh Kumar
10.5120/21189-3836

B.suribabu Naick, P.rajesh Kumar . An Algorithmic Approach towards Construction of Long Binary Sequences using Modified Jacobi Sequences. International Journal of Computer Applications. 120, 1 ( June 2015), 8-15. DOI=10.5120/21189-3836

@article{ 10.5120/21189-3836,
author = { B.suribabu Naick, P.rajesh Kumar },
title = { An Algorithmic Approach towards Construction of Long Binary Sequences using Modified Jacobi Sequences },
journal = { International Journal of Computer Applications },
issue_date = { June 2015 },
volume = { 120 },
number = { 1 },
month = { June },
year = { 2015 },
issn = { 0975-8887 },
pages = { 8-15 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume120/number1/21189-3836/ },
doi = { 10.5120/21189-3836 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:05:04.511620+05:30
%A B.suribabu Naick
%A P.rajesh Kumar
%T An Algorithmic Approach towards Construction of Long Binary Sequences using Modified Jacobi Sequences
%J International Journal of Computer Applications
%@ 0975-8887
%V 120
%N 1
%P 8-15
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. D. H. Green and P. R. Green, " Modified Jacobi Sequences", IEE Proc-comput. Digit-tech ,Vol. 147,No 4,July 2000.
  2. M. J. E. Golay, "The merit factor of Legendre sequences," IEEE Trans. Inf. Theory, vol. IT-29, no. 6, pp. 934–936, Nov. 1983.
  3. A. Kirilusha and G. Narayanaswamy, "Construction of New Asymptotic Classes of Binary Sequences based on Existing Asymptotic Classes," Tech. Rep. Dept. Math. Comput. Sci. , Univ. of Richmond, Richmond, VA, 1999.
  4. M. J. E. Golay, The merit factor of long low autocorrelation binary sequences. ,IEEE Transactions on Information Theory 28 (3) (1982) 543–549.
  5. S. Mertens, Exhaustive search for low-autocorrelation binary sequences, Journalof Physics A: Mathematical and General 29 (1996) 473–481.
  6. S. Mertens,H. Bauke,Ground statesof the Bernasconi model with open boundary conditions,website available at http://www-e. unmagdeburg. de/mertens/research/labs/open. dat (accessed January2007).
  7. S. Prestwich, A hybrid local search for low autocorrelation binary sequences,Technical Report TR-00-01, Department of Computer science, National University of Ireland, Cork, Ireland (2000).
  8. P. Borwein, K. -K. S. Choi, and J. Jedwab, "Binary sequences with merit factor greater than 6. 34," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3234–3249, Dec. 2004.
  9. R. A Kristiansen and M. G. Parker, "Binary Sequences Withmerit factor ? 6. 3",IEEE Trans. Theory,vol. 50,no,12,pp,3385-3389,Dec. 2004.
  10. AbhisekUkil, "Low autocorrelation binary sequences Number theory based analysis for minimum energy level, Barker codes".
  11. B. Militzer, M. Zamparelli, D. Beule, Evolutionary search for low auto correlated binary sequences", IEEE Transactions on Evolutionary Computation 2 (1) (1998) 34-39.
  12. J. W. Moon and L. Moser, "On the correlation function of random binary sequences," SIAM J. Appl. Math. , vol. 16, pp. 340–343, 1968.
  13. G. E. Coxson and J. Russo, "Efficient exhaustive search for optimalpeak-sidelobe binary codes,"IEEE Trans. Aerospace and Electron. Syst. ,vol. 41, pp. 302–308, 2005.
  14. S. Prestwich, A hybrid local search for low autocorrelation binary sequences, Technical Report TR-00-01, Department of Computerscience, National University of Ireland, Cork, Ireland (2000).
  15. P. Moscato, 'Memetic algorithms: A short introduction," in: D. Corne, M. Dorigo, F. Glover (Eds. ), New Ideas in Optimization, McGraw-Hill, Maidenhead, Berkshire, England, UK, 1999, pp. 219-234.
  16. R. N. Bracewell, The Fourier Transform and its Applications, 2nd ed. New York: McGraw-Hill, 1986.
Index Terms

Computer Science
Information Sciences

Keywords

Autocorrelation Modified Jacobi sequences Merit Factor prime step algorithm steepest descent algorithm.

Powered by PhDFocusTM