Traditionally, beamforming using fractional Fourier transform (FrFT) involves a trial-and-error based FrFT order selection which is impractical. A new numerical order selection scheme is presented based on fractional power spectra (FrFT moment) of the linear chirp signal. This method can adaptively determine the optimum FrFT order by maximizing the second-order central FrFT moment. This makes the desired chirp signal substantially concentrated whereas the noise is rejected considerably. This improves the mean square error minimization beamformer by reducing effectively the signal-noise cross terms due to the finite data length de-correlation operation. Simulation results show that the new method works well under a wide range of signal to noise ratio and signal to interference ratio.
The novel compensating method directly demodulates the signals without the carrier recovery processes, in which the carrier with original modulation frequency is used as the local coherent carrier. In this way, the phase offsets due to frequency shift are linear. Based on this premise, the compensation processes are: firstly, the phase offsets between the base band neighbor-symbols after clock recovery are unbiasedly estimated among the reference symbols; then, the receiving signals symbols are adjusted by the phase estimation value; finally, the phase offsets after adjusting are compensated by the least mean squares (LMS) algorithm. In order to express the compensation processes and ability clearly, the quadrature phase shift keying (QPSK) modulation signals are regarded as examples for Matlab simulation. BER simulations are carried out using the Monte-Carlo method. The learning curves are obtained to study the algorithm’s convergence ability. The constellation figures are also simulated to observe the compensation results directly.
Particle filters have been widely used in nonlinear/non- Gaussian Bayesian state estimation problems. However, efficient distribution of the limited number of particles in state space remains a critical issue in designing a particle filter. A simplified unscented particle filter (SUPF) is presented, where particles are drawn partly from the transition prior density (TPD) and partly from the Gaussian approximate posterior density (GAPD) obtained by a unscented Kalman filter. The ratio of the number of particles drawn from TPD to the number of particles drawn from GAPD is adaptively determined by the maximum likelihood ratio (MLR). The MLR is defined to measure how well the particles, drawn from the TPD, match the likelihood model. It is shown that the particle set generated by this sampling strategy is more close to the significant region in state space and tends to yield more accurate results. Simulation results demonstrate that the versatility and estimation accuracy of SUPF exceed that of standard particle filter, extended Kalman particle filter and unscented particle filter.
Classical network reliability problems assume both networks and components have only binary states, fully working or fully failed states. But many actual networks are multi-state, such as communication networks and transportation networks. The nodes and arcs in the networks may be in intermediate states which are not fully working either fully failed. A simulation approach for computing the two-terminal reliability of a multi-state network is described. Two-terminal reliability is defined as the probability that d units of demand can be supplied from the source to sink nodes under the time threshold T. The capacities of arcs may be in a stochastic state following any discrete or continuous distribution. The transmission time of each arc is also not a fixed number but stochastic according to its current capacity and demand. To solve this problem, a capacitated stochastic coloured Petri net is proposed for modelling the system behaviour. Places and transitions respectively stand for the nodes and arcs of a network. Capacitated transition and self-modified token colour with route information are defined to describe the multi-state network. By the simulation, the two-terminal reliability and node importance can be estimated and the optimal route whose reliability is highest can also be given. Finally, two examples of different kinds of multistate networks are given.
A novel multi-baseline phase unwrapping algorithm based on the unscented particle filter for interferometric synthetic aperture radar (INSAR) technology application is proposed. The proposed method is not constrained by the nonlinearity of the problem and is independent of noise statistics, and performs noise eliminating and phase unwrapping at the same time by combining with an unscented particle filter with a path-following strategy and an omni-directional local phase slope estimator. Results obtained from multi-baseline synthetic data and single-baseline real data show the performance of the proposed method.
This paper presents a novel robust S transform algorithm based on the clipping method to process signals corrupted by impulsive noise. The proposed algorithm is introduced to determine the clipping threshold value according to the characteristics of the signal samples. Signals in various impulsive noise models are considered to illustrate that the robust S transform can achieve better performance than the standard S transform. Moreover, mean square errors for instantaneous frequency estimation of the robust S transform are compared with that of the standard S transform, showing that the robust S transform can achieve significantly improved instantaneous frequency estimation for the signals in impulsive noise.
The electromagnetic scattering of chiral metamaterials is simulated with the Mie series method. Based on the spherical harmonics vector function in chiral metamaterials, the electromagnetic fields inside and outside of chiral metamaterials sphere are expanded. By applying the continuous boundary condition between the chiral metamaterials and surrounding medium, and the transformation from linearly to circularly polarized electric field components, the co-polarized and cross-polarized bistatic radar cross scattering (RCS) of chiral metamaterials sphere are given. How to overcome the instability of chiral metamaterials sphere of Mie series formula is discussed. The electromagnetic scattering of chiral metamaterials, normal media and metamaterials are compared. The numerical results show that the existence of chirality ξ of chiral etamaterials can decrease the bistatic RCS compared with the same size as normal media sphere.
A computationally efficient soft-output detector with lattice-reduction(LR)for the multiple-input multiple-output(MIMO) systems is proposed.In the proposed scheme,the sorted QR de- composition is applied on the lattice-reduced equivalent channel to obtain the tree structure.With the aid of the boundary control, the stack algorithm searches a small part of the whole search tree to generate a handful of candidate lists in the reduced lattice. The proposed soft-output algorithm achieves near-optimal perfor- mance in a coded MIMO system and the associated computational complexity is substantially lower than that of previously proposed methods.
The problem of robust H∞ guaranteed cost satisfactory fault-tolerant control with quadratic D stabilizability against actuator failures is investigated for a class of discrete-time systems with value-bounded uncertainties existing in both the state and control input matrices. Based on a more practical and general model of actuator continuous gain failures, taking the transient property, robust behaviour on H∞ performance and quadratic cost performance requirements into consideration, sufficient conditions for the existence of satisfactory fault-tolerant controller are given and the effective design steps with constraints of multiple performance indices are provided. Meanwhile, the consistency of the regional pole index, H∞ norm-bound constraint and cost performance indices is set up for fault-tolerant control. A simulation example shows the effectiveness of the proposed method.
In this paper, an online midcourse guidance method for intercepting high-speed maneuvering targets is proposed. Firstly, the affine system is used to build a dynamic model and analyze the state constraints. The midcourse guidance problem is transformed into a continuous time optimization problem. Secondly, the problem is transformed into a discrete convex programming problem by affine control variable relaxation, Gaussian pseudospectral discretization and constraints linearization. Then, the off-line midcourse guidance trajectory is generated before midcourse guidance. It is used as the initial reference trajectory for online correction of midcourse guidance. An online guidance framework is used to eliminate the error caused by calculation of guidance instruction time. And the design of discrete points decreases with flight time to improve the solving efficiency. In addition, it is proposed that the terminal guidance capture is used innovatively space to judge the success of midcourse guidance. Numerical simulation shows the feasibility and effectiveness of the proposed method.
A novel Krein space approach to robust H∞ filtering for linear uncertain systems is developed. The parameter uncertainty, entering into both states and measurement equations, satisfies an energy-type constraint. Then a Krein space approach is used to tackle the robust H∞ filtering problem. To this end, a new Krein space formal system is designed according to the original sum quadratic constraint (SQC) without introducing any nonzero factors into it and, consequently, the estimate recursion is obtained through the filter gain in Krein space. Finally, a numerical example is given to demonstrate the effectiveness of the proposed approach.
A new approach to extraction of affine invariant features of contour image and matching strategy is proposed for shape recognition. Firstly, the centroid distance and azimuth angle of each boundary point are computed. Then, with a prior-defined angle interval, all the points in the neighbor region of the sample point are considered to calculate the average distance for eliminating noise. After that, the centroid distance ratios (CDRs) of any two opposite contour points to the barycenter are achieved as the representation of the shape, which will be invariant to affine transformation. Since the angles of contour points will change non-linearly among affine related images, the CDRs should be resampled and combined sequentially to build one-by-one matching pairs of the corresponding points. The core issue is how to determine the angle positions for sampling, which can be regarded as an optimization problem of path planning. An ant colony optimization (ACO)-based path planning model with some constraints is presented to address this problem. Finally, the Euclidean distance is adopted to evaluate the similarity of shape features in different images. The experimental results demonstrate the efficiency of the proposed method in shape recognition with translation, scaling, rotation and distortion.
Structural redundancy elimination in case resource pools (CRP) is critical for avoiding performance bottlenecks and maintaining robust decision capabilities in cloud computing services. For these purposes, this paper proposes a novel approach to ensure redundancy elimination of a reasoning system in CRP. By using α entropy and mutual information, functional measures to eliminate redundancy of a system are developed with respect to a set of outputs. These measures help to distinguish both the optimal feature and the relations among the nodes in reasoning networks from the redundant ones with the elimination criterion. Based on the optimal feature and its harmonic weight, a model for knowledge reasoning in CRP (CRPKR) is built to complete the task of query matching, and the missing values are estimated with Bayesian networks. Moreover, the robustness of decisions is verified through parameter analyses. This approach is validated by the simulation with benchmark data sets using cloud SQL. Compared with several state-of-the-art techniques, the results show that the proposed approach has a good performance and boosts the robustness of decisions.
The group decision making problem with linguistic pref- erence relations is studied.The concept of additive consistent linguistic preference relation is defined,and then some properties of the additive consistent linguistic preference relation are studied. In order to rank the alternatives in the group decision making with the linguistic preference relations,the weighted average is first utilized to combine the group linguistic preference relations to one linguistic preference relation,and then the transformation function is proposed to transform the linguistic preference relation to the multiplicative preference relation,and thus the Saaty’s eigenvec- tor method(EM)of multiplicative preference relation is utilized to rank the alternatives in group decision making with the linguistic preference relations.Finally,an illustrative numerical example is given to verify the proposed method.A comparative study to the linguistic ordered weighted averaging(LOWA)operator method is also demonstrated.
The robust reliable H∞ control problem for discrete-time Markovian jump systems with actuator failures is studied. A more practical model of actuator failures than outage is considered. Based on the state feedback method, the resulting closed-loop systems are reliable in that they remain robust stochastically stable and satisfy a certain level of H∞ disturbance attenuation not only when all actuators are operational, but also in case of some actuator failures. The solvability condition of controllers can be equivalent to a feasibility problem of coupled linear matrix inequalities (LMIs). A numerical example is also given to illustrate the design procedures and their effectiveness.
A decoupling-estimation signal parameters via rotarional invariance technique (ESPRIT) method is presented for multi-target localization with unknown mutual coupling in bistatic multiple-input multiple-output (MIMO) radar. Two steps are carried out in this method. The decoupling operation between angle and mutual coupling estimates is realized by choosing the auxiliary elements on both sides of the transmit and receive uniform linear arrays (ULAs). Then the ESPRIT method is resilient against the unknown mutual coupling matrix (MCM) and can be directly utilized to estimate the direction of departure (DOD) and the direction of arrival (DOA). Moreover, the mutual coupling coefficient is estimated by finding the solution of the linear constrained optimization problem. The proposed method allows an efficient DOD and DOA estimates with automatic pairing. Simulation results are presented to verify the effectiveness of the proposed method.
In the distributed synthetic aperture radar (SAR), the alternating bistatic mode can perform phase reference without a synchronization link between two satellites compared with the pulsed alternate synchronization method. The key of the phase synchronization processing is to extract the oscillator phase differences from the bistatic echoes. A signal model of phase synchronization in the alternating bistatic mode is presented. The phase synchronization processing method is then studied. To reduce the phase errors introduced by SAR imaging, a sub-aperture processing method is proposed. To generalize the sub-aperture processing method, an echo-domain processing method using correlation of bistatic echoes is proposed. Finally, the residual phase errors of the both proposed processing methods are analyzed. Simulation experiments validate the proposed phase synchronization processing method and its phase error analysis results.
The aim of this paper is to discuss the approximate rea- soning problems with interval-valued fuzzy environments based on the fully implicational idea.First,this paper constructs a class of interval-valued fuzzy implications by means of a type of impli- cations and a parameter on the unit interval,then uses them to establish fully implicational reasoning methods for interval-valued fuzzy modus ponens(IFMP)and interval-valued fuzzy modus tol- lens(IFMT)problems.At the same time the reversibility properties of these methods are analyzed and the reversible conditions are given.It is shown that the existing unified forms ofα-triple I(the abbreviation of triple implications)methods for FMP and FMT can be seen as the particular cases of our methods for IFMP and IFMT.
In order to avoid staircasing effect and preserve small scale texture information for the classical total variation regularization, a new minimization energy functional model for image decomposition is proposed. Firstly, an adaptive regularization based on the local feature of images is introduced to substitute total variational regularization. The oscillatory component containing texture and/or noise is modeled in generalized function space div (BMO). And then, the existence and uniqueness of the minimizer for proposed model are proved. Finally, the gradient descent flow of the Euler-Lagrange equations for the new model is numerically implemented by using a finite difference method. Experiments show that the proposed model is very robust to noise, and the staircasing effect is avoided efficiently, while edges and textures are well remained.
Cognitive radio (CR) technology is considered to be an effective solution to allocate spectrum resources, whereas the primary users of a network do not fully utilize available frequency bands. Spectrum auction framework has been recognized as an effective way to achieve dynamic spectrum access. From the perspective of spectrum auction, multi-band multi-user auction provides a new challenge for spectrum management. This paper proposes an auction framework based on location information for multi-band multi-user spectrum allocation. The performance of the proposed framework is compared with that of traditional auction framework based on a binary interference model as a benchmark. Simulation results show that primary users will obtain more total ystem revenue by selling their idle frequency bands to secondary users and the spectrum utilization of the proposed framework is more effective and fairer.
A new method for array calibration of array gain and phase uncertainties, which severely degrade the performance of spatial spectrum estimation, is presented. The method is based on the idea of the instrumental sensors method (ISM), two well-calibrated sensors are added into the original array. By applying the principle of estimation of signal parameters via rotational invariance techniques (ESPRIT), the direction-of-arrivals (DOAs)and uncertainties can be estimated simultaneously through eigen-decomposition. Compared with the conventional ones, this new method has less computational complexity while has higher estimation precision, what’s more, it can overcome the problem of ambiguity. Both theoretical analysis and computer simulations show the effectiveness of the proposed method.
For decreasing the multiple access interference of weaker signal acquisition in direct sequence spread spectrum (DSSS) systems, a new single decision algorithm is presented. The maximum value of correlation results is conventionally detected. However, there may be not only one strong peak among correlation results when the cross-correlation noise is strong enough to affect the correlation results. The proposed algorithm decreases the false alarm probability through the decision of the ratio of the maximum value and the second maximum value of the correlation results. Theoretical analysis and simulation results indicate that the proposed algorithm effectively suppresses the acquisition problem of multiple access interference in DSSS system.
Event region detection is the important application for wireless sensor networks (WSNs), where the existing faulty sensors would lead to drastic deterioration of network quality of service. Considering single-moment nodes fault-tolerance, a novel distributed fault-tolerant detection algorithm named distributed fault-tolerance based on weighted distance (DFWD) is proposed, which exploits the spatial correlation among sensor nodes and their redundant information. In sensor networks, neighborhood sensor nodes will be endowed with different relative weights respectively according to the distances between them and the central node. Having syncretized the weighted information of dual-neighborhood nodes appropriately, it is reasonable to decide the ultimate status of the central sensor node. Simultaneously, readings of faulty sensors would be corrected during this process. Simulation results demonstrate that the DFWD has a higher fault detection accuracy compared with other algorithms, and when the sensor fault probability is 10%, the DFWD can still correct more than 91% faulty sensor nodes, which significantly improves the performance of the whole sensor network.
The mixture of factor analyzers(MFA)can accurately describe high resolution range profile(HRRP)statistical charac- teristics.But how to determine the proper number of the models is a problem.This paper develops a variational Bayesian mixture of factor analyzers(VBMFA)model.This procedure can obtain a lower bound on the Bayesian integral using the Jensen’s inequality. An analytical solution of the Bayesian integral could be obtained by a hypothesis that latent variables in the model are indepen- dent.During computing the parameters of the model,birth-death moves are utilized to determine the optimal number of model au- tomatically.Experimental results for measured data show that the VBMFA method has better recognition performance than FA and MFA method.
According to the characteristic of cruise missiles, navigation point setting is simplified, and the principle of route planning for saturation attack and a concept of reference route are put forward. With the help of the shortest-tangent idea in route-planning and the algorithm of back reasoning from targets, a reference route algorithm is built on the shortest range and threat avoidance. Then a route-flight-time algorithm is built on navigation points. Based on the conditions of multi-direction saturation attack, a route planning algorithm of multi-direction saturation attack is built on reference route, route-flight-time, and impact azimuth. Simulation results show that the algorithm can realize missiles fired in a salvo launch reaching the target simultaneously from different directions while avoiding threat.
To preserve the sharp features and details of the synthetic aperture radar (SAR) image effectively when despeckling, a despeckling algorithm with edge detection in nonsubsampled second generation bandelet transform (NSBT) domain is proposed. First, the Canny operator is utilized to detect and remove edges from the SAR image. Then the NSBT which has an optimal approximation to the edges of images and a hard thresholding rule are used to approximate the details while despeckling the edge-removed image. Finally, the removed edges are added to the reconstructed image. As the edges are detected and protected, and the NSBT is used, the proposed algorithm reaches the state-of-the-art effect which realizes both despeckling and preserving edges and details simultaneously. Experimental results show that both the subjective visual effect and the mainly objective performance indexes of the proposed algorithm outperform that of both Bayesian wavelet shrinkage with edge detection and Bayesian least square-Gaussian scale mixture (BLS-GSM).
An adaptive neural network output-feedback regulation approach is proposed for a class of multi-input-multi-output nonlinear time-varying delayed systems. Both the designed observer and controller are free from time delays. Different from the existing results, this paper need not the assumption that the upper bounding functions of time-delay terms are known, and only a neural network is employed to compensate for all the upper bounding functions of time-delay terms, so the designed controller procedure is more simplified. In addition, the resulting closed-loop system is proved to be semi-globally ultimately uniformly bounded, and the output regulation error converges to a small residual set around the origin. Two simulation examples are provided to verify the effectiveness of control scheme.
Ubiquitous radar is a new radar system that provides continuous and uninterrupted multifunction capability within a coverage volume. Continuous coverage from close-in “pop-up” targets in clutter to long-range targets impacts selection of waveform parameters. The coherent processing interval (CPI) must be long enough to achieve a certain signal-to-noise ratio (SNR) that ensures the efficiency of detection. The condition of detection in the case of low SNR is analyzed, and three different cases that would occur during integration are discussed and a method to determine the CPI is presented. The simulation results show that targets detection with SNR as low as −26 dB in the experimental system can possibly determine the CPI.
To solve the multi-class fault diagnosis tasks, decision tree support vector machine (DTSVM), which combines SVM and decision tree using the concept of dichotomy, is proposed. Since the classification performance of DTSVM highly depends on its structure, to cluster the multi-classes with maximum distance between the clustering centers of the two sub-classes, genetic algorithm is introduced into the formation of decision tree, so that the most separable classes would be separated at each node of decisions tree. Numerical simulations conducted on three datasets compared with “one-against-all” and “one-against-one” demonstrate the proposed method has better performance and higher generalization ability than the two conventional methods.
In some object tracking systems, the moving object future position is an area (i.e., target area). It is a successful estimation strategy if the predicted points fall in the target area. If the object makes a sudden maneuvering, the prediction may get out of the target area easily which may make the tracking system lose the object. The aim is to investigate the admissible maximum object maneuvering intensity, which is characterized as model noise variance, for such kind of tracking system. Firstly, the concept of stochastic passage characteristics over the boundary of target area and their relationship with prediction error variance are described. Secondly, the consistency among the indices of regional pole, prediction error variance and stochastic passage characteristics is analyzed. Thirdly, the multi-indices constraints are characterized by a set of bi-linear matrix inequalities (BMIs). Then, the admissible maximum model noise variance and the satisfactory estimation strategy are presented by iteratively solving linear matrix inequalities (LMIs) to approximate BMIs. Finally, a numerical example is proposed to demonstrate the obtained results.
To design approximately linear-phase complex coefficient finite impulse response (FIR) digital filters with arbitrary magnitude and group delay responses, a novel neural network approach is studied. The approach is based on a batch back-propagation neural network algorithm by directly minimizing the real magnitude error and phase error from the linear-phase to obtain the filter’s coefficients. The approach can deal with both the real and complex coefficient FIR digital filters design problems. The main advantage of the proposed design method is the significant reduction in the group delay error. The effectiveness of the proposed method is illustrated with two optimal design examples.
Frequency-invariant beamformer (FIB) design is a key issue in wideband array signal processing. To use commonly wideband linear array with tapped delay line (TDL) structure and complex weights, the FIB design is provided according to the rule of minimizing the sidelobe level of the beampattern at the reference frequency while keeping the distortionless response constraint in the mainlobe direction at the reference frequency, the norm constraint of the weight vector and the amplitude constraint of the averaged spatial response variation (SRV). This kind of beamformer design problem can be solved with the interior-point method after being converted to the form of standard second order cone programming (SOCP). The computer simulations are presented which illustrate the effectiveness of our FIB design method for the wideband linear array with TDL structure and complex weights.
The receding horizon control (RHC) problem is considered for nonlinear Markov jump systems which can be represented by Takagi-Sugeno fuzzy models subject to constraints both on control inputs and on observe outputs. In the given receding horizon, for each mode sequence of the T-S modeled nonlinear system with Markov jump parameter, the cost function is optimized by constraints on state trajectories, so that the optimization control input sequences are obtained in order to make the state into a terminal invariant set. Out of the receding horizon, the stability is guaranteed by searching a state feedback control law. Based on such stability analysis, a linear matrix inequality approach for designing receding horizon predictive controller for nonlinear systems subject to constraints both on the inputs and on the outputs is developed. The simulation shows the validity of this method.
The problem on stabilization for the system with distributed delays is researched. The distributed time-delay under consideration is assumed to be a constant time-delay, but not known exactly. A design method is proposed for a memory proportional and integral (PI) feedback controller with adaptation to distributed time-delay. The feedback controller with memory simultaneously contains the current state and the past distributed information of the addressed systems. The design for adaptation law to distributed delay is very concise. The controller can be derived by solving a set of linear matrix inequalities (LMIs). Two numerical examples are given to illustrate the effectiveness of the design method.
The coordinated Bayesian optimization algorithm (CBOA) is proposed according to the characteristics of the function independence, conformity and supplementary between the electronic countermeasure (ECM) and the firepower attack systems. The selection criteria are combinations of probabilities of individual fitness and coordinated degree and can select choiceness individual to construct Bayesian network that manifest population evolution by producing the new chromosome. Thus the CBOA cannot only guarantee the effective pattern coordinated decision-making mechanism between the populations, but also maintain the population multiplicity, and enhance the algorithm performance. The simulation result confirms the algorithm validity.
A new recursive algorithm with the partial parallel structure based on the linearly constrained minimum variance (LCMV) criterion for adaptive monopulse systems is proposed. The weight vector associated with the original whole antenna array is decomposed into several adaptive weight sub-vectors firstly. An adaptive algorithm based on the conventional LCMV principle is then deduced to update the weight sub-vectors for sum and difference beam, respectively. The optimal weight vector can be obtained after convergence. The required computational complexity is evaluated for the proposed technique, which is on the order of O(N) and less than that of the conventional LCMV method. The flow chart scheme with the partial parallel structure of the proposed algorithm is introduced. This scheme is easy to be implemented on a distributed computer/digital signal processor (DSP) system to solve the problems of the heavy computational burden and vast data transmission of the large-scale adaptive monopulse array. Then, the monopulse ratio and convergence rate of the proposed algorithm are evaluated by numerical simulations. Compared with some recent adaptive monopulse estimation methods, a better performance on computational complexity and monopulse ratio can be achieved with the proposed adaptive method.
