By Topic

Subsequences of Pseudorandom 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
$33 $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

2 Author(s)
S. Wainberg ; Polytechnic Institute of Brooklyn, Brooklyn, N.Y ; J. Wolf

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.

Published in:

IEEE Transactions on Communication Technology  (Volume:18 ,  Issue: 5 )