# lineaarne nihkeregister

olemus
vahend, mille väljundjada a(0), a(1), a(2), …
rahuldab lineaarset rekurrentset seost
f(n) = a(n-1)*f(n-1) + a(n-2)*f(n-2) + … + a(n-k)*f(n-k) mod 2
=
a shift register whose input bit is a linear function of its previous state

ülevaateid
https://www.techopedia.com/definition/5687/linear-feedback-shift-register-lfsr

https://web.archive.org/web/20060111183721/http://homepage.mac.com/afj/lfsr.html

https://en.wikipedia.org/wiki/Linear-feedback_shift_register

http://www.science.unitn.it/~sala/BunnyTN/BUNNYTN_Elia.pdf

https://case.edu/artsci/math/singer/publish/LFSR.pdf

https://www.mdpi.com/2227-7390/10/6/996

rakendused

# lineaarne nihkeregister

olemus
vahend, mille väljundjada a(0), a(1), a(2), …
rahuldab lineaarset rekurrentset seost
f(n) = a(n-1)*f(n-1) + a(n-2)*f(n-2) + … + a(n-k)*f(n-k) mod 2
=
a shift register whose input bit is a linear function of its previous state

ülevaateid
https://www.techopedia.com/definition/5687/linear-feedback-shift-register-lfsr

https://web.archive.org/web/20060111183721/http://homepage.mac.com/afj/lfsr.html

https://en.wikipedia.org/wiki/Linear-feedback_shift_register

http://www.science.unitn.it/~sala/BunnyTN/BUNNYTN_Elia.pdf

https://case.edu/artsci/math/singer/publish/LFSR.pdf

https://www.mdpi.com/2227-7390/10/6/996

rakendused

Palun oodake...

# lineaarne nihkeregister

olemus
vahend, mille väljundjada a(0), a(1), a(2), …
rahuldab lineaarset rekurrentset seost
f(n) = a(n-1)*f(n-1) + a(n-2)*f(n-2) + … + a(n-k)*f(n-k) mod 2
=
a shift register whose input bit is a linear function of its previous state

ülevaateid
https://www.techopedia.com/definition/5687/linear-feedback-shift-register-lfsr

https://web.archive.org/web/20060111183721/http://homepage.mac.com/afj/lfsr.html

https://en.wikipedia.org/wiki/Linear-feedback_shift_register

http://www.science.unitn.it/~sala/BunnyTN/BUNNYTN_Elia.pdf

https://case.edu/artsci/math/singer/publish/LFSR.pdf

https://www.mdpi.com/2227-7390/10/6/996

rakendused