A novel way to generate pseudo-random sequences longer than maximal length sequences

We show that it is possible to generate, using an l-stage shift register, a pseudo-random binary sequence longer than (2^l-1), that is longer than the so-called maximal length sequence. This can be done by subdividing the l-stage shift register into two parts and clocking each part at different speeds. An example is presented to show some results