In order to solve the problem of coherent signal subspace method (CSSM) depending on the estimated accuracy of signal subspace, a new direction of arrival (DOA) estimation method of wideband source, which is based on iterative adaptive spectral reconstruction, is proposed. Firstly, the wideband signals are divided into several narrowband signals of different frequency bins by discrete Fourier transformation (DFT). Then, the signal matched power spectrum in referenced frequency bins is computed, which can form the initial covariance matrix. Finally, the linear restrained minimum variance spectral (Capon spectral) of signals in other frequency bins are reconstructed using sequential iterative means, so the DOA can be estimated by the locations of spectral peaks. Theoretical analysis and simulation results show the proposed method based on the iterative spectral reconstruction for the covariance matrices of all sub-bands can avoid the problem of determining the signal subspace accurately with the coherent signal subspace method under the conditions of small samples and low signal to noise ratio (SNR), and it can also realize full dimensional focusing of different sub-band data, which can be applied to coherent sources and can significantly improve the accuracy of DOA estimation. 

A mathematical model to determine the optimal production lot size for a deteriorating production system under an extended product inspection policy is developed. The last-K product inspection policy is considered so that the nonconforming items can be reduced, under which the last K products in a production lot are inspected and the nonconforming items from those inspected are reworked. Consider that the products produced towards the end of a production lot are more likely to be nonconforming, is proposed an extended product inspection policy for a deteriorating production system. That is, in a production lot, product inspections are performed among the middle K1 items and after inspections, all of the last K2 products are directly reworked without inspections. Our objective here is the joint optimization of the production lot size and the corresponding extended inspection policy such that the expected total cost per unit time is minimized. Since there is no closed form expression for our optimal policy, the existence for the optimal production inspection policy and an upper bound for the optimal lot size are obtained. Furthermore, an efficient solution procedure is provided to search for the optimal policy. Finally, numerical examples are given to illustrate the proposed model and indicate that the expected total cost per unit time of our product inspection model is less than that of the last-K inspection policy.

The earth observation satellites (EOSs) scheduling problem for emergency tasks often presents many challenges. For example, the scheduling calculation should be completed in seconds, the scheduled task rate is supposed to be as high as possible, the disturbance measure of the scheme should be as low as possible, which may lead to the loss of important observation opportunities and data transmission delays. Existing scheduling algorithms are not designed for these requirements. Consequently, we propose a rolling horizon strategy (RHS) based on event triggering as well as a heuristic algorithm based on direct insertion, shifting, backtracking, deletion, and reinsertion (ISBDR). In the RHS, the driven scheduling mode based on the emergency task arrival and control station time window events are designed to transform the long-term, large-scale problem into a short-term, small-scale problem, which can improve the schedulability of the original scheduling scheme and emergency response sensiti-vity. In the ISBDR algorithm, the shifting rule with breadth search capability and backtracking rule with depth search capability are established to realize the rapid adjustment of the original plan and improve the overall benefit of the plan and early completion of emergency tasks. Simultaneously, two heuristic factors, namely the emergency task urgency degree and task conflict degree, are constructed to improve the emergency task scheduling guidance and algorithm efficiency. Finally, we conduct extensive experiments by means of simulations to compare the algorithms based on ISBDR and direct insertion, shifting, deletion, and reinsertion (ISDR). The results demonstrate that the proposed algorithm can improve the timeliness of emergency tasks and scheduling performance, and decrease the disturbance measure of the scheme, therefore, it is more suitable for emergency task scheduling.

This paper investigates the distributed continuous-time aggregative optimization problem for second-order multi-agent systems, where the local cost function is not only related to its own decision variables, but also to the aggregation of the decision variables of all the agents. By using the gradient descent method, the distributed average tracking (DAT) technique and the time-base generator (TBG) technique, a distributed continuous-time aggregative optimization algorithm is proposed. Subsequently, the optimality of the system’s equilibrium point is analyzed, and the convergence of the closed-loop system is proved using the Lyapunov stability theory. Finally, the effectiveness of the proposed algorithm is validated through case studies on multirobot systems and power generation systems.

Finding the intersection of two subspaces is of great interest in many fields of signal processing. Over several decades, there have been numerous formulas discovered to solve this problem, among which the alternate projection method (APM) is the most popular one. However, APM suffers from high computational complexity, especially for real-time applications. Moreover, APM only gives the projection instead of the orthogonal basis of two given subspaces. This paper presents two alternate algorithms which have a closed form and reduced complexity as compared to the APM technique. Numerical simulations are conducted to verify the correctness and the effectiveness of the proposed methods.

