DocumentCode :
2430390
Title :
An algorithm design for accelerating the computation of the correlation values
Author :
Jiaxing, Chen ; Zhihua, Liu ; Zhejun, Diao
Author_Institution :
Dept. of Inf. Technol., Hebei Normal Univ., Shijiazhuang
fYear :
2008
fDate :
7-11 June 2008
Firstpage :
527
Lastpage :
529
Abstract :
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.
Keywords :
algorithm theory; correlation methods; sequences; algorithm design; analytical method; correlation values; interleaved sequences; shift sequences; Acceleration; Algorithm design and analysis; Autocorrelation; Computer networks; Information technology; Neural networks; Prototypes; Random sequences; Signal design; Signal processing algorithms; auto-correlation value; cross-correlation value; interleaved sequences; shift sequences;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Neural Networks and Signal Processing, 2008 International Conference on
Conference_Location :
Nanjing
Print_ISBN :
978-1-4244-2310-1
Electronic_ISBN :
978-1-4244-2311-8
Type :
conf
DOI :
10.1109/ICNNSP.2008.4590406
Filename :
4590406
Link To Document :
بازگشت