Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Maximum length sequence
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==External links== * {{cite web |last=Bristow-Johnson |first=Robert |title=A Little MLS Tutorial |url=http://www.dspguru.com/dsp/tutorials/a-little-mls-tutorial }} β Short on-line tutorial describing how MLS is used to obtain the [[impulse response]] of a [[linear time-invariant system]]. Also describes how nonlinearities in the system can show up as spurious spikes in the apparent impulse response. * {{cite web |first=Jens |last=Hee |title=Impulse response measurement using MLS |url=http://jenshee.dk/signalprocessing/mls.pdf}} β Paper describing MLS generation. Contains C-code for MLS generation using up to 18-tap-LFSRs and matching Hadamard transform for impulse response extraction. *{{cite web |first=Magnus |last=SchΓ€fer |title=Aachen Impulse Response Database |date=October 2012 |publisher=Institute of Communication Systems and Data Processing, RWTH Aachen University |url=http://www.ind.rwth-aachen.de/en/research/tools-downloads/aachen-impulse-response-database/ |id=V1.4}} A (binaural) room impulse response database generated by means of maximum length sequences. *{{cite web |id=XAPP052 v1.1 |title=Efficient Shift Registers, LFSR Counters, and Long Pseudo-Random Sequence Generators β Obsolete |date=July 1996 |publisher=Xilinx |url=http://www.xilinx.com/support/documentation/application_notes/xapp052.pdf}} β Implementing lfsr's in FPGAs includes listing of taps for 3 to 168 bits [[Category:Pseudorandomness]] [[Category:Polynomials]] [[Category:Binary sequences]]
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)