DocumentCode :
3102340
Title :
Best known PSLs for binary sequences from bit length 71 through 100
Author :
Nasrabadi, M. Amin ; Bastani, M.H.
Author_Institution :
BasamadAzma Co., Tehran
fYear :
2008
fDate :
27-28 Aug. 2008
Firstpage :
697
Lastpage :
700
Abstract :
This paper develops a new evolutionary algorithm for generating low autocorrelation binary sequences. These sequences are of interest in pulse compression technique. The proposed algorithm is fast enough to yield optimum or near optimum codes. The generated sequences were compared to the best literature and were seen that its results are better than the others. This suggested method could change 11 rows of the previous best known PSLs table, whereas the previous literature could change only one record. These records were combined with the best results reported in the papers to produce a new best minimal-PSL binary sequence table for bit lengths 71 through 100.
Keywords :
binary sequences; evolutionary computation; pulse compression; binary sequences; evolutionary algorithm; partial search; pulse compression technique; Autocorrelation; Binary codes; Binary sequences; Energy resolution; Evolutionary computation; Frequency; Modems; Pulse compression methods; Search methods; Stochastic processes; evolutionary algorithm; low autocorrelation binary sequence; partial search; pulse compression;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Telecommunications, 2008. IST 2008. International Symposium on
Conference_Location :
Tehran
Print_ISBN :
978-1-4244-2750-5
Electronic_ISBN :
978-1-4244-2751-2
Type :
conf
DOI :
10.1109/ISTEL.2008.4651390
Filename :
4651390
Link To Document :
بازگشت