Advertisement

Algebraic Coding 1993: Algebraic Coding pp 126-140 | Cite as

On complementary sequences

  • Amnon Gavish
  • Abraham Lempel
Sequences
Part of the Lecture Notes in Computer Science book series (LNCS, volume 781)

Abstract

A set of complex-valued sequences {Sj} j=1 k , where Sj =(sj1, sj2, ..., sjN) is called complementary if the sum R(·) of their auto-correlation functions {Rs j (·)} kj=1 k satisfies
$$R\left( \tau \right) = \sum\limits_{j = 1}^k {\sum\limits_{i = 1}^{N - \tau } {s_{ji} s_{ji}^* + \tau = 0} } ,\forall \tau \ne 0.$$

In this paper, we introduce a new family of complementary pairs of sequences over the alphabet α3={+1,−1,0}. The inclusion of zero in the alphabet, which may correspond to a pause in transmission, leads both to a better understanding of the conventional binary case, where the alphabet is α2={+1,−1}, and to new nontrivial constructions over the ternary alphabet α3. For every length N, we derive restrictions on the location of the zero elements and on the form of the member sequences of the pair. We also derive a bound on the minimum number of zeros, necessary for the existence of a complementary pair of length N over α3. The bound is tight, as it is met by some of the proposed constructions, for infinitely many lengths.

Keywords

Complementary sequences autocorrelation Golay pairs 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. J. E. Golay, ”Static multislit spectrometry and its application to the panoramic display of infrared spectra”, J. Opt. Soc. Amer. 41 (1951), pp. 468–472.Google Scholar
  2. [2]
    M. J. E. Golay, ”Complementary Series”, IRE Trans. of Information Theory IT-7, pp. 82–87, April 1961.Google Scholar
  3. [3]
    M. Griffin, ”There are no Golay Complementary Sequences of Length 2 · 9t” Aequationes Math. 15 (1977), pp. 73–77.Google Scholar
  4. [4]
    T. H. Andres and R. G. Stanton, ”Golay Sequences”, Combinatorial Mathematics, Vol. 5, pp. 44–54, New York: Spring-verlag, 1977.Google Scholar
  5. [5]
    Shalom Eliahou, Michel Kervaire, and Bahman Safari, ”A New Restriction on the length of Golay Complementary Sequences”, Journal of Combinatorial Theory, Series A 55, (1990), pp. 49–59.Google Scholar
  6. [6]
    C.-C. Tseng and C. L. Liu, ”Complementary Sets of Sequences”, IEEE Trans. on Information Theory, Vol. IT-18, No. 5, pp. 644–651, Sept. 1972.Google Scholar
  7. [7]
    R. Sivaswamy, “Multiphase Complementary Codes”, IEEE Trans. on Information Theory, Vol. IT-24, No. 5, pp. 546–552, Sept. 1978.Google Scholar
  8. [8]
    Robert L. Frank, ”Polyphase Complementary Codes”, IEEE Trans. on Information Theory, Vol. IT-26, No. 6, pp. 641–647, November 1980.Google Scholar
  9. [9]
    Bi Guangguo, ”Methods of Constructing Orthogonal Complementary Pairs and Sets of Sequences”, IEEE International Conference on Communications 1985, pp. 839–843, June 1985.Google Scholar
  10. [10]
    Stephen Jauregui Jr., “Complementary Sequences of Length 26”, IRE Trans. on Information Theory, Vol. IT-7, p. 323, July 1962.Google Scholar
  11. [11]
    D. V. Sarwate, “Sets of Complementary Sequences”, Electronics Letters, Vol. 19, No. 18, pp. 711–712, Sept. 1983.Google Scholar
  12. [12]
    Shalom Eliahou, Michel Kervaire, and Bahman Safari, ”On Golay Polynomial Pairs”, Advances In Applied Mathematics 12 (1991), pp. 235–292.Google Scholar
  13. [13]
    Amnon Gavish, ”On Complementary Sequences”, Msc. research thesis, Technoin-IIT, January 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Amnon Gavish
    • 1
  • Abraham Lempel
    • 2
  1. 1.Department of Electrical EngineeringTechnion - Israel Institute of TechnologyIsrael
  2. 2.Department of Computer ScienceTechnion - Israel Institute of TechnologyIsrael

Personalised recommendations