Loading...

Best known PSLs for binary sequences from bit length 71 through 100

Amin Nasrabadi, M ; Sharif University of Technology | 2008

343 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ISTEL.2008.4651390
  3. Publisher: 2008
  4. Abstract:
  5. 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. ©2008 IEEE
  6. Keywords:
  7. Bit lengths ; Evolutionary algorithin ; Low autocorrelation ; Low autocorrelation binary sequence ; Near optimum ; Partial search ; Pulse compression technique ; Correlation detectors ; Correlation theory ; Evolutionary algorithms ; Laser produced plasmas ; Pulse compression ; Binary sequences
  8. Source: 2008 International Symposium on Telecommunications, IST 2008, Tehran, 27 August 2008 through 28 August 2008 ; October , 2008 , Pages 697-700 ; 9781424427512 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/4651390