Radial acceleration estimation of multiple high maneuvering targets

The acceleration of a high maneuvering target in signal processing is helpful to enhance the performance of the tracker and facilitate the classification of targets. At present, most of the research on acceleration estimation is carried out in cases of a single target with time-frequency analysis methods such as fractional Fourier transform （FRFT）, Hough-ambiguity transform （HAT）, and Wigner-Vil e distribution （WVD）, which need to satisfy enough time duration and sampling theorem. Only one reference proposed a method of acceleration estimation for multiple targets based on modified polynomial phase transform （MPPT） in the lin-ear frequency modulation （LFM） continuous-wave （CW） radar. The method of acceleration estimation for multiple targets in the pulse Doppler （PD） radar has not been reported so far. Compressive sensing （CS） has the advantage of sampling at a low rate and short duration without sacrificing estimation performance. There-fore, this paper proposes a new method of acceleration estimation for multiple maneuvering targets with the unknown number based on CS with pulse Doppler signals. Simulation results validate the effectiveness of the proposed method under several conditions with different duration, measurement numbers, signal to noise ra-tios （SNR）, and regularization parameters, respectively. Simulation results also show that the performance of the proposed method is superior to that of FRFT and HAT in the condition of multiple targets.     

Simulated annealing spectral clustering algorithm for image segmentation

The similarity measure is crucial to the performance of spectral clustering. The Gaussian kernel function based on the Euclidean distance is usual y adopted as the similarity measure. However, the Euclidean distance measure cannot ful y reveal the complex distribution data, and the result of spectral clustering is very sensitive to the scaling parameter. To solve these problems, a new manifold distance measure and a novel simulated anneal-ing spectral clustering （SASC） algorithm based on the manifold distance measure are proposed. The simulated annealing based on genetic algorithm （SAGA）, characterized by its rapid convergence to the global optimum, is used to cluster the sample points in the spectral mapping space. The proposed algorithm can not only reflect local and global consistency better, but also reduce the sensitivity of spectral clustering to the kernel parameter, which improves the algorithm’s clustering performance. To efficiently apply the algorithm to image segmentation, the Nystrom method is used to reduce the computation complexity. Experimental results show that compared with traditional clustering algorithms and those popular spectral clustering algorithms, the proposed algorithm can achieve better clustering performances on several synthetic datasets, texture images and real images.     

Reduced K-best sphere decoding algorithm based on minimum route distance and noise variance

This paper focuses on reducing the complexity of K-best sphere decoding （SD） algorithm for the detection of uncoded multi-ple input multiple output （MIMO） systems. The proposed algorithm utilizes the threshold-pruning method to cut nodes with partial Euclidean distances （PEDs） larger than the threshold. Both the known noise value and the unknown noise value are considered to generate the threshold, which is the sum of the two values. The known noise value is the smal est PED of signals in the detected layers. The unknown noise value is generated by the noise power, the quality of service （QoS） and the signal-to-noise ratio （SNR） bound. Simulation results show that by considering both two noise values, the proposed algorithm makes an efficient reduction while the performance drops little.     

Inference for constant-stress accelerated life test with Type-I progressively hybrid censored data from Burr-Xll distribution

This paper proposes a simple constant-stress accel- erated life test （ALT） model from Burr type XII distribution when the data are Type-I progressively hybrid censored. The maximum likelihood estimation （MLE） of the parameters is obtained through the numerical method for solving the likelihood equations. Approxi- mate confidence interval （CI）, based on normal approximation to the asymptotic distribution of MLE and percentile bootstrap Cl is derived. Finally, a numerical example is introduced and then a Monte Carlo simulation study is carried out to illustrate the pro- posed method.     

Coordination Model Research Based on Command Decision Joint Intension

Command Decision Simulation （CDS） is not only an important and difficult issue in the field of simulation, but also a technique issue to be tackled in the course of collective Modeling and Simulation in Joint Operations Experiment Center. CDS can give support to all kinds of simulation. Using computer to realize the Blue side＇s command deci- sion automatic execution in the operation training simulation system can improve training effect. Using computer to realize the lower level command unit＇s automatic command deci- sion can help to reduce the number of controllers and release them from heavy work. It can also enlarge simulation scale and increase the freedom of the simulation entity especially the command entity, thus enhance the authenticity and credibility of the simulation. Ac- cording to the command decision structure and the Joint Intention Theory, the thesis puts forward the method of making use of Coordination Matrix （CM） to realizing cooperation among the entities in CDS and constructs the calculation sketch of Task Execution, Task Monitoring and Task Replanning. At the same time, the thesis brings forward the CDS structure vision based on Partial Global Planning（PGP）. As CM is an indispensable part of combat simulation, the theory and the method of CDS will become an important part for the theory of Combat Simulation.     

Series expansion feasibility of singular integral in method of moments

When calculating electromagnetic scattering using method of moments （MoM）, integral of the singular term has a significant influence on the results. This paper transforms the singular surface integral to the contour integral. The integrand is expanded to Taylor series and the integral results in a closed form. The cut-off error is analyzed to show that the series converges fast and only about 2 terms can agree wel with the accurate result. The comparison of the perfect electric conductive （PEC） sphere＇s bi-static radar cross section （RCS） using MoM and the accurate method validates the feasibility in manipulating the singularity. The error due to the facet size and the cut-off terms of the series are analyzed in examples.     

Solution for polarimetric radar cross section measurement and calibration

The exact radar cross-section （RCS） measurement is difficult when the scattering of targets is low. Ful polarimetric cali-bration is one technique that offers the potential for improving the accuracy of RCS measurements. There are numerous polarimetric calibration algorithms. Some complex expressions in these algo-rithms cannot be easily used in an engineering practice. A radar polarimetric coefficients matrix （RPCM） with a simpler expression is presented for the monostatic radar polarization scattering matrix （PSM） measurement. Using a rhombic dihedral corner reflector and a metal ic sphere, the RPCM can be obtained by solving a set of equations, which can be used to find the true PSM for any target. An example for the PSM of a metal ic dish shows that the proposed method obviously improves the accuracy of cross-polarized RCS measurements.     

Near optimal condition of OMP algorithm in recovering sparse signal from noisy measurement

This paper analyzes the performance of the orthogonal matching pursuit （OMP） algorithm in recovering sparse signals from noisy measurement. Considering the fact that some matrices satisfy some restricted isometry properties （RIPs） but not the coherence condition, a superior RIP-based condition is proposed, which means that if the measurement matrix satisfies δk＋1 〈 1/（2 ＋ √k） and the minimum component signal-to-noise ratio （MCSNR） is bounded, the OMP algorithm can exactly identify the support of the original sparse signal within k iterations. Finally, the theoretical results are verified by numerical simulations con- cerning different values of MCSNR and noise levels.     

Cramer-Rao bound of joint estimation of target location and velocity for coherent MIMO radar

The optimal estimation performance of target parameters is studied. First, the general form of Cramer-Rao bound （CRB） for joint estimation of target location and velocity is derived for coherent multiple input multiple output （MIMO） radars. To gain some insight into the behavior of the CRB, the CRB with a set of given orthogonal waveforms is studied as a specific case. Second, a maximum likelihood （ML） estimation algorithm is proposed. The mean square error （MSE） of the ML estimation of target location and velocity is obtained by Monte Carlo simulation and it approaches CRB in the high signal-to-noise ratio （SNR） region.     

Angular extent effect of micromotion target in SAR image by polar format algorithm

Target micromotion not only plays an important role in target recognition but also leads to esoteric characteristics in synthetic aperture radar （SAR） imaging. This paper finds out an interesting phenomenon, i.e. the angular extent effect, in micro-motion target images formulated by the polar format algorithm. A micromotion target takes on multiple pairs of paired echoes （PEs） around the true point, and each PE extends for an angle which is exactly equal to the angular extent of the synthetic aperture, regardless of the micromotion frequency. The effect is derived and interpreted by using the characteristics of Bessel functions. Then it is demonstrated by simulation experiments of a target with different micromotion frequencies. The revelation and interpretation of the effect is highly beneficial to micromotion-target SAR image understanding as wel as target recognition.     

Cramer-Rao bound and signal-to-noise ratio gain in distributed coherent aperture radar

This paper studies the estimation performance of the coherent processing parameter （CPP）, including time delay differences and phase synchronization errors among different apertures of the distributed coherent aperture radar （DCAR）. Firstly, three architectures of signal processing in the DCAR are introduced. Secondly, the closed-form Cramer-Rao bound （CRB） of the CPP estimation is derived and compared. Then, the closed-form CRB is verified by numerical simulations. Finally, when the next generation radar works in a fully coherent mode, the closed-form signal-to-noise ratio （SNR） gain of the three architectures is presented.     

Solving resource availability cost problem in project scheduling by pseudo particle swarm optimization

This paper considers a project scheduling problem with the objective of minimizing resource availability costs appealed to finish al activities before the deadline. There are finish-start type precedence relations among the activities which require some kinds of renewable resources. We predigest the process of sol-ving the resource availability cost problem （RACP） by using start time of each activity to code the schedule. Then, a novel heuris-tic algorithm is proposed to make the process of looking for the best solution efficiently. And then pseudo particle swarm optimiza-tion （PPSO） combined with PSO and path relinking procedure is presented to solve the RACP. Final y, comparative computational experiments are designed and the computational results show that the proposed method is very effective to solve RACP.     

Knowledge-based detection method for SAR targets

When the classical constant false-alarm rate （CFAR） combined with fuzzy C-means （FCM） algorithm is applied to target detection in synthetic aperture radar （SAR） images with complex background, CFAR requires block-by-block estimation of clutter models and FCM clustering converges to local optimum. To address these problems, this paper pro-poses a new detection algorithm： knowledge-based combined with improved genetic algorithm-fuzzy C-means （GA-FCM） algorithm. Firstly, the algorithm takes target region＇s maximum and average intensity, area, length of long axis and long-to-short axis ratio of the external ellipse as factors which influence the target appearing probabil- ity. The knowledge-based detection algorithm can produce preprocess results without the need of estimation of clutter models as CFAR does. Afterward the GA-FCM algorithm is improved to cluster pre-process results. It has advantages of incorporating global optimizing ability of GA and local optimizing ability of FCM, which will further eliminate false alarms and get better results. The effectiveness of the proposed technique is experimentally validated with real SAR images.     

Multi-polarization reconstruction from compact polarimetry based on modified four-component scattering decomposition

An improved algorithm for multi-polarization reconstruction from compact polarimetry （CP） is proposed. According to two fundamental assumptions in compact polarimetric reconstruction, two improvements are proposed. Firstly, the four-component model-based decomposition algorithm is modified with a new volume scattering model. The decomposed helix scattering component is then used to deal with the non-reflection symmetry condition in compact polarimetric measurements. Using the decomposed power and considering the scattering mechanism of each component, an average relationship between copolarized and crosspolarized channels is developed over the original polarization state extrapolation model. E-SAR polarimetric data acquired over the Oberpfaffenhofen area and JPL/AIRSAR polarimetric data acquired over San Francisco are used for verification, and good reconstruction results are obtained, demonstrating the effectiveness of the proposed algorithm.     

Codebook design for uplink of densely small cells

The shrinking of cell-size brings significant changes to the wireless uplink of densely small cells （DSCs）. A codebook design is proposed that utilizes the strong line of sight （LOS） chan- nel component existing in a DSC system for uplink of the DSC system. To further improve the uplink performance, the high-rank codebook is designed based on singular value decomposition （SVD） due to the unnecessary preservation of strict constant modulus in the DSC system. And according to the simulation result, the proposed codebook leads to significant sum-rate gain and appreciable block error rate （BLER） performance improvement in the DSC system.     

