论文信息 - Efficient exhaustive search for optimal-peak-sidelobe binary codes

Efficient exhaustive search for optimal-peak-sidelobe binary codes

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.

G. Coxson | J. Russo

[1] M. Schroeder. Number Theory in Science and Communication , 1984 .

[2] G. E. Coxson,et al. New results on minimum-PSL binary codes , 2001, Proceedings of the 2001 IEEE Radar Conference (Cat. No.01CH37200).

[3] S. Mertens. Exhaustive search for low-autocorrelation binary sequences , 1996 .

[4] R. Mayer,et al. Longest binary pulse compression codes with given peak sidelobe levels , 1986, Proceedings of the IEEE.

[5] MARCEL J. E. GOLAY,et al. Sieves for low autocorrelation binary sequences , 1977, IEEE Trans. Inf. Theory.

[6] Stephan Mertens,et al. On the ground states of the Bernasconi model , 1997 .

[7] Albert C. Claus,et al. Number Theory in Science and Communications , 1998 .

[8] J. Lindner,et al. Binary sequences up to length 40 with best possible autocorrelation function , 1975 .

[9] J. M. Baden,et al. Minimum peak sidelobe pulse compression codes , 1990, IEEE International Conference on Radar.

[10] Marcel J. E. Golay,et al. The merit factor of long low autocorrelation binary sequences , 1982, IEEE Trans. Inf. Theory.

[11] Dieter Beule,et al. Evolutionary search for low autocorrelated binary sequences , 1998, IEEE Trans. Evol. Comput..

[12] M.R. Schroeder,et al. Number theory , 1989, IEEE Potentials.