A novel multi-view 3D face registration method based on principal axis analysis and labeled regions orientation called local orientation registration is proposed. The pre-registration is achieved by transforming the multi-pose models to the standard frontal model’s reference frame using the principal axis analysis algorithm. Some significant feature regions, such as inner and outer canthus, nose tip vertices, are then located by using geometrical distribution characteristics. These regions are subsequently employed to compute the conversion parameters using the improved iterative closest point algorithm, and the optimal parameters are applied to complete the final registration. Experimental results implemented on the proper database demonstrate that the proposed method significantly outperforms others by achieving 1.249 and 1.910 mean root-mean-square measure with slight and large view variation models, respectively.

Total variation (TV) is widely applied in image processing. The assumption of TV is that an image consists of piecewise constants, however, it suffers from the so-called staircase effect. In order to reduce the staircase effect and preserve the edges when textures of image are extracted, a new image decomposition model is proposed in this paper. The proposed model is based on the total generalized variation method which involves and balances the higher order of the structure. We also derive a numerical algorithm based on a primal-dual formulation that can be effectively implemented. Numerical experiments show that the proposed method
can achieve a better trade-off between noise removal and texture extraction, while avoiding the staircase effect efficiently.

The theory of compressed sensing (CS) provides a new chance to reduce the data acquisition time and improve the data usage factor of the stepped frequency radar system. In light of the sparsity of radar target reflectivity, two imaging methods based on CS, termed the CS-based 2D joint imaging algorithm and the CS-based 2D decoupled imaging algorithm, are proposed. These methods incorporate the coherent mixing operation into the sparse dictionary, and take random measurements in both range and azimuth directions to get high resolution radar images, thus can remarkably reduce the data rate and simplify the hardware design of the radar system while maintaining imaging quality. Experimentsfrom both simulated data and measured data in the anechoic chamber show that the proposed imaging methods can get more focused images than the traditional fast Fourier transform method. Wherein the joint algorithm has stronger robustness and can provide clearer inverse synthetic aperture radar images, while the decoupled algorithm is computationally more efficient but has slightly degraded imaging quality, which can be improved by increasing measurements or using a robuster recovery algorithm nevertheless

The Ocean 4A scatterometer, expected to be launched in 2024, is poised to be the world’s first spaceborne microwave scatterometer utilizing a digital beamforming system. To ensure high-precision measurements and performance stability across diverse environments, stringent requirements are placed on the dynamic range of its receiving system. This paper provides a detailed exposition of a field-programmable gate array (FPGA)-based automatic gain control (AGC) design for the spaceborne scatterometer. Implemented on an FPGA, the algorithm harnesses its parallel processing capabilities and high-speed performance to monitor the received echo signals in real time. Employing an adaptive AGC algorithm, the system generates gain control codes applicable to the intermediate frequency variable attenuator, enabling rapid and stable adjustment of signal amplitudes from the intermediate frequency amplifier to an optimal range. By adopting a purely digital processing approach, experimental results demonstrate that the AGC algorithm exhibits several advantages, including fast convergence, strong flexibility, high precision, and outstanding stability. This innovative design lays a solid foundation for the high-precision measurements of the Ocean 4A scatterometer, with potential implications for the future of spaceborne microwave scatterometers.

Traditional inverse synthetic aperture radar (ISAR) imaging methods for maneuvering targets have low resolution and poor capability of noise suppression. An ISAR imaging method of maneuvering targets based on phase retrieval is proposed, which can provide a high-resolution and focused map of the spatial distribution of scatterers on the target. According to theoretical derivation, the modulus of raw data from the maneuvering target is not affected by radial motion components for ISAR imaging system, so the phase retrieval algorithm can be used for ISAR imaging problems. However, the traditional phase retrieval algorithm will be not applicable to ISAR imaging under the condition of random noise. To solve this problem, an algorithm is put forward based on the range Doppler (RD) algorithm and oversampling smoothness (OSS) phase retrieval algorithm. The algorithm captures the target information in order to reduce the influence of the random phase on ISAR echoes, and then applies OSS for focusing imaging based on prior information of the RD algorithm. The simulated results demonstrate the validity of this algorithm, which cannot only obtain high resolution imaging for high speed maneuvering targets under the condition of random noise, but also substantially improve the success rate of the phase retrieval algorithm.

