Abstract
We describe shift register sequences (SRS) and their generation via linear feedback shift registers (LFSR). The underlying mechanism is the modular arithmetic of binary polynomials treated in section 40.3. We give an expression for the number of shift registers sequences of maximal length, the m-sequences. We look at two related mechanisms, feedback carry shift registers (FCSR) and linear hybrid cellular automata (LHCA). Most of these algorithms given can easily be implemented in hardware. Among the many applications for shift registers are random number generators, the computation of CRCs, spectrum spreading with communication protocols, and hardware testing.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Berlin Heidelberg
About this chapter
Cite this chapter
Arndt, J. (2011). Shift registers. In: Matters Computational. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14764-7_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-14764-7_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14763-0
Online ISBN: 978-3-642-14764-7
eBook Packages: Computer ScienceComputer Science (R0)