Parallel Generation of l Sequences
Source: Princeton University
The generation of pseudo-random sequences at a high rate is an important issue in modern communication schemes. The representation of a sequence can be scaled by decimation to obtain parallelism and more precisely a sub-sequences generator. Sub-sequences generators and therefore decimation have been extensively used in the past for Linear Feedback Shift Registers (LFSRs). However, the case of automata with a non linear feedback is still in suspend. In this work, the authors study how to transform a Feedback with Carry Shift Register (FCSR) into a subsequences generator. They examine two solutions for this transformation, one based on the decimation properties of '-sequences, i.e. FCSR sequences with maximal period, and the other one based on multiple steps implementation.