An algorithm design for accelerating the computation of the correlation values

Interleaved sequences is a family of sequences with extensive significance, include a large number of popular sequences. In this paper, sequences are expressed by the form of matrices and the analytical method of shift sequences has been presented, so a new algorithm for computing correlation values of interleaved sequences has been gotten. Using the algorithm, we can accelerate computing the correlation values of a lot of known sequences and get the sequences families with ideal correlation value. Also we can get the correlation value of the constructing new sequences quickly and estimate whether they can be applied into the corresponding system or not. At last comparison of the new algorithm and original algorithm between some sequences with different length has been presented as examples, then we can see the former is more faster.