Efficient Shift Registers, LFSR Counters, and Long Pseudo- Random Sequence Generators
Xilinx Family
Abstract
Xilinx Family
Abstract
Summary Shift registers longer than eight bits can be implemented most efficiently in XC4000E Select-RAM TM. Using Linear Feedback Shift-Register (LFSR) counters to address the RAM makes the design even simpler. This application note describes 4- and 5-bit universal LFSR counters, very efficient RAM-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. The appropriate taps for maximum-length LFSR counters of up to 168 bits are listed.
OpenAlex reports 222 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Summary Shift registers longer than eight bits can be implemented most efficiently in XC4000E Select-RAM TM. Using Linear Feedback Shift-Register (LFSR) counters to address the RAM makes the design even simpler. This application note describes 4- and 5-bit universal LFSR counters, very efficient RAM-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. The appropriate taps for maximum-length LFSR counters of up to 168 bits are listed.
Key concepts: Linear feedback shift register, Shift register, Sequence (biology), Computer science, Arithmetic, Bit (key), Encryption, Repetition (rhetorical device)