In an earlier paper 9], we studied a generalized Rao bound for ordered orthogonal arrays and (T; M; S)-nets. In this paper, we extend this to a coding-theoretic approach to ordered orthogonal arrays. Using a certain association scheme, we prove a MacWilliams-type theorem for linear ordered orthogonal arrays and linear ordered codes as well as a linear programming bound for the general case. We ...

When applied to array processing, the Pisarenko harmonic retrieval method is limited to linear equispaced arrays. We present an approach that allows to extend it to general arrays. For the ease of exposition, we consider only sparse linear arrays. Though limited in generality, these arrays already permit to localize up to N(N 1)/2 narrow-band sources with N-sensors. We actually show that the Pi...

There is a famous construction of orthogonal arrays by R.C. Bose (1947). The construction uses linear transformations over a finite field. We generalize this to use non-linear transformation instead of linear and a subset of vector space as their domains. We show here constructions of orthogonal and balanced arrays which are generated by a set of quadratic function.

In this paper, we propose a fast search-free method for direction-of-arrival (DOA) estimation with coprime arrays. A coprime array consists of two uniform linear subarrays with inter-element spacings Mλ/2 and Nλ/2, where M and N are coprime integers and λ is the wavelength of the signal. Because uniform linear arrays enjoy many processing advantages over arbitrary geometry arrays, our strategy ...

In this paper, we focus on linear complexity measures of multidimensional sequences over finite fields, generalizing the one-dimensional case and including that of multidimensional arrays (identified with multidimensional periodic sequence) as a particular instance. A cryptographically strong sequence or array should not only have a high linear complexity, it should also not be possible to decr...