Loading...

Exhaustive search for long low autocorrelation binary codes using length-increment algorithm

Nasrabadi, M. A ; Sharif University of Technology | 2007

489 Viewed
  1. Type of Document: Article
  2. DOI: 10.1049/cp:20070560
  3. Publisher: 2007
  4. Abstract:
  5. Finding binary sequences with low autocorrelation is very important in many applications and their construction is a hard computational problem. Here a new exhaustive search algorithm is developed to find all optimal aperiodic binary sequences which are faster than simple one and it achieves its efficiency through a combination of the following four devices: (1) A branch-and-bound search strategy; (2) Search logic that avoids codes redundant relative to two PSL-preserving operations; (3) A fast recursive method for computing autocorrelation functions of binary sequences; (4) A simple scheme for partitioning and parallelizing, made possible by the fixed upper bound on psl
  6. Keywords:
  7. Branch and bound method ; Correlation detectors ; Correlation theory ; Laser produced plasmas ; Learning algorithms ; Pulse compression ; Radar ; Radar systems ; Recursive functions ; Regression analysis ; Autocorrelation functions ; Branch and bounds ; Exhaustive search ; Exhaustive search algorithms ; Hard computational problems ; Low autocorrelation ; Low autocorrelation binary sequence ; Parallelizing ; Recursive methods ; Search strategies ; Upper bounds ; Binary sequences
  8. Source: RADAR 2007 - The Institution of Engineering and Technology International Conference on Radar Systems, Edinburgh, 15 October 2007 through 18 October 2007 ; Issue 530 CP , 2007 ; 9780863418488 (ISBN)
  9. URL: https://digital-library.theiet.org/content/conferences/10.1049/cp_20070560