Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/32132
Full metadata record
DC FieldValueLanguage
dc.contributor.authorCao, J-
dc.contributor.authorYang, Z-
dc.contributor.authorXiao, M-
dc.contributor.authorChen, X-
dc.contributor.authorNandi, AK-
dc.date.accessioned2025-10-13T07:26:51Z-
dc.date.available2025-10-13T07:26:51Z-
dc.date.issued2025-09-22-
dc.identifierORCiD: Asoke Nandi https://orcid.org/0000-0001-6248-2875-
dc.identifier.citationCao, J. et al. (2025) 'Delay Coprime Array: A New Sparse Linear Array for Fast and Robust DOA Estimation', IEEE Signal Processing Letters, 0 (early access), pp. 1 - 5. doi: 10.1109/lsp.2025.3612359.en_US
dc.identifier.issn1070-9908-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/32132-
dc.description.abstractIn this letter, we propose a new sparse linear array (SLA), termed delay coprime array (DCA), and correspondingly develop a low-complexity direction of arrival (DOA) estimation algorithm. In terms of structure, unlike existing SLAs, e.g., coprime array, DCA is composed of two “large-spaced” uniform linear arrays (ULAs) with shifted distance which is coprime with the inter-element spacing in the ULAs. In terms of algorithm, the proposed algorithm involves ambiguity and de-ambiguity stages and significantly improves estimation accuracy due to the active use of phase ambiguity instead of hastily suppressing ambiguity. Numerical results indicate that DOA estimation with DCA has comparable performance as the existing DOA estimation with SLAs, but with much lower complexity and simpler configuration. Admittedly, since the proposed method achieves fast calculation without using difference co-array, it losts the ability to identify more sources. Yet, owing to low complexity and simple configuration, DCA and the corresponding algorithm are expected to play a role in DOA estimation.en_US
dc.format.extent1 - 5-
dc.format.mediumPrint-Electronic-
dc.language.isoen_USen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.rightsCopyright © 2025 Institute of Electrical and Electronics Engineers (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 ( https://journals.ieeeauthorcenter.ieee.org/become-an-ieee-journal-author/publishing-ethics/guidelines-and-policies/post-publication-policies/ ).-
dc.rights.urihttps://journals.ieeeauthorcenter.ieee.org/become-an-ieee-journal-author/publishing-ethics/guidelines-and-policies/post-publication-policies/-
dc.subjectsparse linear arrayen_US
dc.subjectDOA estimationen_US
dc.subjectphase ambiguityen_US
dc.subjectphase de-ambiguityen_US
dc.subjectChinese remainder theoremen_US
dc.titleDelay Coprime Array: A New Sparse Linear Array for Fast and Robust DOA Estimationen_US
dc.typeArticleen_US
dc.identifier.doihttps://doi.org/10.1109/lsp.2025.3612359-
dc.relation.isPartOfIEEE Signal Processing Letters-
pubs.publication-statusPublished-
dc.identifier.eissn1558-2361-
dc.rights.holderInstitute of Electrical and Electronics Engineers (IEEE)-
Appears in Collections:Dept of Electronic and Electrical Engineering Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2025 Institute of Electrical and Electronics Engineers (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 ( https://journals.ieeeauthorcenter.ieee.org/become-an-ieee-journal-author/publishing-ethics/guidelines-and-policies/post-publication-policies/ ).1.21 MBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.