The main module code of serial port of pseudo random sequence generator Verilog
2017-12-09
0 0 0
no vote
Other
Earn points
Among them, m sequence is the most famous and simple, and also the most thorough sequence. M sequence is also the basis of studying other sequences. It has balanced sequences and the best autocorrelation property, but the number of cross-correlation families satisfying certain conditions is very small (for m sequences whose order of primitive polynomial is less than or equal to 13, the number of mutually preferred pairs is not more than 6), and the linear complexity is very small. The number of m sequence family sequences is extremely large (when the register series is equal to 6, there are 226 sequences). However, it is difficult to generate, and its cross-correlation characteristics are rarely known, so it is rarely used. The cross-correlation function of gold sequence is 3-valued, the sequence is partially balanced, and has good correlation characteristics. The number of family sequences is relatively large, but it has fatal weakness. The linear complexity of gold sequence is very low, which is only twice that of m sequence with the same length. This restricts the wide application of gold sequence, especially in anti-interference and cryptography. GMW sequence has the advantages of sequence balance, large linear complexity and good autocorrelation (same as m sequence). It is a nonlinear sequence and has more number than m sequence. As a single sequence, GMW Sequences have advantages, but a family of GMW Sequences satisfy certain cross-correlation conditions. Generally, it is not used as address code in multiple access communication. The balance and correlation of cascaded GMW Sequences are the same as GMW Sequences, and the number of families is more than GMW Sequences. Kasami sequences are divided into small set Kasami sequences and large set Kasami sequences. The number of small set Kasami sequence family is large, and the cross-correlation value reaches Welch lower bound. The number of large set Kasami sequence family is very large, and the cross-correlation of small set Kasami sequence family is inferior. They all have the same weakness, the sequence is unbalanced, and the linear complexity is not large (but slightly larger than m, gold sequence). Bent sequence is constructed in the early 1980s. It has the advantages of sequence balance, lower Welch correlation value, large number of family sequences and large linear complexity. It is the best pseudo-random sequence in the 80's and 90's. But bent sequence is difficult to construct, and there is no fast algorithm to meet certain requirements. No sequence is a new type of pseudo-random sequence constructed in the late 1980s. Its outstanding advantages are large linear complexity, and the correlation value can reach Welch lower bound. There are many family sequences, but it has the weakness of sequence imbalance.
Related Source Codes
Android AOA Android Open Accessory Development Usi
0
0
no vote
Golang AOA Android Open Accessory HID Control
0
0
no vote
PClite
0
0
no vote
GMSK Linear Receiver
0
0
no vote
The golden version of AFT that has been passed dow
0
0
no vote
No comment