In order to efficiently mitigate error propagation and reduce computational complexity, this paper proposes a scheme for traditional cooperative networks, named as dual-threshold symbol selective demodulate-and-forward. In the scheme, two log likelihood ratio (LLR)-based thresholds are devised to measure the reliability of received signals for the relay and the destination, respectively. One of the threshold guarantees that the relay only forwards reliable symbols, thus less error will be propagated to the destination. The other threshold is used at the destination for determining the reliability of symbols received from the source. The destination will directly demodulate reliable symbols received from the source. Otherwise, when the symbols received from the source are not reliable, the maximum ratio combiner (MRC) is used to combine symbols received from the source and the relay. Closed-form expression of the bit error probability (BEP) of the proposed scheme is derived and analyzed under binary phase shift keying (BPSK) modulation. Then, the relationship and closed-form solutions of two LLR-based thresholds are derived. Simulation results prove that the theoretical BEP of the proposed scheme closely matches the simulated ones. The proposed scheme can achieve high performance with low computational complexity compared to existing schemes.

Formation control of multiple spacecraft has attracted extensive research attention. However, achieving reliable performance under sensor failures remains a significant challenge. This paper develops an integrated framework that jointly designs distributed observers and local controllers to ensure robust formation control in the presence of external disturbances and sensor malfunctions. Treating the spacecraft formation as a single interconnected system, each spacecraft constructs a distributed observer that estimates the overall system state by incorporating both its own measurements and the predicted control information shared among the spacecraft. Based on the observer estimates, a local control law is synthesized to maintain the desired formation. Rigorous theoretical analysis and numerical simulations demonstrate that the proposed integrated approach effectively guarantees formation stability and resilience against sensor failures and disturbances.

