Advertisement

Pseudo-polyphase orthogonal sequence sets with good cross-correlation property

  • Naoki Suehiro
Submitted Contributions Error Correcting Codes: Theory And Applications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 508)

Abstract

This paper proposes a class of pseudo-polyphase orthogonal sequence sets with good cross-correlation property. Each set, composed of N pseudo-polyphase orthogonal sequences, is introduced from a maximum length sequence (m-sequence) by the inverse DFT, where N is the period of sequences.

A periodic sequence is called an orthogonal sequence, when the autocorrelation function is 0 in every term except for period-multiple-shift terms. It is known that a polyphase periodic sequence is transformed into an orthogonal sequence by the DFT or by the inverse DFT. There are N way for transforming a shifted m-sequence by the inverse DFT matrix, because an m-sequence is a periodic sequence of period N. So, we obtain N pseudo-polyphase orthogonal sequences by transforming the shifted m-sequences with the inverse DFT.

The absolute values of (N−1) terms in any obtained sequence are the same value \(\sqrt {\frac{{N + 1}}{N}}\). The absolute value of remained one term in the sequence is \(\sqrt {\frac{1}{N}}\). So, the obtained sequences can be called a pseud-polyphase orthogonal sequence.

The absolute values of (N−1) terms in any crosscorrelation function between two different sequences in a set are the same value \(\sqrt {\frac{{N + 1}}{N}}\). The absolute value of the remained one term is 1/N. So, these sequences have good crosscorrelation property.

Keywords

Discrete Fourier Transform Binary Sequence Periodic Sequence Orthogonal Sequence Maximum Length Sequence 
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]
    D.C. Chu, Polyphase codes with good periodic correlation properties, IEEE Trans. on Information Theory, IT-18 (1972) 531–532.Google Scholar
  2. [2]
    R.L. Frank, Comments on’ Polyphase codes with good correlation properties”, IEEE Trans. on Information Theory, IT-19 (1973) 244.Google Scholar
  3. [3]
    R. Gold, Optimal binary sequences for spread spectrum multiplexing, IEEE Trans. on Information Theory, IT-13 (1967) 619–621.Google Scholar
  4. [4]
    D.V. Sarwate, Bounds on crosscorrelation and autocorrelation of sequences, IEEE Trans. on Information Theory, IT-25 (1979) 720–724.Google Scholar
  5. [5]
    D.V. Sarwate and W.B. Pursley, Cross-correlation properties of pseudo-random and related sequences, Proc. IEEE 68 (1980) 593–619.Google Scholar
  6. [6]
    N. Suehiro and M. Ilatori, Polyphase periodic sequences without crosscorrelation and their application to asynchronous SSMA systems, Trans. of IECE Japan, 68-A (1985) 1087–1093, (in Japanese).Google Scholar
  7. [7]
    N. Suehiro and M. Hatori, Modulatable orthogonal sequences and application to SSMA systems, IEEE Trans. on Information Theory, IT-34 (1988) 93–100.Google Scholar
  8. [8]
    N. Suehiro, Elimination of co-channel interferences in an asynchronous SSMA system using modulatable orthogonal sequences, Proc. 4th Joint Swedish-Soviet International Workshop on Information Theory (1989) 180–184.Google Scholar
  9. [9]
    N. Suehiro, Modulatable real-valued orthogonal sequences and their application to an asynchronous SSMA system with a method for climinating co-channel interferences, Proc. of Bilkent Intern. Conf. on New Trends in Comm. Cont. and Signal Processing (1990) 546–552.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Naoki Suehiro
    • 1
  1. 1.Faculty of EngineeringTokyo Engineering UniversityTokyoJapan

Personalised recommendations