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.
展开▼
机译:我们表明,可以使用l级移位寄存器生成比(2 / sup l / -1)长的伪随机二进制序列,该伪随机二进制序列长于所谓的最大长度序列。这可以通过将l级移位寄存器分为两部分并以不同的速度为每个部分计时来实现。给出一个示例以显示一些结果。
展开▼