Hailin Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hailin Li has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
Jianjiang Zhou
College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, No. 29 Jiangjun Avenue, 210016 Nanjing, China
6 shared publications- Jianjiang Zhou
Nanjing University of Aeronautics and Astronautics
4 shared publications Jie Sun
College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, No. 29 Jiangjun Avenue, 211100 Nanjing, China
4 shared publications- Yachao Jiang
College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, No. 29 Jiangjun Avenue, Nanjing 210016, China
4 shared publications Aihua Cao
Nanjing Univ Aeronaut & Astronaut, Coll Elect & Informat Engn, 29 Jiangjun Ave, Nanjing 211100, Jiangsu, Peoples R China
3 shared publicationsCan Jin
Nanjing Univ Aeronaut & Astronaut, Coll Elect & Informat Engn, 29 Jiangjun Ave, Nanjing 211100, Jiangsu, Peoples R China
3 shared publications
Latest Publications
- Open Access
- 15 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 101949-101958
A Multibeam Subarray Partition Design via Iterative Excitation Amplitude Tournament
The subarray-level multibeam structure is advantageous for minimizing system complexity and enhancing multi-target detection and estimation performance. Furthermore, the subarray configuration plays a major role in determining the multibeam antenna pattern parameters. Therefore, we propose a subarray partition technique based on the tournament algorithm to enable spatial multibeam synthesis. In this paper, subarray configuration and excitation are alternately optimized through multiple rounds of tournament iterations. Each iteration calculates subarray excitations using convex optimization methods to fulfill requirements for the main radiation direction and low sidelobes, among other performance criteria. At the same time, excitations for each unassigned array element are calculated within each subarray separately. Simulation results for linear arrays demonstrate the proposed algorithm is not only suitable for linear arrays but also applicable to other array configurations, such as circular ring arrays and cylindrical arrays. And the proposed algorithm is effective in subarray periodicity, suppressing sidelobe levels, and allocating resources based on priority.
- 15 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 101949-101958
Open AccessA Multibeam Subarray Partition Design via Iterative Excitation Amplitude Tournament
The subarray-level multibeam structure is advantageous for minimizing system complexity and enhancing multi-target detection and estimation performance. Furthermore, the subarray configuration plays a major role in determining the multibeam antenna pattern parameters. Therefore, we propose a subarray partition technique based on the tournament algorithm to enable spatial multibeam synthesis. In this paper, subarray configuration and excitation are alternately optimized through multiple rounds of tournament iterations. Each iteration calculates subarray excitations using convex optimization methods to fulfill requirements for the main radiation direction and low sidelobes, among other performance criteria. At the same time, excitations for each unassigned array element are calculated within each subarray separately. Simulation results for linear arrays demonstrate the proposed algorithm is not only suitable for linear arrays but also applicable to other array configurations, such as circular ring arrays and cylindrical arrays. And the proposed algorithm is effective in subarray periodicity, suppressing sidelobe levels, and allocating resources based on priority.
- Open Access
- 8 May 2023
- Published by Wiley in International Journal of RF and Microwave Computer-Aided Engineering
- Vol. 2023, 1-16
Multiband Pattern Synthesis of Time-Modulated Conformal Array with Quadratic Convex Optimization Algorithm
Aiming at the multiband pattern synthesis problem of time-modulated conformal array antenna, a quadratic convex optimization algorithm is proposed for sum and difference beamforming with low sidelobe levels. This articles method synthesizes a difference beam with a low sidelobe level by generating nulls at the center frequency band and optimizing the switch-on duration time of array elements. And the sum beamforming and sidelobe suppression of the first-order sideband are realized by optimizing the switch-on instant time of the array elements. The proposed algorithm has excellent properties of sidelobe suppression and angular sweep. The simulation results of circular and satellite array antenna verify the effectiveness of the algorithm.
- 8 May 2023
- Published by Wiley in International Journal of RF and Microwave Computer-Aided Engineering
- Vol. 2023, 1-16
Open AccessMultiband Pattern Synthesis of Time-Modulated Conformal Array with Quadratic Convex Optimization Algorithm
Aiming at the multiband pattern synthesis problem of time-modulated conformal array antenna, a quadratic convex optimization algorithm is proposed for sum and difference beamforming with low sidelobe levels. This articles method synthesizes a difference beam with a low sidelobe level by generating nulls at the center frequency band and optimizing the switch-on duration time of array elements. And the sum beamforming and sidelobe suppression of the first-order sideband are realized by optimizing the switch-on instant time of the array elements. The proposed algorithm has excellent properties of sidelobe suppression and angular sweep. The simulation results of circular and satellite array antenna verify the effectiveness of the algorithm.
- Open Access
- 13 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 57192-57200
Anti-Error Robust Pattern Synthesis Algorithm in Time-Modulated Array Antenna
Compared with the traditional antenna array, the time-modulated array can increase the flexibility of the array by adding time switches. However, due to the introduction of time switches, the time-modulated array antenna is more sensitive to random errors than the traditional array. Besides random errors caused by unavoidable factors such as array deformation and defects of processing and assembly in the traditional array, time-modulation parameter errors will be introduced by time switches. As errors in the traditional array can degrade the performance of the array, time-modulation parameter errors can lower the performance of the array pattern as well, which will lift the side-lobe and increase the dynamic range of the side-lobe. Aiming at the time-modulation parameter errors in the time-modulated array, an anti-error robust pattern synthesis algorithm (AERPS) based on the convex optimization (CVX) is proposed in this paper. In the algorithm, the optimization model for the pattern synthesis of the time-modulated array is established and analyzed. Then the model is divided into two sub-models of the center frequency and the first sideband, and the convex optimization solution is first performed on the center frequency model. After the center frequency model is solved, the convex optimization solution is used to solve the first-order sideband model to obtain the final results. The simulation results of the time-modulated array in this paper show that the algorithm can reduce the average value and the dynamic range of the normalized side-lobe level, thus verifying the effectiveness and the robustness of the algorithm.
- 13 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 57192-57200
Open AccessAnti-Error Robust Pattern Synthesis Algorithm in Time-Modulated Array Antenna
Compared with the traditional antenna array, the time-modulated array can increase the flexibility of the array by adding time switches. However, due to the introduction of time switches, the time-modulated array antenna is more sensitive to random errors than the traditional array. Besides random errors caused by unavoidable factors such as array deformation and defects of processing and assembly in the traditional array, time-modulation parameter errors will be introduced by time switches. As errors in the traditional array can degrade the performance of the array, time-modulation parameter errors can lower the performance of the array pattern as well, which will lift the side-lobe and increase the dynamic range of the side-lobe. Aiming at the time-modulation parameter errors in the time-modulated array, an anti-error robust pattern synthesis algorithm (AERPS) based on the convex optimization (CVX) is proposed in this paper. In the algorithm, the optimization model for the pattern synthesis of the time-modulated array is established and analyzed. Then the model is divided into two sub-models of the center frequency and the first sideband, and the convex optimization solution is first performed on the center frequency model. After the center frequency model is solved, the convex optimization solution is used to solve the first-order sideband model to obtain the final results. The simulation results of the time-modulated array in this paper show that the algorithm can reduce the average value and the dynamic range of the normalized side-lobe level, thus verifying the effectiveness and the robustness of the algorithm.
- Open Access
- 3 March 2021
- Published by Wiley in International Journal of Antennas and Propagation
- Vol. 2021, 1-11
Research on Multibeam Pattern Synthesis of Time Modulated Array Based on Convex Optimization
An efficient multibeam pattern synthesis method for time modulated array (TMA) is proposed in this paper. The aim of this method is to generate a beam pattern on the specified sideband of TMA. The pattern synthesis problem is divided into two stages. In the first stage, the sequential convex optimization method is used to suppress the sidelobe of the center frequency and reduce the amplitude dynamic range ratios (DRR). In the second stage, the iterative convex optimization method is used to realize the multibeam pattern synthesis in the sideband. Owing to the introduction of convex optimization, the proposed method could be more efficient than approaches using a global optimization algorithm. The proposed method is capable of realizing pattern synthesis under different DRR constraints and different beam radiation directions. Numerical examples of two beams and four beams patterns of 1000-element time modulated linear array verify the effectiveness of the proposed method.
- 3 March 2021
- Published by Wiley in International Journal of Antennas and Propagation
- Vol. 2021, 1-11
Open AccessResearch on Multibeam Pattern Synthesis of Time Modulated Array Based on Convex Optimization
An efficient multibeam pattern synthesis method for time modulated array (TMA) is proposed in this paper. The aim of this method is to generate a beam pattern on the specified sideband of TMA. The pattern synthesis problem is divided into two stages. In the first stage, the sequential convex optimization method is used to suppress the sidelobe of the center frequency and reduce the amplitude dynamic range ratios (DRR). In the second stage, the iterative convex optimization method is used to realize the multibeam pattern synthesis in the sideband. Owing to the introduction of convex optimization, the proposed method could be more efficient than approaches using a global optimization algorithm. The proposed method is capable of realizing pattern synthesis under different DRR constraints and different beam radiation directions. Numerical examples of two beams and four beams patterns of 1000-element time modulated linear array verify the effectiveness of the proposed method.
- Open Access
- 2 March 2021
- Published by Wiley in International Journal of Antennas and Propagation
- Vol. 2021, 1-9
A PSO-CVX Algorithm of Sum and Difference Beam Patterns for Time-Modulated Antenna Array
An integrated optimization of sum and difference beam for time-modulated linear antenna array is studied in this paper. The goal of sum and difference beam synthesis is to generate sum beam in the main band and difference beams in the first-order sideband with low side-lobe level through timing switches. The turn-on times of antenna array are achieved by solving a quadratic constraint linear programming; meanwhile, the opening times are optimized by particle swarm optimization algorithm. The results of linear array show that the sum and difference beam can be scanned within degrees, with lower peak side-lobe level.
- 2 March 2021
- Published by Wiley in International Journal of Antennas and Propagation
- Vol. 2021, 1-9
Open AccessA PSO-CVX Algorithm of Sum and Difference Beam Patterns for Time-Modulated Antenna Array
An integrated optimization of sum and difference beam for time-modulated linear antenna array is studied in this paper. The goal of sum and difference beam synthesis is to generate sum beam in the main band and difference beams in the first-order sideband with low side-lobe level through timing switches. The turn-on times of antenna array are achieved by solving a quadratic constraint linear programming; meanwhile, the opening times are optimized by particle swarm optimization algorithm. The results of linear array show that the sum and difference beam can be scanned within degrees, with lower peak side-lobe level.
- Open Access
- 1 January 2021
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
Research on Pattern Synthesis of Time Modulated Sparse Array Based on Discrete Variable Convex Optimization
Effective resource utilization is an important problem in the application of array, especially for the new time modulated array. Considering the problem of full utilization of array elements in time modulated array, a sparse optimization algorithm based on discrete variable convex optimization is proposed in this paper. The pattern optimization of equal excitation time modulation array is realized in two stages: In the first stage, the number of working array elements is as low as possible under the condition of suppressing the sidelobe of the central frequency. In the second stage, the sideband is suppressed by iterative convex optimization. The numerical simulation results are compared with other methods to verify the effectiveness of the proposed method in pattern optimization of equal excitation time modulation array. Finally, the optimization performance of the algorithm with different array parameters is verified.
- 1 January 2021
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
Open AccessResearch on Pattern Synthesis of Time Modulated Sparse Array Based on Discrete Variable Convex Optimization
Effective resource utilization is an important problem in the application of array, especially for the new time modulated array. Considering the problem of full utilization of array elements in time modulated array, a sparse optimization algorithm based on discrete variable convex optimization is proposed in this paper. The pattern optimization of equal excitation time modulation array is realized in two stages: In the first stage, the number of working array elements is as low as possible under the condition of suppressing the sidelobe of the central frequency. In the second stage, the sideband is suppressed by iterative convex optimization. The numerical simulation results are compared with other methods to verify the effectiveness of the proposed method in pattern optimization of equal excitation time modulation array. Finally, the optimization performance of the algorithm with different array parameters is verified.
- Open Access
- 14 April 2020
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2020, 1-15
Pattern Synthesis of Time-Modulated Sparse Array by an OPM-CVX Algorithm
This paper addresses the constrained multiobjective optimization problem of time-modulated sparse arrays. The synthesis objective is to find an optimal element arrangement and associated excitation strategy of sparse arrays, which realize the balance of radiation power and sideband suppression performance with minimum number of elements, and suppress side lobe level simultaneously. A novel hybrid algorithm based on orthogonal perturbation method and convex optimization (OPM-CVX) for the synthesis of time-modulated sparse antenna array is presented in this paper. In order to satisfy the main lobe beamforming and side lobe suppression of sparse arrays, the proposed method optimizes element positions with minimum array numbers by orthogonal perturbation method and optimizes excitations of array element with dynamic range ratio constraint by convex optimization. Furthermore, a trapezoidal pulse time-modulated switching function is proposed to find the balance of radiation power and sideband suppression performance. The numerical results indicate that the proposed algorithm can be an effective approach for synthesis problems of time-modulated sparse arrays.
- 14 April 2020
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2020, 1-15
Open AccessPattern Synthesis of Time-Modulated Sparse Array by an OPM-CVX Algorithm
This paper addresses the constrained multiobjective optimization problem of time-modulated sparse arrays. The synthesis objective is to find an optimal element arrangement and associated excitation strategy of sparse arrays, which realize the balance of radiation power and sideband suppression performance with minimum number of elements, and suppress side lobe level simultaneously. A novel hybrid algorithm based on orthogonal perturbation method and convex optimization (OPM-CVX) for the synthesis of time-modulated sparse antenna array is presented in this paper. In order to satisfy the main lobe beamforming and side lobe suppression of sparse arrays, the proposed method optimizes element positions with minimum array numbers by orthogonal perturbation method and optimizes excitations of array element with dynamic range ratio constraint by convex optimization. Furthermore, a trapezoidal pulse time-modulated switching function is proposed to find the balance of radiation power and sideband suppression performance. The numerical results indicate that the proposed algorithm can be an effective approach for synthesis problems of time-modulated sparse arrays.
- 22 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1
Component-based Feature Saliency for Clustering
Simultaneous feature selection and clustering is a major challenge in unsupervised learning. In particular, there has been significant research into saliency measures for features that result in good clustering. However, as datasets become larger and more complex, there is a need to adopt a finer-grained approach to saliency by measuring it in relation to a part of a model. Another issue is learning the feature saliency and advanced model parameters. We address the first by presenting a novel Gaussian mixture model, which explicitly models the dependency of individual mixture components on each feature giving a new component-based feature saliency measure. For the second, we use Markov Chain Monte Carlo sampling to estimate the model and hidden variables. Using a synthetic dataset, we demonstrate the superiority of our approach, in terms of clustering accuracy and model parameter estimation, over an approach using a model-based feature saliency with expectation maximisation. We performed an evaluation of our approach with six synthetic trajectory datasets. To demonstrate the generality of our approach, we applied it to a network traffic flow dataset for intrusion detection. Finally, we performed a comparison with state-of-the-art clustering techniques using three real-world trajectory datasets of vehicle traffic.
- 22 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1
Component-based Feature Saliency for Clustering
Simultaneous feature selection and clustering is a major challenge in unsupervised learning. In particular, there has been significant research into saliency measures for features that result in good clustering. However, as datasets become larger and more complex, there is a need to adopt a finer-grained approach to saliency by measuring it in relation to a part of a model. Another issue is learning the feature saliency and advanced model parameters. We address the first by presenting a novel Gaussian mixture model, which explicitly models the dependency of individual mixture components on each feature giving a new component-based feature saliency measure. For the second, we use Markov Chain Monte Carlo sampling to estimate the model and hidden variables. Using a synthetic dataset, we demonstrate the superiority of our approach, in terms of clustering accuracy and model parameter estimation, over an approach using a model-based feature saliency with expectation maximisation. We performed an evaluation of our approach with six synthetic trajectory datasets. To demonstrate the generality of our approach, we applied it to a network traffic flow dataset for intrusion detection. Finally, we performed a comparison with state-of-the-art clustering techniques using three real-world trajectory datasets of vehicle traffic.
- Open Access
- 7 August 2019
- Published by Wiley in International Journal of Antennas and Propagation
- Vol. 2019, 1-14
Research on Side Lobe Suppression of Time-Modulated Sparse Linear Array Based on Particle Swarm Optimization
An efficient pattern synthesis approach is proposed for the synthesis of a time-modulated sparse linear array (TMSLA) in this paper. Due to the introduction of time modulation, the low/ultralow side lobe level can be obtained with a low amplitude dynamic range ratio. Besides, it helps reduce the difficulty of antenna feeding system effectively. Based on particle swarm optimization (PSO) and convex (CVX) optimization, this paper proposes a hybrid optimization method to suppress the grating lobes of the sparse arrays, peak side lobe level (PSLL), and peak sideband level (PSBL). Firstly, the paper utilizes the CVX optimization as a local optimization algorithm to optimize the elements’ switch-on duration time, which reduces the side lobe of the array. Secondly, with the PSBL as the objective function, the paper adopts the PSO as a global optimization algorithm to optimize the elements’ positions and switch-on time instant, which helps reduce the loss of sideband power caused by time modulation. With respect to the time modulation model, variable aperture sizes (VAS) and more flexible pulse-shifting (PS) schemes are used in this paper. Owing to the introduction of time modulation and CVX optimization, the proposed method is much more feasible and efficient than conventional approaches. Furthermore, it has better array pattern synthesis performance. Numerical examples of the TMSLA and comparisons with the reference are presented to demonstrate the effectiveness of the proposed method.
- 7 August 2019
- Published by Wiley in International Journal of Antennas and Propagation
- Vol. 2019, 1-14
Open AccessResearch on Side Lobe Suppression of Time-Modulated Sparse Linear Array Based on Particle Swarm Optimization
An efficient pattern synthesis approach is proposed for the synthesis of a time-modulated sparse linear array (TMSLA) in this paper. Due to the introduction of time modulation, the low/ultralow side lobe level can be obtained with a low amplitude dynamic range ratio. Besides, it helps reduce the difficulty of antenna feeding system effectively. Based on particle swarm optimization (PSO) and convex (CVX) optimization, this paper proposes a hybrid optimization method to suppress the grating lobes of the sparse arrays, peak side lobe level (PSLL), and peak sideband level (PSBL). Firstly, the paper utilizes the CVX optimization as a local optimization algorithm to optimize the elements’ switch-on duration time, which reduces the side lobe of the array. Secondly, with the PSBL as the objective function, the paper adopts the PSO as a global optimization algorithm to optimize the elements’ positions and switch-on time instant, which helps reduce the loss of sideband power caused by time modulation. With respect to the time modulation model, variable aperture sizes (VAS) and more flexible pulse-shifting (PS) schemes are used in this paper. Owing to the introduction of time modulation and CVX optimization, the proposed method is much more feasible and efficient than conventional approaches. Furthermore, it has better array pattern synthesis performance. Numerical examples of the TMSLA and comparisons with the reference are presented to demonstrate the effectiveness of the proposed method.
- Open Access
- 23 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 77429-77439
Low-Sidelobe Pattern Synthesis for Sparse Conformal Arrays Based on PSO-SOCP Optimization
This paper addresses the constrained multi-objective optimization problem of sparse conformal arrays designing. The objective of array synthesis is to find an optimal element arrangement on a conformal surface and its associated excitation strategy, which generate the main radiation beam along a pre-selected spatial direction with maximum gain and, simultaneously, suppress sidelobe levels elsewhere. A hybrid algorithm PSO-SOCP, comprising of particle swarm optimization (PSO) and second-order cone programming (SOCP), each for a dedicated purpose, is proposed to fulfill this task in this paper. More specifically, the PSO algorithm is introduced to optimize sparse conformal array element positions, whereas the SOCP is applied to seek optimal excitation coefficients for each array layout obtained. After extensive simulation with the examples of sparse circular array and sparse conical arrays, we can find that our proposed method can synthesize better radiation patterns with regard to peak sidelobe levels, compared with those obtained through other traditional algorithms.
- 23 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 77429-77439
Open AccessLow-Sidelobe Pattern Synthesis for Sparse Conformal Arrays Based on PSO-SOCP Optimization
This paper addresses the constrained multi-objective optimization problem of sparse conformal arrays designing. The objective of array synthesis is to find an optimal element arrangement on a conformal surface and its associated excitation strategy, which generate the main radiation beam along a pre-selected spatial direction with maximum gain and, simultaneously, suppress sidelobe levels elsewhere. A hybrid algorithm PSO-SOCP, comprising of particle swarm optimization (PSO) and second-order cone programming (SOCP), each for a dedicated purpose, is proposed to fulfill this task in this paper. More specifically, the PSO algorithm is introduced to optimize sparse conformal array element positions, whereas the SOCP is applied to seek optimal excitation coefficients for each array layout obtained. After extensive simulation with the examples of sparse circular array and sparse conical arrays, we can find that our proposed method can synthesize better radiation patterns with regard to peak sidelobe levels, compared with those obtained through other traditional algorithms.