Baobao Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Baobao Li has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Jianfeng Li
College of Electronic and Information Engineering and the Key Laboratory of Dynamic Cognitive System of Electromagnetic Spectrum Space, Ministry of Industry and Information Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, Jiangsu, China
4 shared publications - Xiaofei Zhang
College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China
3 shared publications Beizuo Zhu
College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China
1 shared publication- Gaofeng Zhao
College of Electronic Information Engineering
1 shared publication - Jinke Cao
College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China
1 shared publication - Mengxing Huang
School of Information and Communication Engineering, Hainan University, Haikou 570228, China
1 shared publication
Latest Publications
- Open Access
- 21 October 2022
- Published by Association for Computing Machinery (ACM)
- p. 1581-1586
Direct Position Determination using Distributed Unfold Coprime Arrays with Unknown Mutual Coupling: based on Reduced-Dimension Search
The direct position determination (DPD) approach has higher localization accuracy and better robustness than the classical two-step approach when localizing multiple sources with distributed antenna arrays. This paper focuses on the DPD algorithm using multiple Unfolded Coprime Arrays (UCAs) with unknown mutual coupling. To reduce the adverse effects of the mutual coupling, we first expand the unfolded coprime arrays into the DPD scenario. Subsequently, we introduce the HD-DPD-Capon algorithm, which fuses all inverse covariance matrices of distributed arrays, simultaneously searching for multiple unknown mutual coupling coefficients and source positions. Finally, in advance of the reduced-dimension search, we propose the RMCD-ICF algorithm, which only needs to search the two-dimension position, to reduce the high computational complexity of the HD-DPD-Capon algorithm caused by the high-dimensional search. Simulation results verify the superiority of the proposed algorithm on computation complexity and localization accuracy.
- 21 October 2022
- Published by Association for Computing Machinery (ACM)
- p. 1581-1586
Open AccessDirect Position Determination using Distributed Unfold Coprime Arrays with Unknown Mutual Coupling: based on Reduced-Dimension Search
The direct position determination (DPD) approach has higher localization accuracy and better robustness than the classical two-step approach when localizing multiple sources with distributed antenna arrays. This paper focuses on the DPD algorithm using multiple Unfolded Coprime Arrays (UCAs) with unknown mutual coupling. To reduce the adverse effects of the mutual coupling, we first expand the unfolded coprime arrays into the DPD scenario. Subsequently, we introduce the HD-DPD-Capon algorithm, which fuses all inverse covariance matrices of distributed arrays, simultaneously searching for multiple unknown mutual coupling coefficients and source positions. Finally, in advance of the reduced-dimension search, we propose the RMCD-ICF algorithm, which only needs to search the two-dimension position, to reduce the high computational complexity of the HD-DPD-Capon algorithm caused by the high-dimensional search. Simulation results verify the superiority of the proposed algorithm on computation complexity and localization accuracy.
- Open Access
- 5 May 2022
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 18 (5)
A reduced dimension multiple signal classification–based direct location algorithm with dense arrays
Aiming at the issue of parameter matching in conventional two-step location, a reduced dimension multiple signal classification direct position determination algorithm based on multi-array is proposed. Based on the idea of dimension reduction, the algorithm avoids multi-dimensional search in spatial domain and attenuation coefficient domain and reduces the search complexity. Simulation results show that the performance of the algorithm is better than the traditional angle of arrival two-step localization algorithm and subspace data fusion direct localization algorithm.
- 5 May 2022
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 18 (5)
Open AccessA reduced dimension multiple signal classification–based direct location algorithm with dense arrays
Aiming at the issue of parameter matching in conventional two-step location, a reduced dimension multiple signal classification direct position determination algorithm based on multi-array is proposed. Based on the idea of dimension reduction, the algorithm avoids multi-dimensional search in spatial domain and attenuation coefficient domain and reduces the search complexity. Simulation results show that the performance of the algorithm is better than the traditional angle of arrival two-step localization algorithm and subspace data fusion direct localization algorithm.
- 18 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 22 (11) , 10965-10973
Multiple Unknown Emitters Direct Tracking With Distributed Sensor Arrays: Non-Homogeneous Data Fusion and Fast Position Update
This paper considers the problem of multiple unknown emitters tracking based on distributed sensor arrays. The most common two-step methods firstly track the intermediate parameters and then solve emitter positions. However, the two-step methods are suboptimal as ignoring the matching information. In this paper, we introduce the novel thought of Direct Position Determination (DPD) to the tracking problem and propose the Non-homogeneous Data Fusion and Fast Position Update (NDFFPU) algorithm. Firstly, the NDFFPU algorithm adapts to tracking scenarios by reducing the weights of past data in autocorrelation estimation. Thereafter, the non-homogeneity error of received data is eliminated in the difference co-array domain, which reduces the sensitivity to observation position. Finally, the NDFFPU algorithm fuses all difference array data and performs the Newton iteration to update the emitter positions with high speed. The NDFFPU algorithm avoids the drawbacks of both the intermediate parameter estimation and the complex peak-searching. Extensive numerical simulations demonstrate the superiority of the NDFFPU algorithm in utilized array aperture, computational complexity, tracking accuracy, and robustness.
- 18 April 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 22 (11) , 10965-10973
Multiple Unknown Emitters Direct Tracking With Distributed Sensor Arrays: Non-Homogeneous Data Fusion and Fast Position Update
This paper considers the problem of multiple unknown emitters tracking based on distributed sensor arrays. The most common two-step methods firstly track the intermediate parameters and then solve emitter positions. However, the two-step methods are suboptimal as ignoring the matching information. In this paper, we introduce the novel thought of Direct Position Determination (DPD) to the tracking problem and propose the Non-homogeneous Data Fusion and Fast Position Update (NDFFPU) algorithm. Firstly, the NDFFPU algorithm adapts to tracking scenarios by reducing the weights of past data in autocorrelation estimation. Thereafter, the non-homogeneity error of received data is eliminated in the difference co-array domain, which reduces the sensitivity to observation position. Finally, the NDFFPU algorithm fuses all difference array data and performs the Newton iteration to update the emitter positions with high speed. The NDFFPU algorithm avoids the drawbacks of both the intermediate parameter estimation and the complex peak-searching. Extensive numerical simulations demonstrate the superiority of the NDFFPU algorithm in utilized array aperture, computational complexity, tracking accuracy, and robustness.
- Open Access
- 14 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (12) , 3843-3847
DOA Estimation of Non-Circular Source for Large Uniform Linear Array With a Single Snapshot: Extended DFT Method
This letter considers the direction of arrival (DOA) estimation of non-circular (NC) source using a large uniform linear array with a single snapshot. First, by utilizing the waveform characteristics of the NC signal, the proposed algorithm can enlarge the virtual array aperture that is twice the length of the physical array, and resultantly enhance DOA estimation accuracy. Moreover, by multiplying a correction matrix, the proposed algorithm can offset the NC phase error, thereby obtain further improved DOA estimation performance. Furthermore, the advocated algorithm can reduce the computation complexity by using the Newton-Raphson method instead of the traditional grid-search method. Finally, the numerical simulation results are provided to demonstrate the effectiveness and superiority of the proposed algorithm.
- 14 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (12) , 3843-3847
Open AccessDOA Estimation of Non-Circular Source for Large Uniform Linear Array With a Single Snapshot: Extended DFT Method
This letter considers the direction of arrival (DOA) estimation of non-circular (NC) source using a large uniform linear array with a single snapshot. First, by utilizing the waveform characteristics of the NC signal, the proposed algorithm can enlarge the virtual array aperture that is twice the length of the physical array, and resultantly enhance DOA estimation accuracy. Moreover, by multiplying a correction matrix, the proposed algorithm can offset the NC phase error, thereby obtain further improved DOA estimation performance. Furthermore, the advocated algorithm can reduce the computation complexity by using the Newton-Raphson method instead of the traditional grid-search method. Finally, the numerical simulation results are provided to demonstrate the effectiveness and superiority of the proposed algorithm.