2-D direction finding using parallel nested arrays with full co-array aperture extension
Sparse arrays, such as nested arrays, are able to resolve more sources than sensors because their difference co-arrays can provide O ( L 2...
Ausführliche Beschreibung
Autor*in: |
He, Jin [verfasserIn] Li, Linna [verfasserIn] Shu, Ting [verfasserIn] |
---|
Format: |
E-Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2020 |
---|
Schlagwörter: |
---|
Übergeordnetes Werk: |
Enthalten in: Signal processing - Amsterdam [u.a.] : Elsevier, 1979, 178 |
---|---|
Übergeordnetes Werk: |
volume:178 |
DOI / URN: |
10.1016/j.sigpro.2020.107795 |
---|
Katalog-ID: |
ELV004797892 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | ELV004797892 | ||
003 | DE-627 | ||
005 | 20230524164711.0 | ||
007 | cr uuu---uuuuu | ||
008 | 230503s2020 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1016/j.sigpro.2020.107795 |2 doi | |
035 | |a (DE-627)ELV004797892 | ||
035 | |a (ELSEVIER)S0165-1684(20)30339-X | ||
040 | |a DE-627 |b ger |c DE-627 |e rda | ||
041 | |a eng | ||
082 | 0 | 4 | |a 004 |a 000 |q DE-600 |
084 | |a 53.73 |2 bkl | ||
100 | 1 | |a He, Jin |e verfasserin |0 (orcid)0000-0001-6929-6354 |4 aut | |
245 | 1 | 0 | |a 2-D direction finding using parallel nested arrays with full co-array aperture extension |
264 | 1 | |c 2020 | |
336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
337 | |a Computermedien |b c |2 rdamedia | ||
338 | |a Online-Ressource |b cr |2 rdacarrier | ||
520 | |a Sparse arrays, such as nested arrays, are able to resolve more sources than sensors because their difference co-arrays can provide O ( L 2 ) degrees-of-freedom (DOFs) with L physical sensors. Most of the existing nested array direction-finding algorithms apply the spatial smoothing technique to realize this DOFs enhancement. One shortcoming of this type of methods is the efficient co-array aperture is reduced in processing the spatial smoothing, resulting in the DOFs are not fully utilized. In this paper, we propose a new approach using two parallel linear nested arrays to contribute full DOFs for two-dimensional direction-finding. To exploit the entire DOFs, we perform the vectorization of multiple fourth-order cumulant matrices and take the average of their co-array covariance matrices, instead of the spatial smoothing of the vectorization of the data covariance matrix. Based on a well-posed identification analysis, we show that the proposed approach can identify the number of sources approximately three times than the algorithms using the spatial smoothing technique. For example, for a two-level parallel nested array of 2 + 2 sensors in each subarray, the maximum number of sources that can be resolved by the proposed approach is 32, whereas, for most of the existing algorithms, the number reduces to 10. | ||
650 | 4 | |a Array signal processing | |
650 | 4 | |a direction finding | |
650 | 4 | |a nested array | |
650 | 4 | |a difference co-array | |
700 | 1 | |a Li, Linna |e verfasserin |4 aut | |
700 | 1 | |a Shu, Ting |e verfasserin |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Signal processing |d Amsterdam [u.a.] : Elsevier, 1979 |g 178 |h Online-Ressource |w (DE-627)265784166 |w (DE-600)1466346-6 |w (DE-576)074891022 |7 nnns |
773 | 1 | 8 | |g volume:178 |
912 | |a GBV_USEFLAG_U | ||
912 | |a SYSFLAG_U | ||
912 | |a GBV_ELV | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_22 | ||
912 | |a GBV_ILN_23 | ||
912 | |a GBV_ILN_24 | ||
912 | |a GBV_ILN_31 | ||
912 | |a GBV_ILN_32 | ||
912 | |a GBV_ILN_40 | ||
912 | |a GBV_ILN_60 | ||
912 | |a GBV_ILN_62 | ||
912 | |a GBV_ILN_63 | ||
912 | |a GBV_ILN_65 | ||
912 | |a GBV_ILN_69 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_73 | ||
912 | |a GBV_ILN_74 | ||
912 | |a GBV_ILN_90 | ||
912 | |a GBV_ILN_95 | ||
912 | |a GBV_ILN_100 | ||
912 | |a GBV_ILN_101 | ||
912 | |a GBV_ILN_105 | ||
912 | |a GBV_ILN_110 | ||
912 | |a GBV_ILN_150 | ||
912 | |a GBV_ILN_151 | ||
912 | |a GBV_ILN_224 | ||
912 | |a GBV_ILN_370 | ||
912 | |a GBV_ILN_602 | ||
912 | |a GBV_ILN_702 | ||
912 | |a GBV_ILN_2003 | ||
912 | |a GBV_ILN_2004 | ||
912 | |a GBV_ILN_2005 | ||
912 | |a GBV_ILN_2006 | ||
912 | |a GBV_ILN_2008 | ||
912 | |a GBV_ILN_2010 | ||
912 | |a GBV_ILN_2011 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_2015 | ||
912 | |a GBV_ILN_2020 | ||
912 | |a GBV_ILN_2021 | ||
912 | |a GBV_ILN_2025 | ||
912 | |a GBV_ILN_2027 | ||
912 | |a GBV_ILN_2034 | ||
912 | |a GBV_ILN_2038 | ||
912 | |a GBV_ILN_2044 | ||
912 | |a GBV_ILN_2048 | ||
912 | |a GBV_ILN_2049 | ||
912 | |a GBV_ILN_2050 | ||
912 | |a GBV_ILN_2056 | ||
912 | |a GBV_ILN_2059 | ||
912 | |a GBV_ILN_2061 | ||
912 | |a GBV_ILN_2064 | ||
912 | |a GBV_ILN_2065 | ||
912 | |a GBV_ILN_2068 | ||
912 | |a GBV_ILN_2088 | ||
912 | |a GBV_ILN_2111 | ||
912 | |a GBV_ILN_2112 | ||
912 | |a GBV_ILN_2113 | ||
912 | |a GBV_ILN_2118 | ||
912 | |a GBV_ILN_2122 | ||
912 | |a GBV_ILN_2129 | ||
912 | |a GBV_ILN_2143 | ||
912 | |a GBV_ILN_2147 | ||
912 | |a GBV_ILN_2148 | ||
912 | |a GBV_ILN_2152 | ||
912 | |a GBV_ILN_2153 | ||
912 | |a GBV_ILN_2190 | ||
912 | |a GBV_ILN_2336 | ||
912 | |a GBV_ILN_2470 | ||
912 | |a GBV_ILN_2507 | ||
912 | |a GBV_ILN_2522 | ||
912 | |a GBV_ILN_4035 | ||
912 | |a GBV_ILN_4037 | ||
912 | |a GBV_ILN_4112 | ||
912 | |a GBV_ILN_4125 | ||
912 | |a GBV_ILN_4126 | ||
912 | |a GBV_ILN_4242 | ||
912 | |a GBV_ILN_4251 | ||
912 | |a GBV_ILN_4305 | ||
912 | |a GBV_ILN_4313 | ||
912 | |a GBV_ILN_4322 | ||
912 | |a GBV_ILN_4323 | ||
912 | |a GBV_ILN_4324 | ||
912 | |a GBV_ILN_4325 | ||
912 | |a GBV_ILN_4326 | ||
912 | |a GBV_ILN_4333 | ||
912 | |a GBV_ILN_4334 | ||
912 | |a GBV_ILN_4335 | ||
912 | |a GBV_ILN_4338 | ||
912 | |a GBV_ILN_4393 | ||
936 | b | k | |a 53.73 |j Nachrichtenübertragung |
951 | |a AR | ||
952 | |d 178 |
author_variant |
j h jh l l ll t s ts |
---|---|
matchkey_str |
hejinlilinnashuting:2020----:dietofnigsnprlensearywtflca |
hierarchy_sort_str |
2020 |
bklnumber |
53.73 |
publishDate |
2020 |
allfields |
10.1016/j.sigpro.2020.107795 doi (DE-627)ELV004797892 (ELSEVIER)S0165-1684(20)30339-X DE-627 ger DE-627 rda eng 004 000 DE-600 53.73 bkl He, Jin verfasserin (orcid)0000-0001-6929-6354 aut 2-D direction finding using parallel nested arrays with full co-array aperture extension 2020 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Sparse arrays, such as nested arrays, are able to resolve more sources than sensors because their difference co-arrays can provide O ( L 2 ) degrees-of-freedom (DOFs) with L physical sensors. Most of the existing nested array direction-finding algorithms apply the spatial smoothing technique to realize this DOFs enhancement. One shortcoming of this type of methods is the efficient co-array aperture is reduced in processing the spatial smoothing, resulting in the DOFs are not fully utilized. In this paper, we propose a new approach using two parallel linear nested arrays to contribute full DOFs for two-dimensional direction-finding. To exploit the entire DOFs, we perform the vectorization of multiple fourth-order cumulant matrices and take the average of their co-array covariance matrices, instead of the spatial smoothing of the vectorization of the data covariance matrix. Based on a well-posed identification analysis, we show that the proposed approach can identify the number of sources approximately three times than the algorithms using the spatial smoothing technique. For example, for a two-level parallel nested array of 2 + 2 sensors in each subarray, the maximum number of sources that can be resolved by the proposed approach is 32, whereas, for most of the existing algorithms, the number reduces to 10. Array signal processing direction finding nested array difference co-array Li, Linna verfasserin aut Shu, Ting verfasserin aut Enthalten in Signal processing Amsterdam [u.a.] : Elsevier, 1979 178 Online-Ressource (DE-627)265784166 (DE-600)1466346-6 (DE-576)074891022 nnns volume:178 GBV_USEFLAG_U SYSFLAG_U GBV_ELV GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2008 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 53.73 Nachrichtenübertragung AR 178 |
spelling |
10.1016/j.sigpro.2020.107795 doi (DE-627)ELV004797892 (ELSEVIER)S0165-1684(20)30339-X DE-627 ger DE-627 rda eng 004 000 DE-600 53.73 bkl He, Jin verfasserin (orcid)0000-0001-6929-6354 aut 2-D direction finding using parallel nested arrays with full co-array aperture extension 2020 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Sparse arrays, such as nested arrays, are able to resolve more sources than sensors because their difference co-arrays can provide O ( L 2 ) degrees-of-freedom (DOFs) with L physical sensors. Most of the existing nested array direction-finding algorithms apply the spatial smoothing technique to realize this DOFs enhancement. One shortcoming of this type of methods is the efficient co-array aperture is reduced in processing the spatial smoothing, resulting in the DOFs are not fully utilized. In this paper, we propose a new approach using two parallel linear nested arrays to contribute full DOFs for two-dimensional direction-finding. To exploit the entire DOFs, we perform the vectorization of multiple fourth-order cumulant matrices and take the average of their co-array covariance matrices, instead of the spatial smoothing of the vectorization of the data covariance matrix. Based on a well-posed identification analysis, we show that the proposed approach can identify the number of sources approximately three times than the algorithms using the spatial smoothing technique. For example, for a two-level parallel nested array of 2 + 2 sensors in each subarray, the maximum number of sources that can be resolved by the proposed approach is 32, whereas, for most of the existing algorithms, the number reduces to 10. Array signal processing direction finding nested array difference co-array Li, Linna verfasserin aut Shu, Ting verfasserin aut Enthalten in Signal processing Amsterdam [u.a.] : Elsevier, 1979 178 Online-Ressource (DE-627)265784166 (DE-600)1466346-6 (DE-576)074891022 nnns volume:178 GBV_USEFLAG_U SYSFLAG_U GBV_ELV GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2008 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 53.73 Nachrichtenübertragung AR 178 |
allfields_unstemmed |
10.1016/j.sigpro.2020.107795 doi (DE-627)ELV004797892 (ELSEVIER)S0165-1684(20)30339-X DE-627 ger DE-627 rda eng 004 000 DE-600 53.73 bkl He, Jin verfasserin (orcid)0000-0001-6929-6354 aut 2-D direction finding using parallel nested arrays with full co-array aperture extension 2020 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Sparse arrays, such as nested arrays, are able to resolve more sources than sensors because their difference co-arrays can provide O ( L 2 ) degrees-of-freedom (DOFs) with L physical sensors. Most of the existing nested array direction-finding algorithms apply the spatial smoothing technique to realize this DOFs enhancement. One shortcoming of this type of methods is the efficient co-array aperture is reduced in processing the spatial smoothing, resulting in the DOFs are not fully utilized. In this paper, we propose a new approach using two parallel linear nested arrays to contribute full DOFs for two-dimensional direction-finding. To exploit the entire DOFs, we perform the vectorization of multiple fourth-order cumulant matrices and take the average of their co-array covariance matrices, instead of the spatial smoothing of the vectorization of the data covariance matrix. Based on a well-posed identification analysis, we show that the proposed approach can identify the number of sources approximately three times than the algorithms using the spatial smoothing technique. For example, for a two-level parallel nested array of 2 + 2 sensors in each subarray, the maximum number of sources that can be resolved by the proposed approach is 32, whereas, for most of the existing algorithms, the number reduces to 10. Array signal processing direction finding nested array difference co-array Li, Linna verfasserin aut Shu, Ting verfasserin aut Enthalten in Signal processing Amsterdam [u.a.] : Elsevier, 1979 178 Online-Ressource (DE-627)265784166 (DE-600)1466346-6 (DE-576)074891022 nnns volume:178 GBV_USEFLAG_U SYSFLAG_U GBV_ELV GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2008 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 53.73 Nachrichtenübertragung AR 178 |
allfieldsGer |
10.1016/j.sigpro.2020.107795 doi (DE-627)ELV004797892 (ELSEVIER)S0165-1684(20)30339-X DE-627 ger DE-627 rda eng 004 000 DE-600 53.73 bkl He, Jin verfasserin (orcid)0000-0001-6929-6354 aut 2-D direction finding using parallel nested arrays with full co-array aperture extension 2020 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Sparse arrays, such as nested arrays, are able to resolve more sources than sensors because their difference co-arrays can provide O ( L 2 ) degrees-of-freedom (DOFs) with L physical sensors. Most of the existing nested array direction-finding algorithms apply the spatial smoothing technique to realize this DOFs enhancement. One shortcoming of this type of methods is the efficient co-array aperture is reduced in processing the spatial smoothing, resulting in the DOFs are not fully utilized. In this paper, we propose a new approach using two parallel linear nested arrays to contribute full DOFs for two-dimensional direction-finding. To exploit the entire DOFs, we perform the vectorization of multiple fourth-order cumulant matrices and take the average of their co-array covariance matrices, instead of the spatial smoothing of the vectorization of the data covariance matrix. Based on a well-posed identification analysis, we show that the proposed approach can identify the number of sources approximately three times than the algorithms using the spatial smoothing technique. For example, for a two-level parallel nested array of 2 + 2 sensors in each subarray, the maximum number of sources that can be resolved by the proposed approach is 32, whereas, for most of the existing algorithms, the number reduces to 10. Array signal processing direction finding nested array difference co-array Li, Linna verfasserin aut Shu, Ting verfasserin aut Enthalten in Signal processing Amsterdam [u.a.] : Elsevier, 1979 178 Online-Ressource (DE-627)265784166 (DE-600)1466346-6 (DE-576)074891022 nnns volume:178 GBV_USEFLAG_U SYSFLAG_U GBV_ELV GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2008 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 53.73 Nachrichtenübertragung AR 178 |
allfieldsSound |
10.1016/j.sigpro.2020.107795 doi (DE-627)ELV004797892 (ELSEVIER)S0165-1684(20)30339-X DE-627 ger DE-627 rda eng 004 000 DE-600 53.73 bkl He, Jin verfasserin (orcid)0000-0001-6929-6354 aut 2-D direction finding using parallel nested arrays with full co-array aperture extension 2020 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Sparse arrays, such as nested arrays, are able to resolve more sources than sensors because their difference co-arrays can provide O ( L 2 ) degrees-of-freedom (DOFs) with L physical sensors. Most of the existing nested array direction-finding algorithms apply the spatial smoothing technique to realize this DOFs enhancement. One shortcoming of this type of methods is the efficient co-array aperture is reduced in processing the spatial smoothing, resulting in the DOFs are not fully utilized. In this paper, we propose a new approach using two parallel linear nested arrays to contribute full DOFs for two-dimensional direction-finding. To exploit the entire DOFs, we perform the vectorization of multiple fourth-order cumulant matrices and take the average of their co-array covariance matrices, instead of the spatial smoothing of the vectorization of the data covariance matrix. Based on a well-posed identification analysis, we show that the proposed approach can identify the number of sources approximately three times than the algorithms using the spatial smoothing technique. For example, for a two-level parallel nested array of 2 + 2 sensors in each subarray, the maximum number of sources that can be resolved by the proposed approach is 32, whereas, for most of the existing algorithms, the number reduces to 10. Array signal processing direction finding nested array difference co-array Li, Linna verfasserin aut Shu, Ting verfasserin aut Enthalten in Signal processing Amsterdam [u.a.] : Elsevier, 1979 178 Online-Ressource (DE-627)265784166 (DE-600)1466346-6 (DE-576)074891022 nnns volume:178 GBV_USEFLAG_U SYSFLAG_U GBV_ELV GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2008 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 53.73 Nachrichtenübertragung AR 178 |
language |
English |
source |
Enthalten in Signal processing 178 volume:178 |
sourceStr |
Enthalten in Signal processing 178 volume:178 |
format_phy_str_mv |
Article |
bklname |
Nachrichtenübertragung |
institution |
findex.gbv.de |
topic_facet |
Array signal processing direction finding nested array difference co-array |
dewey-raw |
004 |
isfreeaccess_bool |
false |
container_title |
Signal processing |
authorswithroles_txt_mv |
He, Jin @@aut@@ Li, Linna @@aut@@ Shu, Ting @@aut@@ |
publishDateDaySort_date |
2020-01-01T00:00:00Z |
hierarchy_top_id |
265784166 |
dewey-sort |
14 |
id |
ELV004797892 |
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">ELV004797892</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230524164711.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230503s2020 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.sigpro.2020.107795</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV004797892</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0165-1684(20)30339-X</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">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">000</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">53.73</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">He, Jin</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0001-6929-6354</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">2-D direction finding using parallel nested arrays with full co-array aperture extension</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Sparse arrays, such as nested arrays, are able to resolve more sources than sensors because their difference co-arrays can provide O ( L 2 ) degrees-of-freedom (DOFs) with L physical sensors. Most of the existing nested array direction-finding algorithms apply the spatial smoothing technique to realize this DOFs enhancement. One shortcoming of this type of methods is the efficient co-array aperture is reduced in processing the spatial smoothing, resulting in the DOFs are not fully utilized. In this paper, we propose a new approach using two parallel linear nested arrays to contribute full DOFs for two-dimensional direction-finding. To exploit the entire DOFs, we perform the vectorization of multiple fourth-order cumulant matrices and take the average of their co-array covariance matrices, instead of the spatial smoothing of the vectorization of the data covariance matrix. Based on a well-posed identification analysis, we show that the proposed approach can identify the number of sources approximately three times than the algorithms using the spatial smoothing technique. For example, for a two-level parallel nested array of 2 + 2 sensors in each subarray, the maximum number of sources that can be resolved by the proposed approach is 32, whereas, for most of the existing algorithms, the number reduces to 10.</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">direction finding</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">nested array</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">difference co-array</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Li, Linna</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shu, Ting</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Signal processing</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier, 1979</subfield><subfield code="g">178</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)265784166</subfield><subfield code="w">(DE-600)1466346-6</subfield><subfield code="w">(DE-576)074891022</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:178</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</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_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">53.73</subfield><subfield code="j">Nachrichtenübertragung</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">178</subfield></datafield></record></collection>
|
author |
He, Jin |
spellingShingle |
He, Jin ddc 004 bkl 53.73 misc Array signal processing misc direction finding misc nested array misc difference co-array 2-D direction finding using parallel nested arrays with full co-array aperture extension |
authorStr |
He, Jin |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)265784166 |
format |
electronic Article |
dewey-ones |
004 - Data processing & computer science 000 - Computer science, information & general works |
delete_txt_mv |
keep |
author_role |
aut aut aut |
collection |
elsevier |
remote_str |
true |
illustrated |
Not Illustrated |
topic_title |
004 000 DE-600 53.73 bkl 2-D direction finding using parallel nested arrays with full co-array aperture extension Array signal processing direction finding nested array difference co-array |
topic |
ddc 004 bkl 53.73 misc Array signal processing misc direction finding misc nested array misc difference co-array |
topic_unstemmed |
ddc 004 bkl 53.73 misc Array signal processing misc direction finding misc nested array misc difference co-array |
topic_browse |
ddc 004 bkl 53.73 misc Array signal processing misc direction finding misc nested array misc difference co-array |
format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
cr |
hierarchy_parent_title |
Signal processing |
hierarchy_parent_id |
265784166 |
dewey-tens |
000 - Computer science, knowledge & systems |
hierarchy_top_title |
Signal processing |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)265784166 (DE-600)1466346-6 (DE-576)074891022 |
title |
2-D direction finding using parallel nested arrays with full co-array aperture extension |
ctrlnum |
(DE-627)ELV004797892 (ELSEVIER)S0165-1684(20)30339-X |
title_full |
2-D direction finding using parallel nested arrays with full co-array aperture extension |
author_sort |
He, Jin |
journal |
Signal processing |
journalStr |
Signal processing |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
000 - Computer science, information & general works |
recordtype |
marc |
publishDateSort |
2020 |
contenttype_str_mv |
zzz |
author_browse |
He, Jin Li, Linna Shu, Ting |
container_volume |
178 |
class |
004 000 DE-600 53.73 bkl |
format_se |
Elektronische Aufsätze |
author-letter |
He, Jin |
doi_str_mv |
10.1016/j.sigpro.2020.107795 |
normlink |
(ORCID)0000-0001-6929-6354 |
normlink_prefix_str_mv |
(orcid)0000-0001-6929-6354 |
dewey-full |
004 000 |
author2-role |
verfasserin |
title_sort |
2-d direction finding using parallel nested arrays with full co-array aperture extension |
title_auth |
2-D direction finding using parallel nested arrays with full co-array aperture extension |
abstract |
Sparse arrays, such as nested arrays, are able to resolve more sources than sensors because their difference co-arrays can provide O ( L 2 ) degrees-of-freedom (DOFs) with L physical sensors. Most of the existing nested array direction-finding algorithms apply the spatial smoothing technique to realize this DOFs enhancement. One shortcoming of this type of methods is the efficient co-array aperture is reduced in processing the spatial smoothing, resulting in the DOFs are not fully utilized. In this paper, we propose a new approach using two parallel linear nested arrays to contribute full DOFs for two-dimensional direction-finding. To exploit the entire DOFs, we perform the vectorization of multiple fourth-order cumulant matrices and take the average of their co-array covariance matrices, instead of the spatial smoothing of the vectorization of the data covariance matrix. Based on a well-posed identification analysis, we show that the proposed approach can identify the number of sources approximately three times than the algorithms using the spatial smoothing technique. For example, for a two-level parallel nested array of 2 + 2 sensors in each subarray, the maximum number of sources that can be resolved by the proposed approach is 32, whereas, for most of the existing algorithms, the number reduces to 10. |
abstractGer |
Sparse arrays, such as nested arrays, are able to resolve more sources than sensors because their difference co-arrays can provide O ( L 2 ) degrees-of-freedom (DOFs) with L physical sensors. Most of the existing nested array direction-finding algorithms apply the spatial smoothing technique to realize this DOFs enhancement. One shortcoming of this type of methods is the efficient co-array aperture is reduced in processing the spatial smoothing, resulting in the DOFs are not fully utilized. In this paper, we propose a new approach using two parallel linear nested arrays to contribute full DOFs for two-dimensional direction-finding. To exploit the entire DOFs, we perform the vectorization of multiple fourth-order cumulant matrices and take the average of their co-array covariance matrices, instead of the spatial smoothing of the vectorization of the data covariance matrix. Based on a well-posed identification analysis, we show that the proposed approach can identify the number of sources approximately three times than the algorithms using the spatial smoothing technique. For example, for a two-level parallel nested array of 2 + 2 sensors in each subarray, the maximum number of sources that can be resolved by the proposed approach is 32, whereas, for most of the existing algorithms, the number reduces to 10. |
abstract_unstemmed |
Sparse arrays, such as nested arrays, are able to resolve more sources than sensors because their difference co-arrays can provide O ( L 2 ) degrees-of-freedom (DOFs) with L physical sensors. Most of the existing nested array direction-finding algorithms apply the spatial smoothing technique to realize this DOFs enhancement. One shortcoming of this type of methods is the efficient co-array aperture is reduced in processing the spatial smoothing, resulting in the DOFs are not fully utilized. In this paper, we propose a new approach using two parallel linear nested arrays to contribute full DOFs for two-dimensional direction-finding. To exploit the entire DOFs, we perform the vectorization of multiple fourth-order cumulant matrices and take the average of their co-array covariance matrices, instead of the spatial smoothing of the vectorization of the data covariance matrix. Based on a well-posed identification analysis, we show that the proposed approach can identify the number of sources approximately three times than the algorithms using the spatial smoothing technique. For example, for a two-level parallel nested array of 2 + 2 sensors in each subarray, the maximum number of sources that can be resolved by the proposed approach is 32, whereas, for most of the existing algorithms, the number reduces to 10. |
collection_details |
GBV_USEFLAG_U SYSFLAG_U GBV_ELV GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_101 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2008 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 |
title_short |
2-D direction finding using parallel nested arrays with full co-array aperture extension |
remote_bool |
true |
author2 |
Li, Linna Shu, Ting |
author2Str |
Li, Linna Shu, Ting |
ppnlink |
265784166 |
mediatype_str_mv |
c |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1016/j.sigpro.2020.107795 |
up_date |
2024-07-07T00:10:59.553Z |
_version_ |
1803876889584992256 |
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">ELV004797892</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230524164711.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230503s2020 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.sigpro.2020.107795</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV004797892</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0165-1684(20)30339-X</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">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">000</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">53.73</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">He, Jin</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0001-6929-6354</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">2-D direction finding using parallel nested arrays with full co-array aperture extension</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Sparse arrays, such as nested arrays, are able to resolve more sources than sensors because their difference co-arrays can provide O ( L 2 ) degrees-of-freedom (DOFs) with L physical sensors. Most of the existing nested array direction-finding algorithms apply the spatial smoothing technique to realize this DOFs enhancement. One shortcoming of this type of methods is the efficient co-array aperture is reduced in processing the spatial smoothing, resulting in the DOFs are not fully utilized. In this paper, we propose a new approach using two parallel linear nested arrays to contribute full DOFs for two-dimensional direction-finding. To exploit the entire DOFs, we perform the vectorization of multiple fourth-order cumulant matrices and take the average of their co-array covariance matrices, instead of the spatial smoothing of the vectorization of the data covariance matrix. Based on a well-posed identification analysis, we show that the proposed approach can identify the number of sources approximately three times than the algorithms using the spatial smoothing technique. For example, for a two-level parallel nested array of 2 + 2 sensors in each subarray, the maximum number of sources that can be resolved by the proposed approach is 32, whereas, for most of the existing algorithms, the number reduces to 10.</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">direction finding</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">nested array</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">difference co-array</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Li, Linna</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shu, Ting</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Signal processing</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier, 1979</subfield><subfield code="g">178</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)265784166</subfield><subfield code="w">(DE-600)1466346-6</subfield><subfield code="w">(DE-576)074891022</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:178</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</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_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_101</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">53.73</subfield><subfield code="j">Nachrichtenübertragung</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">178</subfield></datafield></record></collection>
|
score |
7.3987026 |