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.     

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.     

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.     

Evidence for self-organized criticality in unscheduled downtime data of equipment

How to reduce downtime and improve availability of the complex equipment is very important. Although the unscheduled downtime（USDT） issues of the equipment are very complex, the self-organized criticality（SOC） is the right theory to study complex systems evolution and opens up a new window to the investigation of disasters, such as the sudden failure of the equipment. Firstly,SOC theory and its validation method are introduced. Then an SOC validation method for USDT of the equipment is proposed based on the above theory. Case study is done on bottleneck equipment in a factory and corresponding data pre-process work is done. The rescaled-range（R/S） analysis method is used to calculate the Hurst exponent of USDT time-series data in order to determine the long-range correlation of USDT data on time scale;at the same time the spatial power-law characteristic of USDT time series data is studied. The result shows that the characteristics of SOC are revealed in USDT data of the equipment according to the criterion of SOC. In addition, based on the characteristics of SOC,the overall framework of the prediction method for major sudden failure of the equipment is proposed based on SOC.     

Response surface method using grey relational analysis for decision making in weapon system selection

A proper weapon system is very important for a na- tional defense system. Generally, it means selecting the optimal weapon system among many alternatives, which is a multiple- attribute 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 an- alyze 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.     

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.     

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.     

Multi-dimensional blind separation method for STBC systems

Intercepted signal blind separation is a research topic with high importance for both military and civilian communication systems. A blind separation method for space-time block code （STBC） systems is proposed by using the ordinary independent component analysis （ICA）. This method cannot work when specific complex modulations are employed since the assumption of mutual independence cannot be satisfied. The analysis shows that source signals, which are group-wise independent and use multi-dimensional ICA （MICA） instead of ordinary ICA, can be applied in this case. Utilizing the block-diagonal structure of the cumulant matrices, the JADE algorithm is generalized to the multidimensional case to separate the received data into mutually independent groups. Compared with ordinary ICA algorithms, the proposed method does not introduce additional ambiguities. Simulations show that the proposed method overcomes the drawback and achieves a better performance without utilizing coding information than channel estimation based algorithms.     

Novel approach for identifying Z-axis drift of RLG based on GA-SVR model

This paper describes a novel approach for identifying the Z-axis drift of the ring laser gyroscope （RLG） based on ge-netic algorithm （GA） and support vector regression （SVR） in the single-axis rotation inertial navigation system （SRINS）. GA is used for selecting the optimal parameters of SVR. The latitude error and the temperature variation during the identification stage are adopted as inputs of GA-SVR. The navigation results show that the proposed GA-SVR model can reach an identification accuracy of 0.000 2 （？）/h for the Z-axis drift of RLG. Compared with the ra-dial basis function-neural network （RBF-NN） model, the GA-SVR model is more effective in identification of the Z-axis drift of RLG.     

UBSS and blind parameters estimation algorithms for synchronous orthogonal FH signals

By using the sparsity of frequency hopping（FH） signals,an underdetermined blind source separation（UBSS） algorithm is presented. Firstly, the short time Fourier transform（STFT） is performed on the mixed signals. Then, the mixing matrix, hopping frequencies, hopping instants and the hooping rate can be estimated by the K-means clustering algorithm. With the estimated mixing matrix, the directions of arrival（DOA） of source signals can be obtained. Then, the FH signals are sorted and the FH pattern is obtained. Finally, the shortest path algorithm is adopted to recover the time domain signals. Simulation results show that the correlation coefficient between the estimated FH signal and the source signal is above 0.9 when the signal-to-noise ratio（SNR） is higher than 0 d B and hopping parameters of multiple FH signals in the synchronous orthogonal FH network can be accurately estimated and sorted under the underdetermined conditions.     

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.     

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.     

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.     

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.     

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.     

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.     

Density-based rough set model for hesitant node clustering in overlapping community detection

Overlapping community detection in a network is a challenging issue which attracts lots of attention in recent years.A notion of hesitant node（HN） is proposed. An HN contacts with multiple communities while the communications are not strong or even accidental, thus the HN holds an implicit community structure.However, HNs are not rare in the real world network. It is important to identify them because they can be efficient hubs which form the overlapping portions of communities or simple attached nodes to some communities. Current approaches have difficulties in identifying and clustering HNs. A density-based rough set model（DBRSM） is proposed by combining the virtue of densitybased algorithms and rough set models. It incorporates the macro perspective of the community structure of the whole network and the micro perspective of the local information held by HNs, which would facilitate the further ＂growth＂ of HNs in community. We offer a theoretical support for this model from the point of strength of the trust path. The experiments on the real-world and synthetic datasets show the practical significance of analyzing and clustering the HNs based on DBRSM. Besides, the clustering based on DBRSM promotes the modularity optimization.     

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.     

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.