The implemented LFSR uses a one-to-many structure. Figure below shows the maximum length sequence produced by a 4 bit LFSR. The choice of taps determines how many values there are in a given sequence before the sequence repeats. For a small LFSR like the present one (4bit) its easy to identify the Taps to the XOR gate which can produce maximum length output but just imagine how can we identify the Taps for the XOR if the number of bits is 10bits ? Obviously we cant go by BRUTE FORCE method by trying all possible combination to identify the Taps which will produce maximum length sequence. In our example if the LFSR has to be of maximum length then the pattern has to repeat after 16(2^4) clock cycles. By maximum length we mean that the pattern must repeat itself after 2^N clock cycles for a N bit LFSR. But the pattern has to be of maximum length . There is no such order from where the inputs to the XOR comes from to produce a random pattern. So from the figure above the Taps are 0 and 3 FF's. The inputs to the XOR are called the Taps. This is a general structure for a 4 bit LFSR. When we take out the output of these FF they will have a random pattern. This XOR operation introduces a new bit into the shift register. But the only change is that the input to the first (D3 in th figure) is from the XOR of the o/p from FF's 0 and 3 (from fig). It consist of D-FF connected in cascade as shown with the same clock applied to all the FF to make them act like a shift register.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |