A maximum length sequence (MLS) is a type of pseudorandom binary sequence.
They are bit sequences generated using maximal linear-feedback shift registers and are so called because they are periodic and reproduce every binary sequence (except the zero vector) that can be represented by the shift registers (i.e., for length-m registers they produce a sequence of length 2m - 1). An MLS is also sometimes called an n-sequence or an m-sequence. MLSs are spectrally flat, with the exception of a near-zero DC term.
These sequences may be represented as coefficients of irreducible polynomials in a polynomial ring over Z/2Z.
Practical applications for MLS include measuring impulse responses (e.g., of room reverberation or arrival times from towed sources in the ocean[1]). They are also used as a basis for deriving pseudo-random sequences in digital communication systems that employ direct-sequence spread spectrum and frequency-hopping spread spectrum transmission systems, and in the efficient design of some fMRI experiments.[2]
MLS are generated using maximal linear-feedback shift registers. An MLS-generating system with a shift register of length 4 is shown in Fig. 1. It can be expressed using the following recursive relation:
\begin{cases} a3[n+1]=a0[n]+a1[n]\\ a2[n+1]=a3[n]\\ a1[n+1]=a2[n]\\ a0[n+1]=a1[n]\\ \end{cases}
where n is the time index and
+
As MLS are periodic and shift registers cycle through every possible binary value (with the exception of the zero vector), registers can be initialized to any state, with the exception of the zero vector.
A polynomial over GF(2) can be associated with the linear-feedback shift register. It has degree of the length of the shift register, and has coefficients that are either 0 or 1, corresponding to the taps of the register that feed the xor gate. For example, the polynomial corresponding to Figure 1 is
x4+x+1
A necessary and sufficient condition for the sequence generated by a LFSR to be maximal length is that its corresponding polynomial be primitive.[3]
MLS are inexpensive to implement in hardware or software, and relatively low-order feedback shift registers can generate long sequences; a sequence generated using a shift register of length 20 is 220 - 1 samples long (1,048,575 samples).
MLS have the following properties, as formulated by Solomon Golomb.[4]
The occurrence of 0 and 1 in the sequence should be approximately the same. More precisely, in a maximum length sequence of length
2n-1
2n-1
2n-1-1
A "run" is a sub-sequence of consecutive "1"s or consecutive "0"s within the MLS concerned. The number of runs is the number of such sub-sequences.
Of all the "runs" (consisting of "1"s or "0"s) in the sequence :
The circular autocorrelation of an MLS is a Kronecker delta function[5] [6] (with DC offset and time delay, depending on implementation). For the ±1 convention, i.e., bit value 1 is assigned
s=+1
s=-1
| R(n)= | 1 |
| N |
| N | |
| \sum | |
| m=1 |
s[m]
| *[m+n] | |
| s | |
| N |
=\begin{cases} 1&ifn=0,\\ -
| 1 | |
| N |
&if0<n<N.\end{cases}
where
s*
[m+n]N
The linear autocorrelation of an MLS approximates a Kronecker delta.
If a linear time invariant (LTI) system's impulse response is to be measured using a MLS, the response can be extracted from the measured system output y[''n''] by taking its circular cross-correlation with the MLS. This is because the autocorrelation of a MLS is 1 for zero-lag, and nearly zero (-1/N where N is the sequence length) for all other lags; in other words, the autocorrelation of the MLS can be said to approach unit impulse function as MLS length increases.
If the impulse response of a system is h[''n''] and the MLS is s[''n''], then
y[n]=(h*s)[n].
Taking the cross-correlation with respect to s[''n''] of both sides,
{\phi}sy=h[n]*{\phi}ss
and assuming that φss is an impulse (valid for long sequences)
h[n]={\phi}sy.
Cohn and Lempel[11] showed the relationship of the MLS to the Hadamard transform. This relationship allows the correlation of an MLS to be computed in a fast algorithm similar to the FFT.