The work presented here describes an exhaustive search for minimum peak sidelobe level (PSL) binary codes, combining several devices for efficiency. These include combinatoric tree search techniques, the use of PSL-preserving symmetries to reduce search space, data representations and operations for fast sidelobe computation, and a partitioning scheme for parallelism. All balanced 64-bit minimum PSL codes are presented, and the upper limit on known consecutive lengths to have PSL = 4 codes is extended to 70. In addition, a technique for determining balance properties of a code for given PSL-preserving transformations is developed.
Efficient exhaustive search for optimal-peak-sidelobe binary codes
IEEE Transactions on Aerospace and Electronic Systems ; 41 , 1 ; 302-308
2005-01-01
569964 byte
Article (Journal)
Electronic Resource
English
Efficient Exhaustive Search for Optimal-Peak-Sidelobe Binary Codes
Online Contents | 2005
|Best-Known Autocorrelation Peak Sidelobe Levels for Binary Codes of Length 71 to 105
Online Contents | 2008
|