language-icon Old Web
English
Sign In

Pseudorandom binary sequence

A pseudorandom binary sequence (PRBS) 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 are used in telecommunication, especially to spread the information content in Analog-to-Information Converters, but also in encryption, simulation, correlation technique and time-of-flight spectroscopy. A binary sequence (BS) is a sequence a 0 , … , a N − 1 {displaystyle a_{0},ldots ,a_{N-1}} of N {displaystyle N} bits, i.e. A BS consists of m = ∑ a j {displaystyle m=sum a_{j}} ones and N − m {displaystyle N-m} zeros. A BS is a pseudorandom binary sequence (PRBS) if its autocorrelation function, given by

[ "Binary number", "Maximum length sequence", "pseudo random bit sequence", "ternary sequence", "pseudorandom bit sequence", "Welch bounds" ]
Parent Topic
Child Topic
    No Parent Topic