|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Peer Review Status:||Refereed|
|Title:||Regular sparse array direction of arrival estimation in one dimension|
de Villiers, Dirk I L
direction of arrival estimation
|Citation:||Knaepkens F, Cuyt A, Lee W & de Villiers DIL (2020) Regular sparse array direction of arrival estimation in one dimension. IEEE Transactions on Antennas and Propagation, 68 (5), pp. 3997-4006. https://doi.org/10.1109/TAP.2019.2963618|
|Abstract:||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.|
|Rights:||© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.|
|FINAL VERSION.pdf||Fulltext - Accepted Version||4.54 MB||Adobe PDF||View/Open|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact email@example.com providing details and we will remove the Work from public display in STORRE and investigate your claim.