By Topic

Efficient Optimization of the Merit Factor of Long Binary Sequences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Baden, J.M. ; Sensors & Electromagn. Applic. Lab., Georgia Tech Res. Inst., Atlanta, GA, USA

Autocorrelation sidelobes are a form of self-noise that reduce the effectiveness of phase coding in radar and communication systems. The merit factor is a well-known measure related to the autocorrelation sidelobe energy of a sequence. In this paper an equation is derived that allows the change in the merit factor of a binary sequence to be computed for all single-element changes with O(NlogN) operations, where N is the sequence length. The approach is then extended to multiple-element changes, allowing the merit factor change to be calculated with an additional O(Ns3) operations, where Nsis the number of changed elements, irrespective of sequence length. The multiple-element calculations can be used to update the single-element calculations so that in iterative use only O(N) operations are required per element change to keep the single-element calculations current. A steep descent algorithm (a variation on the steepest descent method) employing these two techniques was developed and applied to quarter-rotated, periodically extended Legendre sequences, producing optimized sequences with an apparent asymptotic merit factor of approximately 6.3758, modestly higher than the best known prior result of approximately 6.3421. Modified Jacobi sequences improve after steep descent to an approximate asymptotic merit factor of 6.4382. Three-prime and four-prime Jacobi sequences converge very slowly making a determination difficult but appear to have a higher post-steep-descent asymptotic merit factor than Legendre or modified Jacobi sequences.

Published in:

Information Theory, IEEE Transactions on  (Volume:57 ,  Issue: 12 )