8 January 2020 in IEEE Transactions on Antennas and Propagation
Traditionally regularly spaced antenna arrays follow the spatial Nyquist criterion to guarantee an unambiguous analysis. We present a novel technique that makes use of two sparse non-Nyquist regularly spaced antenna arrays, where one of the arrays is just a shifted version of the other. The method offers several advantages over the use of traditional dense Nyquist-spaced arrays, while maintaining a comparable algorithmic complexity for the analysis. Among the advantages we mention: an improved resolution for the same number of receivers and reduced mutual coupling effects between the receivers, both due to the increased separation between the antennas. Because of a shared structured linear system of equations between the two arrays, as a consequence of the shift between the two, the analysis of both is automatically paired, thereby avoiding a computationally expensive matching step as is required in the use of so-called co-prime arrays. In addition, an easy validation step allows to automatically detect the precise number of incoming signals, which is usually considered a difficult issue. At the same time, the validation step improves the accuracy of the retrieved results and eliminates unreliable results in the case of noisy data. The performance of the proposed method is illustrated with respect to the influence of noise as well to the effect of mutual coupling.
2 November 2023 in Maple Transactions
This work continues the analysis of the conditioning of a Hankel structured generalized eigenvalue problem (GEP) started in [1]. The considered generalized eigenvalue problem appears in exponential analysis and sparse interpolation. We generalize the proof in [1] and add expressions for the relative condition numbers of two reformulations of the GEP, a reformulation as a Loewner GEP valid for general complex data, and a compression to a Hankel+Toeplitz GEP in the case of real data. Both reformulations are compared to the original Hankel GEP. The analysis is concluded with ample numerical illustrations.
30 November 2022 in Numerical Algorithms