Subsequences of Pseudorandom Sequences

Author

Wainberg, Stanley ; Wolf, Jack K.

Author_Institution

Polytechnic Institute of Brooklyn, Brooklyn, N.Y

Volume

18

Issue

5

fYear

1970

fDate

10/1/1970 12:00:00 AM

Firstpage

606

Lastpage

612

Abstract

The properties of subsequences of long $m$ sequences are studied using the moments of the subsequence weight distributions. These moments are shown to be an aid for selecting good $m$ sequences for correlation-detection problems. In particular, the first four moments are described in detail for subsequence lengths $M \\leq 100$ digits for six different $m$ sequences. Two simple algorithms are described for determining the third and fourth moments. An algorithm for calculating the fourth moment and a detailed description of this moment for the six $m$ sequences are presented in this paper. Using the moments, a relationship is shown between the subsequences of the pseudorandom binary sequence and subsequences composed of random binary digits. Estimates for the moments of the subsequence weight distribution are obtained by sampling the $m$ sequence. A statistical analysis of these results is presented.

Keywords

Communications technology; Correlators; Detectors; Distributed computing; Force feedback; Helium; Random sequences; Sampling methods; Statistical analysis;

fLanguage

English

Journal_Title

Communication Technology, IEEE Transactions on

Publisher

ieee

ISSN

0018-9332

Type

jour

DOI

10.1109/TCOM.1970.1090402

Filename

1090402