A fast algorithm has been developed for the reconstruction of an arbitrary permutation array from its two-dimensional aperiodic autoconelation function. The method is simple to apply. It is based on a backtracking search of a difference triangle associated with the permutation array. The issue of homometric arrays is also addressed. These are inequivalent arrays under the group ofEuclidean motions which share the same autocorrelation function. It is shown that the developed algorithm determines all homometric permutation arrays corresponding to a given autocorrelation function.

Date Published: 27 December 1990
PDF: 12 pages
Proc. SPIE 1347, Optical Information Processing Systems and Architectures II, (27 December 1990); doi: 10.1117/12.23433

Published in SPIE Proceedings Vol. 1347:
Optical Information Processing Systems and Architectures II
Bahram Javidi, Editor(s)