This application note describes - and 5-bit universal LFSR counters, very efficient -based 32-bit and 100-bit shift registers, and pseudo-random sequence generators with repetition rates of thousands and even trillions of years, useful for testing and encryption purposes. Using Linear Feedback Shift-Register (LFSR) counters to address the makes the design even simpler. 1 PPLICTION NOTE Efficient Shift Registers, LFSR Counters, and Long Pseudo- Random Sequence Generators XPP 052 July 7,1996 (Version 1.1) pplication Note by Peter lfke Summary Shift registers longer than eight bits can be implemented most efficiently in XC000E Select- TM.
