A new search for optimal binary arrays with minimum peak sidelobe levels

Authors:
Gummadi S. Ramakrishna;Wai Ho Mow
Affiliations:
Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, India;Department of Electrical and Electronic Engineering, Hong Kong University of Science and Technology, Hong Kong S.A.R, China
Venue:
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Year:
2004

Citing 2
Cited 1

Backtrack Programming

Journal of the ACM (JACM)
A Unique Watermark for Every Image

IEEE MultiMedia

Univariate and multivariate merit factors

SETA'04 Proceedings of the Third international conference on Sequences and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The group structure of the 2-dimensional sidelobe-invariant transformations for binary arrays is characterized. The design of an efficient exhaustive backtracking search algorithm, which exploits such group structure to reduce the search space and, in the meantime, applies the partially determined autocorrelation values as backtracking conditions, is presented. As a consequence of applying the algorithm, all optimal binary arrays with minimum peak sidelobe levels consisting of up to 49 elements are obtained and tabulated.