27 December 1990 Fast decorrelation algorithm for permutation arrays
Author Affiliations +
Abstract
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.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Gregory S. Yovanof, Gregory S. Yovanof, Solomon W. Golomb, Solomon W. Golomb, } "Fast decorrelation algorithm for permutation arrays", Proc. SPIE 1347, Optical Information Processing Systems and Architectures II, (27 December 1990); doi: 10.1117/12.23433; https://doi.org/10.1117/12.23433
PROCEEDINGS
12 PAGES


SHARE
Back to Top