Pseudo-Random Binary Sequence伪随机二进制序列
前言:
PRBS N 其中N代表阶数,伪随机序列以2^N-1数据长度为周期
其他基础原理见百度或其他博主,在此不赘述
一、常用的本原多项式:
PRBS3 = X3+X2+1
PRBS7 = X7+X6+1
PRBS9 = X9+X8+1
PRBS11 = X11+X9+1
PRBS15 = X15+X14+1
PRBS20 = X20+X3+1
PRBS23 = X23+X18+1
PRBS31 = X31+X28+1
二、以PRBS3和PRBS9为例
PRSB3 = X3 + X2 +1;这公式啥意思呢?
以X1 X2 X3代表移位寄存器
X3给到输出output
X3异或X2结果给到X1
以2^3-1 = 7为周期循环
废话不多讲,直接看图一目了然
同理PRSB9 = X9 + X5 +1
PRBS9 | |||||||||
PRBS9 = X9+X5+1 | OUTPUT | ||||||||
X1 | X2 | X3 | X4 | X5 | X6 | X7 | X8 | X9 | |
1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 |
0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 | 1 |
1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 | 1 |
1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 | 1 |
1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 1 | 1 |
1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 |
0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | 0 |
1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 |
1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 | 0 |
1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 0 | 0 |
1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 | 1 |
1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 | 1 |
0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 | 1 |
0 | 0 | 1 | 1 | 1 | 1 | 1 | 0 | 1 | 1 |