{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/v-shaped-sparse-arrays-for-2-d-doa-estimation","title":"V-Shaped Sparse Arrays For 2-D DOA Estimation","arxiv_id":"1912.00364","date":"2019-12-01","proceeding":null,"authors":["Ahmet M. Elbir"],"abstract":"This paper proposes a new sparse array geometry for 2-D (azimuth and elevation) DOA (direction-of-arrival) estimation. The proposed array geometry is V-shaped sparse array and it is composed of two linear portions which are crossing each other. The degrees of freedom of the sparse array is enhanced by sparse sampling property. In this respect, V-shaped coprime (VCA) and V-shaped nested array (VNA) structures are developed. VCA can resolve both azimuth and elevation angles up to MN sources with 2M + N -1 sensors in each portion and the total number of sensors is 4M+2N-3. VNA can resolve O(N^2) sources with 2N sensors. Instead of 2-D grid search, the proposed method computes 1-D search for azimuth and elevation angle estimation in a computational efficient way. In order to solve the pairing problem in 2-D scenario, the cross-covariance matrix of two portion is utilized and 2-D paired DOA estimation is performed. The performance of the proposed method is evaluated with numerical simulations and it is shown that the proposed array geometries VCA and VNA can provide much less sensors as compared to the conventional coprime planar arrays.","url_abs":"https://arxiv.org/abs/1912.00364v1","url_pdf":"https://arxiv.org/pdf/1912.00364v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"v-shaped-sparse-arrays-for-2-d-doa-estimation","repo_url":"https://github.com/meuseabe/VshapedSparseArray","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"direction-of-arrival-estimation","task_name":"Direction of Arrival Estimation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"meuseabe/VshapedSparseArray","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"320ace5ccc1e01dcafa1d32bdcf494cb1454c39ae0ff4b7c950343d9cf613a03","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}