Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Efficient exhaustive search for optimal-peak-sidelobe binary codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Coxson, G. ; Lockheed Martin Maritime Syst. & Sensors, Moorestown, NJ, USA ; Russo, J.

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.

Published in:

Aerospace and Electronic Systems, IEEE Transactions on  (Volume:41 ,  Issue: 1 )