| 摘要 |
An LFRS (40, 50) calculates a PN sequence using Fibonacci form, such that when an offset is calculated from a known state, the bits of the new state comprise a block of sequence bits. Accordingly, to calculate a block having a length less than the length of the LFSR (40), all bits of the desired block can be calculated in a single offset calculation. If the block has a length greater than the length of the LFSR, one or more additional masks can be used to calculate the additional bits of the block sequence. Zero insertion is also supported.
|