It is unpractical to learn the optimal structure of a big Bayesian network (BN) by exhausting the feasible structures, since the number of feasible structures is super exponential on the number of nodes. This paper proposes an approach to layer nodes of a BN by using the conditional independence testing. The parents of a node layer only belong to the layer, or layers who have priority over the layer. When a set of nodes has been layered, the number of feasible structures over the nodes can be remarkably reduced, which makes it possible to learn optimal BN structures for bigger sizes of nodes by accurate algorithms. Integrating the dynamic programming (DP) algorithm with the layering approach, we propose a hybrid algorithm—layered optimal learning (LOL) to learn BN structures. Benefitted by the layering approach, the complexity of the DP algorithm reduces to O(ρ2^n-1) from O(n2^n-1), where ρ < n. Meanwhile, the memory requirements for storing intermediate results are limited to $O(C_{k^\# }^{{{k^\# } \over 2}})$ from $O(C_n^{{n \over 2}} )$, where k^# < n. A case study on learning a standard BN with 50 nodes is conducted. The results demonstrate the superiority of the LOL algorithm, with respect to the Bayesian information criterion (BIC) score criterion, over the hill-climbing, max-min hill-climbing, PC, and three-phrase dependency analysis algorithms.

Traditional multi-band frequency selective surface (FSS) approaches are hard to achieve a perfect resonance response in a wide band due to the limit of the onset grating lobe frequency determined by the array. To solve this problem, an approach of combining elements in different period to build a hybrid array is presented. The results of series of numerical simulation show that multi-periodicity combined element FSS, which are designed using this approach, usually have much weaker grating lobes than the traditional FSS. Furthermore, their frequency response can be well predicted through the properties of their member element FSS. A prediction method for estimating the degree of expected grating lobe energy loss in designing multi-band FSS using this approach is provided.

In order to improve the autonomous ability of unmanned aerial vehicles (UAV) to implement air combat mission, many artificial intelligence-based autonomous air combat maneuver decision-making studies have been carried out, but these studies are often aimed at individual decision-making in 1v1 scenarios which rarely happen in actual air combat. Based on the research of the 1v1 autonomous air combat maneuver decision, this paper builds a multi-UAV cooperative air combat maneuver decision model based on multi-agent reinforcement learning. Firstly, a bidirectional recurrent neural network (BRNN) is used to achieve communication between UAV individuals, and the multi-UAV cooperative air combat maneuver decision model under the actor-critic architecture is established. Secondly, through combining with target allocation and air combat situation assessment, the tactical goal of the formation is merged with the reinforcement learning goal of every UAV, and a cooperative tactical maneuver policy is generated. The simulation results prove that the multi-UAV cooperative air combat maneuver decision model established in this paper can obtain the cooperative maneuver policy through reinforcement learning, the cooperative maneuver policy can guide UAVs to obtain the overall situational advantage and defeat the opponents under tactical cooperation.

Complex systems widely exist in nature and human society. There are complex interactions between system elements in a complex system, and systems show complex features at the macro level, such as emergence, self-organization, uncertainty, and dynamics. These complex features make it difficult to understand the internal operation mechanism of complex systems. Networked modeling of complex systems is a favorable means of understanding complex systems. It not only represents complex interactions but also reflects essential attributes of complex systems. This paper summarizes the research progress of complex systems modeling and analysis from the perspective of network science, including networked modeling, vital node analysis, network invulnerability analysis, network disintegration analysis, resilience analysis, complex network link prediction, and the attacker-defender game in complex networks. In addition, this paper presents some points of view on the trend and focus of future research on network analysis of complex systems.

Cloud manufacturing is a specific implementation form of the "Internet + manufacturing" strategy. Why and how to develop cloud manufacturing platform (CMP), however, remains the key concern of both platform operators and users. A microscopic model is proposed to investigate advantages and diffusion forces of CMP through exploration of its diffusion process and mechanism. Specifically, a three-stage basic evolution process of CMP is innovatively proposed. Then, based on this basic process, a more complex CMP evolution model has been established in virtue of complex network theory, with five diffusion forces identified. Thereafter, simulations on CMP diffusion have been conducted. The results indicate that, CMP possesses better resource utilization, user satisfaction, and enterprise utility. Results of simulation on impacts of different diffusion forces show that both the time required for CMP to reach an equilibrium state and the final network size are affected simultaneously by the five diffusion forces. All these analyses indicate that CMP could create an open online cooperation environment and turns out to be an effective implementation of the "Internet + manufacturing" strategy.

The problem of scheduling radar dwells in multifunction phased array radar systems is addressed. A novel dwell scheduling algorithm is proposed. The whole scheduling process is based on an online pulse interleaving technique. It takes the system timing and energy constraints into account. In order to adapt the dynamic task load, the algorithm considers both the priorities and deadlines of tasks.  The simulation results demonstrate that compared with the conventional adaptive dwell scheduling algorithm, the proposed one can improve the task drop rate and system resource utility effectively.

Bird’s-eye-view (BEV) perception is a core technology for autonomous driving systems. However, existing solutions face the dilemma of high costs associated with multi-modal methods and limited performance of vision-only approaches. To address this issue, this paper proposes a framework named “a lightweight pure visual BEV perception method based on dual distillation of spatial-temporal knowledge”. This framework innovatively designs a lightweight vision-only student model based on ResNet, which leverages a dual distillation mechanism to learn from a powerful teacher model that integrates temporal information from both image and light detection and ranging (LiDAR) modalities. Specifically, we distill efficient multi-modal feature extraction and spatial fusion capabilities from the BEVFusion model, and distill advanced temporal information fusion and spatiotemporal attention mechanisms from the BEVFormer model. This dual distillation strategy enables the student model to achieve perception performance close to that of multi-modal models without relying on LiDAR. Experimental results on the nuScenes dataset demonstrate that the proposed model significantly outperforms classical vision-only algorithms, achieves comparable performance to current state-of-the-art vision-only methods on the nuScenes detection leaderboard in terms of both mean average precision (mAP) and the nuScenes detection score (NDS) metrics, and exhibits notable advantages in inference computational efficiency. Although the proposed dual-teacher paradigm incurs higher offline training costs compared to single-model approaches, it yields a streamlined and highly efficient student model suitable for resource-constrained real-time deployment. This provides an effective pathway toward low-cost, high-performance autonomous driving perception systems.

The consensus problem of the distributed attitude synchronization in the spacecraft formation flying is considered. Firstly, the attitude dynamics of a rigid body spacecraft is described by modified Rodriguez parameters (MRPs). Then global stable distributed cooperative attitude control laws are proposed for different cases. In the first case, the control law guarantees the state consensus during the attitude synchronization. In the second case, the control law ensures both the attitudes synchronizing to a desired constant attitude and the angular velocities converging at zero. In the third case, an attitude consensus control law with bounded control input is proposed. Finally, the effectiveness and validity of the control laws are demonstrated by simulations of six rigid bodies formation flying.

This paper proposes a parallel cyclic shift structure of address decoder to realize a high-throughput encoding and decoding method for irregular-quasi-cyclic low-density parity-check (IR-QC-LDPC) codes, with a dual-diagonal parity structure. A normalized min-sum algorithm (NMSA) is employed for decoding. The whole verification of the encoding and decoding algorithm is simulated with Matlab, and the code rates of 5/6 and 2/3 are selected respectively for the initial bit error ratio as 6% and 1.04%. Based on the results of simulation, multi-code rates are compatible with different basis matrices. Then the simulated algorithms of encoder and decoder are migrated and implemented on the field programmable gate array (FPGA). The 183.36 Mbps throughput of encoder and the average 27.85 Mbps decoding throughput with the initial bit error ratio 6% are realized based on FPGA.

Redundant technology plays an important role in improving the reliability and fault-tolerance of the airborne avionics systems. A Markov state transition model is introduced to the reliability analysis of the redundant inertial navigation system (RINS) in airborne navigation systems. An information processing mechanism based on difference filtering is put forward to strengthen the consistency between the outputs of the equal-precision inertial navigation system (INS). On this basis, the homologous fault monitoring algorithm is designed to realize the homologous fault monitoring of RINS. The simulation is carried out based on the above algorithms, and the results verify the effectiveness of the proposed fault monitoring algorithm based on difference filtering. Research results have good reference value for the configuration and design of RINS in airborne integrated avionics systems.

Numerous works prove that existing neighbor-averaging graph neural networks (GNNs) cannot efficiently catch structure features, and many works show that injecting structure, distance, position, or spatial features can significantly improve the performance of GNNs, however, injecting high-level structure and distance into GNNs is an intuitive but untouched idea. This work sheds light on this issue and proposes a scheme to enhance graph attention networks (GATs) by encoding distance and hop-wise structure statistics. Firstly, the hop-wise structure and distributional distance information are extracted based on several hop-wise ego-nets of every target node. Secondly, the derived structure information, distance information, and intrinsic features are encoded into the same vector space and then added together to get initial embedding vectors. Thirdly, the derived embedding vectors are fed into GATs, such as GAT and adaptive graph diffusion network (AGDN) to get the soft labels. Fourthly, the soft labels are fed into correct and smooth (C&S) to conduct label propagation and get final predictions. Experiments show that the distance and hop-wise structures encoding enhanced graph attention networks (DHSEGATs) achieve a competitive result.

Intuitionistic trapezoidal fuzzy numbers and their operational laws are defined. Based on these operational laws, some aggregation operators, including intuitionistic trapezoidal fuzzy weighted arithmetic averaging operator and weighted geometric averaging operator are proposed. Expected values, score function, and accuracy function of intuitionitsic trapezoidal fuzzy numbers are defined. Based on these, a kind of intuitionistic trapezoidal fuzzy multi-criteria decision making method is proposed. By using these aggregation operators, criteria values are aggregated and integrated intuitionistic trapezoidal fuzzy numbers of alternatives are attained. By comparing score function and accuracy function values of integrated fuzzy numbers, a ranking of the whole alternative set can be attained. An example is given to show the feasibility and availability of the method.

With the development of global position system (GPS), wireless technology and location aware services, it is possible to collect a large quantity of trajectory data. In the field of data mining for moving objects, the problem of anomaly detection is a hot topic. Based on the development of anomalous trajectory detection of moving objects, this paper introduces the classical trajectory outlier detection (TRAOD) algorithm, and then proposes a density-based trajectory outlier detection (DBTOD) algorithm, which compensates the disadvantages of the TRAOD algorithm that it is unable to detect anomalous defects when the trajectory is local and dense. The results of employing the proposed algorithm to Elk1993 and Deer1995 datasets are also presented, which show the effectiveness of the algorithm.

This paper addresses the problem of suppression of the integrated air defense system (IADS) by multiple fighters' cooperation. Considering the dynamic changing of the number of the nodes in the operational process, a profit model for the influence of the mission's cost for the whole system is developed for both offense and defensive sides. The scenario analysis is given for the process of suppressing the IADS by multiple fighters. Based on this scenario analysis, the modeling method and the specific expression for the payoff function are proposed in four cases for each node. Moreover, a distributed virtual learning algorithm is designed for the n-person and n-strategy game, and the mixed strategy Nash equilibrium (MSNE) of this game can be solved from the n×m×3-dimensional profit space. Finally, the simulation examples are provided to demonstrate the effectiveness of the proposed model and the game algorithm.

For multi-agent reinforcement learning in Markov games, knowledge extraction and sharing are key research problems. State list extracting means to calculate the optimal shared state path from state trajectories with cycles. A state list extracting algorithm checks cyclic state lists of a current state in the state trajectory, condensing the optimal action set of the current state. By reinforcing the optimal action selected, the action policy of cyclic states is optimized gradually. The state list extracting is repeatedly learned and used as the experience knowledge which is shared by teams. Agents speed up the rate of convergence by experience sharing. Competition games of preys and predators are used for the experiments. The results of experiments prove that the proposed algorithms overcome the lack of experience in the initial stage, speed up learning and improve the performance.

The development processes and the application achievements of space-borne microwave sounder prelaunch calibration technologies in China are introduced briefly. Then, the general project plan for pre-launch calibration, the latest research achievements on the optimization and development of the microwave wide band calibration targets, emissivity measurement technologies and the system level uncertainty analysis of the laboratory, and the thermal/vacuum microwave sounder calibration system for “FY-3” meteorological satellite are reported, respectively. Finally, the key technological problems of the calibration technologies under researching are analyzed predictively.

A proper weapon system is very important for a national defense system. Generally, it means selecting the optimal weapon system among many alternatives, which is a multipleattribute decision making (MADM) problem. This paper proposes a new mathematical model based on the response surface method (RSM) and the grey relational analysis (GRA). RSM is used to obtain the experimental points and analyze the factors that have a significant impact on the selection results. GRA is used to analyze the trend relationship between alternatives and reference series. And then an RSM model is obtained, which can be used to calculate all alternatives and obtain ranking results. A real world application is introduced to illustrate the utilization of the model for the weapon selection problem. The results show that this model can be used to help decision-makers to make a quick comparison of alternatives and select a proper weapon system from multiple alternatives, which is an effective and adaptable method for solving the weapon system selection problem.

Re-entry gliding vehicles exhibit high maneuverability, making trajectory prediction a key factor in the effectiveness of defense systems. To overcome the limited fitting accuracy of existing methods and their poor adaptability to maneuver mode mutations, a trajectory prediction method is proposed that integrates online maneuver mode identification with dynamic modeling. Characteristic parameters are extracted from tracking data for parameterized modeling, enabling real-time identification of maneuver modes. In addition, a maneuver detection mechanism based on higher-order cumulants is introduced to detect lateral maneuver mutations and optimize the use of historical data. Simulation results show that the proposed method achieves accurate trajectory prediction during the glide phase and maintains high accuracy under maneuver mutations, significantly enhancing the prediction performance of both three-dimensional trajectories and ground tracks.

In response to the challenges faced by unmanned swarms in mountain obstacle-breaching missions within complex terrains, such as poor task-resource coupling, lengthy solution generation times, and poor inter-platform collaboration, an unmanned swarm scheduling strategy tailored is proposed for mountain obstacle-breaching missions. Initially, by formalizing the descriptions of obstacle breaching operations, the swarm, and obstacle targets, an optimization model is constructed with the objectives of expected global benefit, timeliness, and task completion degree. A meta-task decomposition and reassembly strategy is then introduced to more precisely match the capabilities of unmanned platforms with task requirements. Additionally, a meta-task decomposition optimization model and a meta-task allocation operator are incorporated to achieve efficient allocation of swarm resources and collaborative scheduling. Simulation results demonstrate that the model can accurately generate reasonable and feasible obstacle breaching execution plans for unmanned swarms based on specific task requirements and environmental conditions. Moreover, compared to conventional strategies, the proposed strategy enhances task completion degree and expected returns while reducing the execution time of the plans.

In this paper, we propose a beam space coversion (BSC)-based approach to achieve a single near-field signal localization under uniform circular array (UCA). By employing the centro-symmetric geometry of UCA, we apply BSC to extract the two-dimensional (2-D) angles of near-field signal in the Vandermonde form, which allows for azimuth and elevation angle estimation by utilizing the improved estimation of signal parameters via rotational invariance techniques (ESPRIT) algorithm. By substituting the calculated 2-D angles into the direction vector of near-field signal, the range parameter can be consequently obtained by the 1-D multiple signal classification (MUSIC) method. Simulations demonstrate that the proposed algorithm can achieve a single near-field signal localization, which can provide satisfactory performance and reduce computational complexity.