The performance of the periodic Hamming correlation function of the sequences of states ofm-sequence simple linear feedback shift register generators is evaluated. We call these sequences statemsequences. Theoretical lower and upper bounds on the peaks of the Hamming cross-correlation functions of those sequences, which are often used in frequency-hopped spread-spectrum systems, are derived. Numerical results in support of the theory are presented, and it is shown that the worst-case shift of the cross-correlation for relatively short sequences is of burst nature. The state position mapped (SPM) sequences of the statem-sequences are introduced. Their suitability for OR-channel code division multiplexing is numerically examined. The behavior of the periodic crosscorrelation function of these SPM sequences is used as the basis for judging their performance. It is explained also that the lower bound on the peak of the periodic Hamming cross-correlation function of the statem-sequences is naturally a lower bound on the peak of the periodic crosscorrelation function of SPM statem-sequences. This is due to the general relationship (a decimation relationship) between the two types of correlation functions. This relationship is explained and illustrated by an example. Tables of the peaks of both cross-correlation functions are presented for all sets of sequences for sequence generators of 5, 6, 7, and 8 stages.

This paper deals with the theory of generating high-speed binary sequences by interleaving two lower speed sequences which are displaced by half a bit period with respect to each other. The interleaving can be carried out by using a high-speed switch which is clocked at twice the clock rate of the lower speed sequences or by modulo 2 addition of the displaced sequences. Starting from any binary sequence, we give a general theory for the derivation of the binary sequences which are to be interleaved to produce any required high-speed sequence. We also deal with the particular case ofm-sequences.