Yuxin Sun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yuxin Sun has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Xiaofei Zhang
College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China
2 shared publications - Xinlei Shi
Nantong University
2 shared publications - Hao Hu
College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics,Nanjing,China,211106
1 shared publication - Meng Yang
College of Electronic Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China
1 shared publication - Meng Yang
College of Electronic Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China
1 shared publication - Ming-Yi You
National Key Laboratory of Electromagnetic Space Security, No. 36 Research Institute of CETC, Jiaxing, China
1 shared publication
Latest Publications
- Open Access
Direct Position Determination of Non-Gaussian Sources for Multiple Nested Arrays: Discrete Fourier Transform and Taylor Compensation Algorithm
This paper delves into the problem of direct position determination (DPD) for non-Gaussian sources. Existing DPD algorithms are hindered by their high computational complexity from exhaustive grid searches and a disregard for the received signal characteristics by multiple nested arrays (MNAs). To address these issues, the paper proposes a novel DPD algorithm for non-Gaussian sources with MNAs: the Discrete Fourier Transform (DFT) and Taylor compensation algorithm. Initially, the fourth-order cumulant matrix of the received signal is computed, and the vectorizing method is applied. Subsequently, a computationally efficient DPD cost function is proposed by leveraging a normalized DFT matrix to reduce complexity. Finally, first-order Taylor compensation is utilized to enhance the accuracy of the localization results. The superiority of the proposed algorithm is demonstrated through numerical simulation results.
Open AccessDirect Position Determination of Non-Gaussian Sources for Multiple Nested Arrays: Discrete Fourier Transform and Taylor Compensation Algorithm
This paper delves into the problem of direct position determination (DPD) for non-Gaussian sources. Existing DPD algorithms are hindered by their high computational complexity from exhaustive grid searches and a disregard for the received signal characteristics by multiple nested arrays (MNAs). To address these issues, the paper proposes a novel DPD algorithm for non-Gaussian sources with MNAs: the Discrete Fourier Transform (DFT) and Taylor compensation algorithm. Initially, the fourth-order cumulant matrix of the received signal is computed, and the vectorizing method is applied. Subsequently, a computationally efficient DPD cost function is proposed by leveraging a normalized DFT matrix to reduce complexity. Finally, first-order Taylor compensation is utilized to enhance the accuracy of the localization results. The superiority of the proposed algorithm is demonstrated through numerical simulation results.
- 8 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 31 (10709908) , 256-260
Direct Position Determination of Non-Circular Signals for Distributed Antenna Arrays: Optimal Weight and Polynomial Rooting Approach
Direct position determination (DPD) approaches of non-circular (NC) signals for distributed antenna arrays are outstanding in location accuracy and available degrees of freedom. Nevertheless, the existing grid-based DPD approaches involve unnecessary computational costs because of NC phases. Besides, the cost function utilized in DPD could cause performance deterioration as ignoring the non-homogeneity error of the received data. To this end, we propose a DPD approach implemented by polynomial rooting and optimal weighting. Aiming to reduce computational costs, we first construct a computationally efficient cost function. Meanwhile, to mitigate the adverse impact induced by non-homogeneity errors in an effective manner, we assign an optimal weight to each antenna array. Simulation results demonstrate that the proposed approach achieves a good compromise between performance and computational complexity.
- 8 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 31 (10709908) , 256-260
Direct Position Determination of Non-Circular Signals for Distributed Antenna Arrays: Optimal Weight and Polynomial Rooting Approach
Direct position determination (DPD) approaches of non-circular (NC) signals for distributed antenna arrays are outstanding in location accuracy and available degrees of freedom. Nevertheless, the existing grid-based DPD approaches involve unnecessary computational costs because of NC phases. Besides, the cost function utilized in DPD could cause performance deterioration as ignoring the non-homogeneity error of the received data. To this end, we propose a DPD approach implemented by polynomial rooting and optimal weighting. Aiming to reduce computational costs, we first construct a computationally efficient cost function. Meanwhile, to mitigate the adverse impact induced by non-homogeneity errors in an effective manner, we assign an optimal weight to each antenna array. Simulation results demonstrate that the proposed approach achieves a good compromise between performance and computational complexity.
- Open Access
An Enhanced Spatial Smoothing Technique of Coherent DOA Estimation with Moving Coprime Array
This paper investigates the direction of arrival (DOA) estimation of coherent signals with a moving coprime array (MCA). Spatial smoothing techniques are often used to deal with the covariance matrix of coherent signals, but they cannot be used in sparse arrays. Therefore, super-resolution algorithms such as multiple signal classification (MUSIC) cannot be applied in the DOA estimation of coherent signals in sparse arrays. In this study, we propose an enhanced spatial smoothing method specifically designed for MCA. Firstly, we combine the signals received by the MCA at different times, which can be regarded as a sparse array with a larger number of array sensors. Secondly, we describe how to compute the covariance matrix, derive the signal subspace by eigenvalue decomposition, and prove that the signal subspace is also equivalent to a received signal. Thirdly, we apply enhanced spatial smoothing to the signal subspace and construct a rank recovered covariance matrix. Finally, the DOA of coherent signals are well estimated by the MUSIC algorithm. The simulation results validate the improved performance of the proposed algorithm compared with traditional methods, particularly in scenarios with low signal-to-noise ratios.
Open AccessAn Enhanced Spatial Smoothing Technique of Coherent DOA Estimation with Moving Coprime Array
This paper investigates the direction of arrival (DOA) estimation of coherent signals with a moving coprime array (MCA). Spatial smoothing techniques are often used to deal with the covariance matrix of coherent signals, but they cannot be used in sparse arrays. Therefore, super-resolution algorithms such as multiple signal classification (MUSIC) cannot be applied in the DOA estimation of coherent signals in sparse arrays. In this study, we propose an enhanced spatial smoothing method specifically designed for MCA. Firstly, we combine the signals received by the MCA at different times, which can be regarded as a sparse array with a larger number of array sensors. Secondly, we describe how to compute the covariance matrix, derive the signal subspace by eigenvalue decomposition, and prove that the signal subspace is also equivalent to a received signal. Thirdly, we apply enhanced spatial smoothing to the signal subspace and construct a rank recovered covariance matrix. Finally, the DOA of coherent signals are well estimated by the MUSIC algorithm. The simulation results validate the improved performance of the proposed algorithm compared with traditional methods, particularly in scenarios with low signal-to-noise ratios.