In this paper a procedure which filters out roughly half of the array manifold errors for approximately centro-symmetric arrays is described. The procedure-subspace domain forwards-backwards (f/b) averaging-improves the performance of subspace based direction finding (DF) algorithms such as MUSIC and ESPRIT. Experimental data from the Mountaintop system are used to confirm the theoretical results.

Article history: Available online xxxx

Let us write DF (G) = {F ∈ F : F ∩ G = ∅} for a set G and a family F . Then a family F of sets is said to be (≤ l)-almost intersecting (l-almost intersecting) if for any F ∈ F we have |DF (F )| ≤ l (|DF (F )| = l). In this paper we investigate the problem of finding the maximum size of an (≤ l)almost intersecting (l-almost intersecting) family F . AMS Subject Classification: 05D05

We are concerned with direction-of-arrival estimation and signal classification with electromagnetic vector sensors for scenarios where completely and incompletely polarized signals may co-exist. We propose an efficient ESPRIT-based method, address the identifiability of the proposed method, and compare its performance against CRB.

Article history: Received 9 July 2014 Accepted 19 August 2014 Available online xxxx

This paper presents faster inversion-free point addition formulas for the curve y(1 + ax) = cx(1 + dy). The proposed formulas improve the point doubling operation count record from 6M + 5S to 8M and mixed addition operation count record from 10M to 8M. Both sets of formulas are shown to be 4-way parallel, leading to an effective cost of 2M per either of the group operations.