Everything About ___
Live briefing

Everything about Pseudorandom binary sequence

Seemingly random, difficult to predict bit stream created by a deterministic algorithm

A pseudorandom binary sequence (PRBS), pseudorandom binary code or pseudorandom bitstream is a binary sequence that, while generated with a deterministic algorithm, is difficult to predict and exhibits statistical behavior similar to a truly random sequence. PRBS generators are used in telecommunication, such as in analog-to-information conversion, but also in encryption, simulation, correlation technique and time-of-flight spectroscopy. The most common example is the maximum length sequence generated by a (maximal) linear feedback shift register (LFSR). Other examples are Gold sequences, Kasami sequences and JPL sequences, all based on LFSRs. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Pseudorandom binary sequenceA 5-minute orientation
  2. Skim a recent paper: Doppler Shift Tolerance of Typical Pseudorandom Binary Sequences in PMCW RadarInfluential work since 2022
  3. Pick up a classic book: Digital systems testing and testable designThe most-reprinted book on the subject
  4. Read the landmark paper: On Finite Pseudorandom Binary SequencesCited 45 times
  5. Go sideways: Linear-feedback shift registerA closely related topic
  6. Go sideways: Lagged Fibonacci generatorA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Details
  2. Practical implementation
  3. Notation

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics