Two-Dimensional Direction of Arrival Estimation Using Generalized ESPRIT Algorithm with Non-uniform L-Shaped Array
Abstract The aim of this study is to solve the problem of two-dimensional direction of arrival (2D-DOA) estimation for non-uniform L-shaped array by employing generalized ESPRIT (GESPRIT) algorithm. GESPRIT algorithm can be seen as an extension of conventional ESPRIT algorithm, which doesn’t require...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Cao, Renzheng [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2015 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media New York 2015 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Wireless personal communications - Springer US, 1994, 84(2015), 1 vom: 05. Mai, Seite 321-339 |
|---|---|
| Übergeordnetes Werk: |
volume:84 ; year:2015 ; number:1 ; day:05 ; month:05 ; pages:321-339 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11277-015-2610-0 |
|---|
| Katalog-ID: |
OLC2053792353 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2053792353 | ||
| 003 | DE-627 | ||
| 005 | 20230504075130.0 | ||
| 007 | tu | ||
| 008 | 200819s2015 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11277-015-2610-0 |2 doi | |
| 035 | |a (DE-627)OLC2053792353 | ||
| 035 | |a (DE-He213)s11277-015-2610-0-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 620 |q VZ |
| 100 | 1 | |a Cao, Renzheng |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Two-Dimensional Direction of Arrival Estimation Using Generalized ESPRIT Algorithm with Non-uniform L-Shaped Array |
| 264 | 1 | |c 2015 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media New York 2015 | ||
| 520 | |a Abstract The aim of this study is to solve the problem of two-dimensional direction of arrival (2D-DOA) estimation for non-uniform L-shaped array by employing generalized ESPRIT (GESPRIT) algorithm. GESPRIT algorithm can be seen as an extension of conventional ESPRIT algorithm, which doesn’t require any particular array geometry. Our work is to extend this method to the 2D-DOA estimation case. The 2D-GESPRIT algorithm, which is referred to as the direct extension of GESPRIT algorithm, performs poorly in actual implementation. We make improvement by exploiting the 2D-NGESPRIT algorithm with reference to the NGESPRIT algorithm. To reduce the computational complexity, we propose a successive GESPRIT (S-GESPRIT) algorithm which needs only one-dimensional searches. The S-GESPRIT algorithm has comparable performance to the 2D-NGESPRIT algorithm and needs no additional pair-matching procedure. Furthermore, it imposes no constraints on the sensor spacing. We also derive the Cramer–Rao bound of 2D-DOA estimation for a non-uniform L-shaped array and conduct the computational complexity analysis. The simulation results verify the effectiveness and improvement of the proposed algorithms. | ||
| 650 | 4 | |a Array signal processing | |
| 650 | 4 | |a 2D-DOA estimation | |
| 650 | 4 | |a Generalized ESPRIT | |
| 650 | 4 | |a Non-uniform L-shaped array | |
| 700 | 1 | |a Wang, Chenghua |4 aut | |
| 700 | 1 | |a Zhang, Xiaofei |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Wireless personal communications |d Springer US, 1994 |g 84(2015), 1 vom: 05. Mai, Seite 321-339 |w (DE-627)188950273 |w (DE-600)1287489-9 |w (DE-576)049958909 |x 0929-6212 |7 nnns |
| 773 | 1 | 8 | |g volume:84 |g year:2015 |g number:1 |g day:05 |g month:05 |g pages:321-339 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11277-015-2610-0 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MKW | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_4266 | ||
| 951 | |a AR | ||
| 952 | |d 84 |j 2015 |e 1 |b 05 |c 05 |h 321-339 | ||
| author_variant |
r c rc c w cw x z xz |
|---|---|
| matchkey_str |
article:09296212:2015----::wdmninlietooarvlsiainsngnrlzdsrtloih |
| hierarchy_sort_str |
2015 |
| publishDate |
2015 |
| allfields |
10.1007/s11277-015-2610-0 doi (DE-627)OLC2053792353 (DE-He213)s11277-015-2610-0-p DE-627 ger DE-627 rakwb eng 620 VZ Cao, Renzheng verfasserin aut Two-Dimensional Direction of Arrival Estimation Using Generalized ESPRIT Algorithm with Non-uniform L-Shaped Array 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2015 Abstract The aim of this study is to solve the problem of two-dimensional direction of arrival (2D-DOA) estimation for non-uniform L-shaped array by employing generalized ESPRIT (GESPRIT) algorithm. GESPRIT algorithm can be seen as an extension of conventional ESPRIT algorithm, which doesn’t require any particular array geometry. Our work is to extend this method to the 2D-DOA estimation case. The 2D-GESPRIT algorithm, which is referred to as the direct extension of GESPRIT algorithm, performs poorly in actual implementation. We make improvement by exploiting the 2D-NGESPRIT algorithm with reference to the NGESPRIT algorithm. To reduce the computational complexity, we propose a successive GESPRIT (S-GESPRIT) algorithm which needs only one-dimensional searches. The S-GESPRIT algorithm has comparable performance to the 2D-NGESPRIT algorithm and needs no additional pair-matching procedure. Furthermore, it imposes no constraints on the sensor spacing. We also derive the Cramer–Rao bound of 2D-DOA estimation for a non-uniform L-shaped array and conduct the computational complexity analysis. The simulation results verify the effectiveness and improvement of the proposed algorithms. Array signal processing 2D-DOA estimation Generalized ESPRIT Non-uniform L-shaped array Wang, Chenghua aut Zhang, Xiaofei aut Enthalten in Wireless personal communications Springer US, 1994 84(2015), 1 vom: 05. Mai, Seite 321-339 (DE-627)188950273 (DE-600)1287489-9 (DE-576)049958909 0929-6212 nnns volume:84 year:2015 number:1 day:05 month:05 pages:321-339 https://doi.org/10.1007/s11277-015-2610-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MKW GBV_ILN_70 GBV_ILN_4266 AR 84 2015 1 05 05 321-339 |
| spelling |
10.1007/s11277-015-2610-0 doi (DE-627)OLC2053792353 (DE-He213)s11277-015-2610-0-p DE-627 ger DE-627 rakwb eng 620 VZ Cao, Renzheng verfasserin aut Two-Dimensional Direction of Arrival Estimation Using Generalized ESPRIT Algorithm with Non-uniform L-Shaped Array 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2015 Abstract The aim of this study is to solve the problem of two-dimensional direction of arrival (2D-DOA) estimation for non-uniform L-shaped array by employing generalized ESPRIT (GESPRIT) algorithm. GESPRIT algorithm can be seen as an extension of conventional ESPRIT algorithm, which doesn’t require any particular array geometry. Our work is to extend this method to the 2D-DOA estimation case. The 2D-GESPRIT algorithm, which is referred to as the direct extension of GESPRIT algorithm, performs poorly in actual implementation. We make improvement by exploiting the 2D-NGESPRIT algorithm with reference to the NGESPRIT algorithm. To reduce the computational complexity, we propose a successive GESPRIT (S-GESPRIT) algorithm which needs only one-dimensional searches. The S-GESPRIT algorithm has comparable performance to the 2D-NGESPRIT algorithm and needs no additional pair-matching procedure. Furthermore, it imposes no constraints on the sensor spacing. We also derive the Cramer–Rao bound of 2D-DOA estimation for a non-uniform L-shaped array and conduct the computational complexity analysis. The simulation results verify the effectiveness and improvement of the proposed algorithms. Array signal processing 2D-DOA estimation Generalized ESPRIT Non-uniform L-shaped array Wang, Chenghua aut Zhang, Xiaofei aut Enthalten in Wireless personal communications Springer US, 1994 84(2015), 1 vom: 05. Mai, Seite 321-339 (DE-627)188950273 (DE-600)1287489-9 (DE-576)049958909 0929-6212 nnns volume:84 year:2015 number:1 day:05 month:05 pages:321-339 https://doi.org/10.1007/s11277-015-2610-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MKW GBV_ILN_70 GBV_ILN_4266 AR 84 2015 1 05 05 321-339 |
| allfields_unstemmed |
10.1007/s11277-015-2610-0 doi (DE-627)OLC2053792353 (DE-He213)s11277-015-2610-0-p DE-627 ger DE-627 rakwb eng 620 VZ Cao, Renzheng verfasserin aut Two-Dimensional Direction of Arrival Estimation Using Generalized ESPRIT Algorithm with Non-uniform L-Shaped Array 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2015 Abstract The aim of this study is to solve the problem of two-dimensional direction of arrival (2D-DOA) estimation for non-uniform L-shaped array by employing generalized ESPRIT (GESPRIT) algorithm. GESPRIT algorithm can be seen as an extension of conventional ESPRIT algorithm, which doesn’t require any particular array geometry. Our work is to extend this method to the 2D-DOA estimation case. The 2D-GESPRIT algorithm, which is referred to as the direct extension of GESPRIT algorithm, performs poorly in actual implementation. We make improvement by exploiting the 2D-NGESPRIT algorithm with reference to the NGESPRIT algorithm. To reduce the computational complexity, we propose a successive GESPRIT (S-GESPRIT) algorithm which needs only one-dimensional searches. The S-GESPRIT algorithm has comparable performance to the 2D-NGESPRIT algorithm and needs no additional pair-matching procedure. Furthermore, it imposes no constraints on the sensor spacing. We also derive the Cramer–Rao bound of 2D-DOA estimation for a non-uniform L-shaped array and conduct the computational complexity analysis. The simulation results verify the effectiveness and improvement of the proposed algorithms. Array signal processing 2D-DOA estimation Generalized ESPRIT Non-uniform L-shaped array Wang, Chenghua aut Zhang, Xiaofei aut Enthalten in Wireless personal communications Springer US, 1994 84(2015), 1 vom: 05. Mai, Seite 321-339 (DE-627)188950273 (DE-600)1287489-9 (DE-576)049958909 0929-6212 nnns volume:84 year:2015 number:1 day:05 month:05 pages:321-339 https://doi.org/10.1007/s11277-015-2610-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MKW GBV_ILN_70 GBV_ILN_4266 AR 84 2015 1 05 05 321-339 |
| allfieldsGer |
10.1007/s11277-015-2610-0 doi (DE-627)OLC2053792353 (DE-He213)s11277-015-2610-0-p DE-627 ger DE-627 rakwb eng 620 VZ Cao, Renzheng verfasserin aut Two-Dimensional Direction of Arrival Estimation Using Generalized ESPRIT Algorithm with Non-uniform L-Shaped Array 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2015 Abstract The aim of this study is to solve the problem of two-dimensional direction of arrival (2D-DOA) estimation for non-uniform L-shaped array by employing generalized ESPRIT (GESPRIT) algorithm. GESPRIT algorithm can be seen as an extension of conventional ESPRIT algorithm, which doesn’t require any particular array geometry. Our work is to extend this method to the 2D-DOA estimation case. The 2D-GESPRIT algorithm, which is referred to as the direct extension of GESPRIT algorithm, performs poorly in actual implementation. We make improvement by exploiting the 2D-NGESPRIT algorithm with reference to the NGESPRIT algorithm. To reduce the computational complexity, we propose a successive GESPRIT (S-GESPRIT) algorithm which needs only one-dimensional searches. The S-GESPRIT algorithm has comparable performance to the 2D-NGESPRIT algorithm and needs no additional pair-matching procedure. Furthermore, it imposes no constraints on the sensor spacing. We also derive the Cramer–Rao bound of 2D-DOA estimation for a non-uniform L-shaped array and conduct the computational complexity analysis. The simulation results verify the effectiveness and improvement of the proposed algorithms. Array signal processing 2D-DOA estimation Generalized ESPRIT Non-uniform L-shaped array Wang, Chenghua aut Zhang, Xiaofei aut Enthalten in Wireless personal communications Springer US, 1994 84(2015), 1 vom: 05. Mai, Seite 321-339 (DE-627)188950273 (DE-600)1287489-9 (DE-576)049958909 0929-6212 nnns volume:84 year:2015 number:1 day:05 month:05 pages:321-339 https://doi.org/10.1007/s11277-015-2610-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MKW GBV_ILN_70 GBV_ILN_4266 AR 84 2015 1 05 05 321-339 |
| allfieldsSound |
10.1007/s11277-015-2610-0 doi (DE-627)OLC2053792353 (DE-He213)s11277-015-2610-0-p DE-627 ger DE-627 rakwb eng 620 VZ Cao, Renzheng verfasserin aut Two-Dimensional Direction of Arrival Estimation Using Generalized ESPRIT Algorithm with Non-uniform L-Shaped Array 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media New York 2015 Abstract The aim of this study is to solve the problem of two-dimensional direction of arrival (2D-DOA) estimation for non-uniform L-shaped array by employing generalized ESPRIT (GESPRIT) algorithm. GESPRIT algorithm can be seen as an extension of conventional ESPRIT algorithm, which doesn’t require any particular array geometry. Our work is to extend this method to the 2D-DOA estimation case. The 2D-GESPRIT algorithm, which is referred to as the direct extension of GESPRIT algorithm, performs poorly in actual implementation. We make improvement by exploiting the 2D-NGESPRIT algorithm with reference to the NGESPRIT algorithm. To reduce the computational complexity, we propose a successive GESPRIT (S-GESPRIT) algorithm which needs only one-dimensional searches. The S-GESPRIT algorithm has comparable performance to the 2D-NGESPRIT algorithm and needs no additional pair-matching procedure. Furthermore, it imposes no constraints on the sensor spacing. We also derive the Cramer–Rao bound of 2D-DOA estimation for a non-uniform L-shaped array and conduct the computational complexity analysis. The simulation results verify the effectiveness and improvement of the proposed algorithms. Array signal processing 2D-DOA estimation Generalized ESPRIT Non-uniform L-shaped array Wang, Chenghua aut Zhang, Xiaofei aut Enthalten in Wireless personal communications Springer US, 1994 84(2015), 1 vom: 05. Mai, Seite 321-339 (DE-627)188950273 (DE-600)1287489-9 (DE-576)049958909 0929-6212 nnns volume:84 year:2015 number:1 day:05 month:05 pages:321-339 https://doi.org/10.1007/s11277-015-2610-0 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MKW GBV_ILN_70 GBV_ILN_4266 AR 84 2015 1 05 05 321-339 |
| language |
English |
| source |
Enthalten in Wireless personal communications 84(2015), 1 vom: 05. Mai, Seite 321-339 volume:84 year:2015 number:1 day:05 month:05 pages:321-339 |
| sourceStr |
Enthalten in Wireless personal communications 84(2015), 1 vom: 05. Mai, Seite 321-339 volume:84 year:2015 number:1 day:05 month:05 pages:321-339 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Array signal processing 2D-DOA estimation Generalized ESPRIT Non-uniform L-shaped array |
| dewey-raw |
620 |
| isfreeaccess_bool |
false |
| container_title |
Wireless personal communications |
| authorswithroles_txt_mv |
Cao, Renzheng @@aut@@ Wang, Chenghua @@aut@@ Zhang, Xiaofei @@aut@@ |
| publishDateDaySort_date |
2015-05-05T00:00:00Z |
| hierarchy_top_id |
188950273 |
| dewey-sort |
3620 |
| id |
OLC2053792353 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2053792353</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504075130.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2015 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11277-015-2610-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2053792353</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11277-015-2610-0-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cao, Renzheng</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Two-Dimensional Direction of Arrival Estimation Using Generalized ESPRIT Algorithm with Non-uniform L-Shaped Array</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media New York 2015</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The aim of this study is to solve the problem of two-dimensional direction of arrival (2D-DOA) estimation for non-uniform L-shaped array by employing generalized ESPRIT (GESPRIT) algorithm. GESPRIT algorithm can be seen as an extension of conventional ESPRIT algorithm, which doesn’t require any particular array geometry. Our work is to extend this method to the 2D-DOA estimation case. The 2D-GESPRIT algorithm, which is referred to as the direct extension of GESPRIT algorithm, performs poorly in actual implementation. We make improvement by exploiting the 2D-NGESPRIT algorithm with reference to the NGESPRIT algorithm. To reduce the computational complexity, we propose a successive GESPRIT (S-GESPRIT) algorithm which needs only one-dimensional searches. The S-GESPRIT algorithm has comparable performance to the 2D-NGESPRIT algorithm and needs no additional pair-matching procedure. Furthermore, it imposes no constraints on the sensor spacing. We also derive the Cramer–Rao bound of 2D-DOA estimation for a non-uniform L-shaped array and conduct the computational complexity analysis. The simulation results verify the effectiveness and improvement of the proposed algorithms.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Array signal processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">2D-DOA estimation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Generalized ESPRIT</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Non-uniform L-shaped array</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Chenghua</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Xiaofei</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Wireless personal communications</subfield><subfield code="d">Springer US, 1994</subfield><subfield code="g">84(2015), 1 vom: 05. Mai, Seite 321-339</subfield><subfield code="w">(DE-627)188950273</subfield><subfield code="w">(DE-600)1287489-9</subfield><subfield code="w">(DE-576)049958909</subfield><subfield code="x">0929-6212</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:84</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:1</subfield><subfield code="g">day:05</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:321-339</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11277-015-2610-0</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MKW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">84</subfield><subfield code="j">2015</subfield><subfield code="e">1</subfield><subfield code="b">05</subfield><subfield code="c">05</subfield><subfield code="h">321-339</subfield></datafield></record></collection>
|
| author |
Cao, Renzheng |
| spellingShingle |
Cao, Renzheng ddc 620 misc Array signal processing misc 2D-DOA estimation misc Generalized ESPRIT misc Non-uniform L-shaped array Two-Dimensional Direction of Arrival Estimation Using Generalized ESPRIT Algorithm with Non-uniform L-Shaped Array |
| authorStr |
Cao, Renzheng |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)188950273 |
| format |
Article |
| dewey-ones |
620 - Engineering & allied operations |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0929-6212 |
| topic_title |
620 VZ Two-Dimensional Direction of Arrival Estimation Using Generalized ESPRIT Algorithm with Non-uniform L-Shaped Array Array signal processing 2D-DOA estimation Generalized ESPRIT Non-uniform L-shaped array |
| topic |
ddc 620 misc Array signal processing misc 2D-DOA estimation misc Generalized ESPRIT misc Non-uniform L-shaped array |
| topic_unstemmed |
ddc 620 misc Array signal processing misc 2D-DOA estimation misc Generalized ESPRIT misc Non-uniform L-shaped array |
| topic_browse |
ddc 620 misc Array signal processing misc 2D-DOA estimation misc Generalized ESPRIT misc Non-uniform L-shaped array |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Wireless personal communications |
| hierarchy_parent_id |
188950273 |
| dewey-tens |
620 - Engineering |
| hierarchy_top_title |
Wireless personal communications |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)188950273 (DE-600)1287489-9 (DE-576)049958909 |
| title |
Two-Dimensional Direction of Arrival Estimation Using Generalized ESPRIT Algorithm with Non-uniform L-Shaped Array |
| ctrlnum |
(DE-627)OLC2053792353 (DE-He213)s11277-015-2610-0-p |
| title_full |
Two-Dimensional Direction of Arrival Estimation Using Generalized ESPRIT Algorithm with Non-uniform L-Shaped Array |
| author_sort |
Cao, Renzheng |
| journal |
Wireless personal communications |
| journalStr |
Wireless personal communications |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology |
| recordtype |
marc |
| publishDateSort |
2015 |
| contenttype_str_mv |
txt |
| container_start_page |
321 |
| author_browse |
Cao, Renzheng Wang, Chenghua Zhang, Xiaofei |
| container_volume |
84 |
| class |
620 VZ |
| format_se |
Aufsätze |
| author-letter |
Cao, Renzheng |
| doi_str_mv |
10.1007/s11277-015-2610-0 |
| dewey-full |
620 |
| title_sort |
two-dimensional direction of arrival estimation using generalized esprit algorithm with non-uniform l-shaped array |
| title_auth |
Two-Dimensional Direction of Arrival Estimation Using Generalized ESPRIT Algorithm with Non-uniform L-Shaped Array |
| abstract |
Abstract The aim of this study is to solve the problem of two-dimensional direction of arrival (2D-DOA) estimation for non-uniform L-shaped array by employing generalized ESPRIT (GESPRIT) algorithm. GESPRIT algorithm can be seen as an extension of conventional ESPRIT algorithm, which doesn’t require any particular array geometry. Our work is to extend this method to the 2D-DOA estimation case. The 2D-GESPRIT algorithm, which is referred to as the direct extension of GESPRIT algorithm, performs poorly in actual implementation. We make improvement by exploiting the 2D-NGESPRIT algorithm with reference to the NGESPRIT algorithm. To reduce the computational complexity, we propose a successive GESPRIT (S-GESPRIT) algorithm which needs only one-dimensional searches. The S-GESPRIT algorithm has comparable performance to the 2D-NGESPRIT algorithm and needs no additional pair-matching procedure. Furthermore, it imposes no constraints on the sensor spacing. We also derive the Cramer–Rao bound of 2D-DOA estimation for a non-uniform L-shaped array and conduct the computational complexity analysis. The simulation results verify the effectiveness and improvement of the proposed algorithms. © Springer Science+Business Media New York 2015 |
| abstractGer |
Abstract The aim of this study is to solve the problem of two-dimensional direction of arrival (2D-DOA) estimation for non-uniform L-shaped array by employing generalized ESPRIT (GESPRIT) algorithm. GESPRIT algorithm can be seen as an extension of conventional ESPRIT algorithm, which doesn’t require any particular array geometry. Our work is to extend this method to the 2D-DOA estimation case. The 2D-GESPRIT algorithm, which is referred to as the direct extension of GESPRIT algorithm, performs poorly in actual implementation. We make improvement by exploiting the 2D-NGESPRIT algorithm with reference to the NGESPRIT algorithm. To reduce the computational complexity, we propose a successive GESPRIT (S-GESPRIT) algorithm which needs only one-dimensional searches. The S-GESPRIT algorithm has comparable performance to the 2D-NGESPRIT algorithm and needs no additional pair-matching procedure. Furthermore, it imposes no constraints on the sensor spacing. We also derive the Cramer–Rao bound of 2D-DOA estimation for a non-uniform L-shaped array and conduct the computational complexity analysis. The simulation results verify the effectiveness and improvement of the proposed algorithms. © Springer Science+Business Media New York 2015 |
| abstract_unstemmed |
Abstract The aim of this study is to solve the problem of two-dimensional direction of arrival (2D-DOA) estimation for non-uniform L-shaped array by employing generalized ESPRIT (GESPRIT) algorithm. GESPRIT algorithm can be seen as an extension of conventional ESPRIT algorithm, which doesn’t require any particular array geometry. Our work is to extend this method to the 2D-DOA estimation case. The 2D-GESPRIT algorithm, which is referred to as the direct extension of GESPRIT algorithm, performs poorly in actual implementation. We make improvement by exploiting the 2D-NGESPRIT algorithm with reference to the NGESPRIT algorithm. To reduce the computational complexity, we propose a successive GESPRIT (S-GESPRIT) algorithm which needs only one-dimensional searches. The S-GESPRIT algorithm has comparable performance to the 2D-NGESPRIT algorithm and needs no additional pair-matching procedure. Furthermore, it imposes no constraints on the sensor spacing. We also derive the Cramer–Rao bound of 2D-DOA estimation for a non-uniform L-shaped array and conduct the computational complexity analysis. The simulation results verify the effectiveness and improvement of the proposed algorithms. © Springer Science+Business Media New York 2015 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MKW GBV_ILN_70 GBV_ILN_4266 |
| container_issue |
1 |
| title_short |
Two-Dimensional Direction of Arrival Estimation Using Generalized ESPRIT Algorithm with Non-uniform L-Shaped Array |
| url |
https://doi.org/10.1007/s11277-015-2610-0 |
| remote_bool |
false |
| author2 |
Wang, Chenghua Zhang, Xiaofei |
| author2Str |
Wang, Chenghua Zhang, Xiaofei |
| ppnlink |
188950273 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11277-015-2610-0 |
| up_date |
2024-07-03T20:39:12.774Z |
| _version_ |
1803591774660198400 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2053792353</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230504075130.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2015 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11277-015-2610-0</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2053792353</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11277-015-2610-0-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cao, Renzheng</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Two-Dimensional Direction of Arrival Estimation Using Generalized ESPRIT Algorithm with Non-uniform L-Shaped Array</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media New York 2015</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The aim of this study is to solve the problem of two-dimensional direction of arrival (2D-DOA) estimation for non-uniform L-shaped array by employing generalized ESPRIT (GESPRIT) algorithm. GESPRIT algorithm can be seen as an extension of conventional ESPRIT algorithm, which doesn’t require any particular array geometry. Our work is to extend this method to the 2D-DOA estimation case. The 2D-GESPRIT algorithm, which is referred to as the direct extension of GESPRIT algorithm, performs poorly in actual implementation. We make improvement by exploiting the 2D-NGESPRIT algorithm with reference to the NGESPRIT algorithm. To reduce the computational complexity, we propose a successive GESPRIT (S-GESPRIT) algorithm which needs only one-dimensional searches. The S-GESPRIT algorithm has comparable performance to the 2D-NGESPRIT algorithm and needs no additional pair-matching procedure. Furthermore, it imposes no constraints on the sensor spacing. We also derive the Cramer–Rao bound of 2D-DOA estimation for a non-uniform L-shaped array and conduct the computational complexity analysis. The simulation results verify the effectiveness and improvement of the proposed algorithms.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Array signal processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">2D-DOA estimation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Generalized ESPRIT</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Non-uniform L-shaped array</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wang, Chenghua</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Xiaofei</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Wireless personal communications</subfield><subfield code="d">Springer US, 1994</subfield><subfield code="g">84(2015), 1 vom: 05. Mai, Seite 321-339</subfield><subfield code="w">(DE-627)188950273</subfield><subfield code="w">(DE-600)1287489-9</subfield><subfield code="w">(DE-576)049958909</subfield><subfield code="x">0929-6212</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:84</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:1</subfield><subfield code="g">day:05</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:321-339</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11277-015-2610-0</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MKW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">84</subfield><subfield code="j">2015</subfield><subfield code="e">1</subfield><subfield code="b">05</subfield><subfield code="c">05</subfield><subfield code="h">321-339</subfield></datafield></record></collection>
|
| score |
7.4022274 |