{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T06:25:28Z","timestamp":1768976728775,"version":"3.49.0"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Shandong Provincial Natural Science Foundation, China","doi-asserted-by":"publisher","award":["ZR2017PF007"],"award-info":[{"award-number":["ZR2017PF007"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Shandong Provincial Natural Science Foundation, China","doi-asserted-by":"publisher","award":["ZR2016FB19"],"award-info":[{"award-number":["ZR2016FB19"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Funds of Shandong Double Tops Programs","award":["SYL2017YSTD06"],"award-info":[{"award-number":["SYL2017YSTD06"]}]},{"DOI":"10.13039\/501100004306","name":"Youth Foundation of College of ISE, Shandong Agricultural University, China","doi-asserted-by":"publisher","award":["xxxy201702"],"award-info":[{"award-number":["xxxy201702"]}],"id":[{"id":"10.13039\/501100004306","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2805168","type":"journal-article","created":{"date-parts":[[2018,2,12]],"date-time":"2018-02-12T17:48:45Z","timestamp":1518457725000},"page":"8510-8518","source":"Crossref","is-referenced-by-count":15,"title":["An Efficient Dictionary Learning-Based 2-D DOA Estimation Without Pair Matching for Co-Prime Parallel Arrays"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8893-0856","authenticated-orcid":false,"given":"Fenggang","family":"Sun","sequence":"first","affiliation":[]},{"given":"Peng","family":"Lan","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Guowei","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2626255"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2009.4960316"},{"key":"ref30","author":"nocedal","year":"2006","journal-title":"Numerical Optimization"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1049\/el.2015.2261"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1049\/iet-spr.2015.0252"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11045-016-0453-9"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1049\/el.2015.0293"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2016.2567422"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LAWP.2005.863610"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1049\/iet-rsn.2014.0547"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2010.102610.101581"},{"key":"ref18","first-page":"277","article-title":"Sparse representation-based method for two-dimensional direction-of-arrival estimation with L-shaped array","author":"luo","year":"2014","journal-title":"Proc IEEE Int Conf Commun Problem-Solving"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TAP.2007.904143"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2013.2289740"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/78.317861"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2016.06.007"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LAWP.2015.2493099"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2203125"},{"key":"ref29","author":"grant","year":"2008","journal-title":"CVX MATLAB Software for Disciplined Convex Programming"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1989.267051"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2049264"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/DSP-SPE.2011.5739227"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2321791"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472236"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/79.526899"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2012.06.010"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638403"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SAM.2016.7569635"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.857012"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2005.850882"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2316004"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2222378"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08289429.pdf?arnumber=8289429","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:39:40Z","timestamp":1641987580000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8289429\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2805168","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}