Advertisement

Appended m-Sequences with Merit Factor Greater than 3.34

  • Jonathan Jedwab
  • Kai-Uwe Schmidt
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6338)

Abstract

We consider the merit factor of binary sequences obtained by appending an initial fraction of an m-sequence to itself. We show that, for all sufficiently large n, there is some rotation of each m-sequence of length n that has merit factor greater than 3.34 under suitable appending. This is the first proof that the asymptotic merit factor of a binary sequence family can be increased under appending. We also conjecture, based on numerical evidence, that each rotation of an m-sequence has asymptotic merit factor greater than 3.34 under suitable appending. Our results indicate that the effect of appending on the merit factor is strikingly similar for m-sequences as for rotated Legendre sequences.

Keywords

Binary Sequence Numerical Evidence Primitive Element Initial Fraction Merit Factor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beenker, G.F.M., Claasen, T.A.C.M., Hermens, P.W.C.: Binary sequences with a maximally flat amplitude spectrum. Philips J. Res. 40, 289–304 (1985)zbMATHGoogle Scholar
  2. 2.
    Borwein, P., Choi, K.K.S., Jedwab, J.: Binary sequences with merit factor greater than 6.34. IEEE Trans. Inf. Theory 50(12), 3234–3249 (2004)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Golomb, S.W.: Shift register sequences. Holden-Day, Inc., San Francicso (1967)zbMATHGoogle Scholar
  4. 4.
    Golomb, S.W., Gong, G.: Signal design for good correlation: for wireless communication, cryptography, and radar. Cambridge University Press, New York (2005)zbMATHCrossRefGoogle Scholar
  5. 5.
    Høholdt, T., Jensen, H.E.: Determination of the merit factor of Legendre sequences. IEEE Trans. Inf. Theory 34(1), 161–164 (1988)CrossRefGoogle Scholar
  6. 6.
    Jedwab, J.: A survey of the merit factor problem for binary sequences. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 30–55. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  7. 7.
    Jedwab, J.: What can be used instead of a Barker sequence? Contemp. Math. 461, 153–178 (2008)MathSciNetGoogle Scholar
  8. 8.
    Jensen, H.E., Høholdt, T.: Binary sequences with good correlation properties. In: Huguet, L., Poli, A. (eds.) AAECC 1987. LNCS, vol. 356, pp. 306–320. Springer, Heidelberg (1989)Google Scholar
  9. 9.
    Kirilusha, A., Narayanaswamy, G.: Construction of new asymptotic classes of binary sequences based on existing asymptotic classes. Summer Science Program Tech. Report, Dept. Math. Comput. Sci., Univ. Richmond, Richmond, VA (1999)Google Scholar
  10. 10.
    Kristiansen, R.A., Parker, M.G.: Binary sequences with merit factor > 6.3. IEEE Trans. Inf. Theory 50(12), 3385–3389 (2004)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Lindholm, J.H.: An analysis of the pseudo-randomness properties of subsequences of long m-sequences. IEEE Trans. Inf. Theory IT-14(4), 569–576 (1968)CrossRefGoogle Scholar
  12. 12.
    Sarwate, D.V.: Mean-square correlation of shift-register sequences. IEE Proc. 131, Part F(2), 101–106 (1984)Google Scholar
  13. 13.
    Sarwate, D.V.: An upper bound on the aperiodic autocorrelation function for a maximal-length sequence. IEEE Trans. Inf. Theory IT-30(4), 685–687 (1984)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Jonathan Jedwab
    • 1
  • Kai-Uwe Schmidt
    • 1
  1. 1.Department of MathematicsSimon Fraser UniversityBurnabyCanada

Personalised recommendations