Efficient matrix inversion based on VLIW architecture

Matrix inversion is a critical part in communication, signal processing and electromagnetic system. A flexible and scalable very long instruction word （VLIW） processor with clustered architecture is proposed for matrix inversion. A global register file （RF） is used to connect al the clusters. Two nearby clusters share a local register file. The instruction sets are also designed for the VLIW processor. Experimental results show that the proposed VLIW architecture takes only 45 latency to invert a 4 × 4 matrix when running at 150 MHz. The proposed design is roughly five times faster than the DSP solution in processing speed.     

Web software reliability modeling with random impulsive shocks

As the web-server based business is rapidly developed and popularized, how to evaluate and improve the reliability of web-servers has been extremely important. Although a large num- ber of software reliability growth models （SRGMs）, including those combined with multiple change-points （CPs）, have been available, these conventional SRGMs cannot be directly applied to web soft- ware reliability analysis because of the complex web operational profile. To characterize the web operational profile precisely, it should be realized that the workload of a web server is normally non-homogeneous and often observed with the pattern of random impulsive shocks. A web software reliability model with random im- pulsive shocks and its statistical analysis method are developed. In the proposed model, the web server workload is characterized by a geometric Brownian motion process. Based on a real data set from IIS server logs of ICRMS website （www.icrms.cn）, the proposed model is demonstrated to be powerful for estimating impulsive shocks and web software reliability.     

ECCM scheme against interrupted sampling repeater jammer based on time-frequency analysis

The interrupted sampling repeater jamming（ISRJ） is an effective deception jamming method for coherent radar, especially for the wideband linear frequency modulation（LFM） radar. An electronic counter-countermeasure（ECCM） scheme is proposed to remove the ISRJ-based false targets from the pulse compression result of the de-chirping radar. Through the time-frequency（TF） analysis of the radar echo signal, it can be found that the TF characteristics of the ISRJ signal are discontinuous in the pulse duration because the ISRJ jammer needs short durations to receive the radar signal. Based on the discontinuous characteristics a particular band-pass filter can be generated by two alternative approaches to retain the true target signal and suppress the ISRJ signal. The simulation results prove the validity of the proposed ECCM scheme for the ISRJ.     

REKF and RUKF for pico satellite attitude estimation in the presence of measurement faults

When a pico satellite is under normal operational condi- tions, whether it is extended or unscented, a conventional Kalman filter gives sufficiently good estimation results. However, if the measurements are not reliable because of any kind of malfunc- tions in the estimation system, the Kalman filter gives inaccurate results and diverges by time. This study compares two different robust Kalman filtering algorithms, robust extended Kalman filter （REKF） and robust unscented Kalman filter （RUKF）, for the case of measurement malfunctions. In both filters, by the use of de- fined variables named as the measurement noise scale factor, the faulty measurements are taken into the consideration with a small weight, and the estimations are corrected without affecting the characteristic of the accurate ones. The proposed robust Kalman filters are applied for the attitude estimation process of a pico satel- lite, and the results are compared.     

Underdetermined DOA estimation and blind separation of non-disjoint sources in time-frequency domain based on sparse representation method

This paper deals with the blind separation of nonstation-ary sources and direction-of-arrival （DOA） estimation in the under-determined case, when there are more sources than sensors. We assume the sources to be time-frequency （TF） disjoint to a certain extent. In particular, the number of sources presented at any TF neighborhood is strictly less than that of sensors. We can identify the real number of active sources and achieve separation in any TF neighborhood by the sparse representation method. Compared with the subspace-based algorithm under the same sparseness assumption, which suffers from the extra noise effect since it can-not estimate the true number of active sources, the proposed algorithm can estimate the number of active sources and their cor-responding TF values in any TF neighborhood simultaneously. An-other contribution of this paper is a new estimation procedure for the DOA of sources in the underdetermined case, which combines the TF sparseness of sources and the clustering technique. Sim-ulation results demonstrate the validity and high performance of the proposed algorithm in both blind source separation （BSS） and DOA estimation.