Sign in
Back
A novel way to generate pseudo-random sequences longer than maximal length sequences
Conference proceeding

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

J. Mouine and N. Boutin
Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341), Vol.2, pp.529-532 vol.2
1998
DOI: https://doi.org/10.1109/CCECE.1998.685550

Abstract

Autocorrelation Binary sequences Clocks Equations Polynomials Random processes Random sequences Resumes Shift registers Statistical distributions
We show that it is possible to generate, using an l-stage shift register, a pseudo-random binary sequence longer than (2/sup 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.

Metrics

1 Record Views

Details