A localized parametric time-sheared Gabor atom is derived by convolving a linear frequency modulated factor, modulating in frequency and translating in time to a dilated Gaussian function, which is the generalization of Gabor atom and is more delicate for matching most of the signals encountered in practice, especially for those having frequency dispersion characteristics. The time-frequency distribution of this atom concentrates in its time center and frequency center along energy curve, with the curve being oblique to a certain extent along the time axis. A novel parametric adaptive time-frequency distribution based on a set of the derived atoms is then proposed using a adaptive signal subspace decomposition method in frequency domain, which is non-negative time-frequency energy distribution and free of cross-term interference for multicomponent signals. The results of numerical simulation manifest the effectiveness of the approach in time-frequency representation and signal de-noising processing.

Based on the semidefinite programming relaxation of the CDMA maximum likelihood multiuser detection problem, a detection strategy by the successive quadratic programming algorithm is presented. Coupled with the randomized cut generation scheme, the suboptimal solution of the multiuser detection problem in obtained. Compared to the interior point methods previously reported based on semidefinite programming, simulations demonstrate that the successive quadratic programming algorithm often yields the similar BER performances of the multiuser detection problem. But the average CPU time of this approach is significantly reduced.

A new adaptive estimator for direct sequence spread spectrum (DSSS) signals using fourth-order cumulant based adaptive method is considered. The general higher-order statistics may not be easily applied in signal processing with too complex computation. Based on the fourth-order cumulant with 1-D slices and adaptive filters, an efficient algorithm is proposed to solve the problem and is extended for nonstationary stochastic processes. In order to achieve the accurate parameter estimation of direct sequence spread spectrum (DSSS) signals, the first step uses the modified fourth-order cumulant to reduce the computing complexity. While the second step employs an adaptive recursive system to estimate the power spectrum in the frequency domain. In the case of intercepted signals without large enough data samples, the estimator provides good performance in parameter estimation and white Gaussian noise suppression. Computer simulations are included to corroborate the theoretical development with different signal-to-noise ratio conditions and recursive coefficients.

The passive bistatic radar based on the FM broadcast has inherent superiority with respect to its survivability. In this article, the ambiguity function (AF) and the cross ambiguity function (CAF) of the FM radio signal are analyzed and illustrated. The Kolmogorov Smirnov (K-S) test verifies that the amplitude probability density function of the CAF side lobes is exponential; the distribution of the target is also deduced. Finally, the detection performance of the passive radar is studied, and the result shows that this new type bistatic radar has favorable detection capability.

A specialized Hungarian algorithm was developed here for the maximum likelihood data association problem with two implementation versions due to presence of false alarms and missed detections. The maximum likelihood data association problem is formulated as a bipartite weighted matching problem. Its duality and the optimality conditions are given. The Hungarian algorithm with its computational steps, data structure and computational complexity is presented. The two implementation versions, Hungarian forest (HF) algorithm and Hungarian tree (HT) algorithm, and their combination with the naïve auction initialization are discussed. The computational results show that HT algorithm is slightly faster than HF algorithm and they are both superior to the classic Munkres algorithm.

A Bayesian estimation method to separate multicomponent signals with single channel observation is presented in this paper. By using the basis function projection, the component separation becomes a problem of limited parameter estimation. Then, a Bayesian model for estimating parameters is set up. The reversible jump MCMC (Monte Carlo Markov Chain) algorithmis adopted to perform the Bayesian computation. The method can jointly estimate the parameters of each component and the component number. Simulation results demonstrate that the method has low SNR threshold and better performance.

An efficient design-for-testability (DFT) technique is proposed to achieve low overhead for scan-based delay fault testing. Existing techniques for delay test such as skewed-load or broadside make the test generation process complex and produce lower coverage for scan-based designs as compared with non-scan designs, whereas techniques such as enhanced-scan test can make the test easy but need an extra holding latch to add substantial hardware overhead. A new tri-state holding logic is presented to replace the common holding latch in enhanced-scan test to get a substantial low hardware overhead. This scheme can achieve low delay overhead by avoiding the holding latch on the critical timing scan path. What’s more, this method can also keep the state and signal activity in the combinational circuit from the scan during data scan-in operation to reduce the power dissipation. Experiment results on a set of ISCAS89 benchmarks show the efficiency of the proposed scheme.

Wavelet-fractal based SAR (synthetic aperture radar) image processing is one of the advanced technologies in image processing. The main concept of analysis is that after wavelet transformation, multifractal spectrum of the signal is different from that of noise. This difference is used to alleviate the noise produced by SAR image.The method to denoise SAR image using the process based on wavelet-fractal analysis is discussed in detail. Essentially, the present method focuses on adjusting the Hölder exponent α of multifractal spectrum. After simulation, α should be adjusted to 1.72-1.73. The more the value of α exceeds 1.73, the less distinctive the edges of SAR image become. According to the authors denoising is optimal at α =1.72-1.73. In other words, when α =1.72-1.73, a smooth and denoised SAR image is produced.

The basic scheme of the orientation detection system using L-shape reticle is introduced. The dimension of the patterns on the reticle of the system in practical applications is designed and an analysis of the principle of abstracting the orientation information of the target and the effects and formation method of self-adapting tracking gate is presented. The research result shows that the orientation detection system using L-shape reticle has a good effect on space-filtering, the signals that the orientation detection system sends out are easy to be processed by computer, its self-adapting tracking gate has a strong anti-interference ability, and the whole system’s searching and tracking performances are quite high.

The optimal fusion solution with feedback information for a hybrid multisensor data fusion system is presented. In this system, a part of sensors process their data locally to produce local tracks, and another part of sensors only provide detection reports These tracks and detection reports are communicated to a central site where track fusion and composite filtering are performed. The comparative results on the simulations suggest the feedback information from the center can greatly improve the tracking performance of the local node.

In order to slove the large-scale nonlinear programming (NLP) problems efficiently, an efficient optimization algorithm based on reduced sequential quadratic programming (rSQP) and automatic differentiation (AD) is presented in this paper. With the characteristics of sparseness, relatively low degrees of freedom and equality constraints utilized, the nonlinear programming problem is solved by improved rSQP solver. In the solving process, AD technology is used to obtain accurate gradient information. The numerical results show that the combined algorithm, which is suitable for large-scale process optimization problems, can calculate more efficiently than rSQP itself.

The optimization problem is considered in which the objective function is pseudolinear(both pseudoconvex and pseudoconcave) and the constraints are linear. The general expression for the optimal solutions to the problem is derived with the representation theorem of polyhedral sets, and the uniqueness condition of the optimal solution and the computational procedures to determine all optimal solutions ( if the uniqueness condition is not satisfied ) are provided. Finally, an illustrative example is also given.

A new sufficient conditions for the global exponential stability of the equilibrium point for delayed cellular neural networks (DCNNs) is presented. It is shown that the use of a more general type of Lyapunov–Krasovskii function enables the derivation of new results for an exponential stability of the equilibrium point for DCNNs. The results establish a relation between the delay time and the parameters of the network. The results are also compared with one of the most recent results derived in the literature.

From the viewpoint of entropy, this paper investigates a hybrid multiple attribute decision making problem with precision number, interval number and fuzzy number. It defines a new concept: project entropy and the decision is taken according to the values. The validity and scientific nature of the given is proven.

A kind of networked control system with network-induced delay and packet dropout, modeled on asynchronous dynamical systems was tested, and the integrity design of the networked control system with sensors failures and actuators failures was analyzed using hybrid systems technique based on the robust fault-tolerant control theory. The parametric expression of controller is given based on the feasible solution of linear matrix inequality. The simulation results are provided on the basis of detailed theoretical analysis, which further demonstrate the validity of the proposed schema.

The Radial Basis Functions Neural Network (RBFNN) is used to establish the model of a response system through the input and output data of the system. The synchronization between a drive system and the response system can be implemented by employing the RBFNN model and state feedback control. In this case, the exact mathematical model, which is the precondition for the conventional method, is unnecessary for implementing synchronization. The effect of the model error is investigated and a corresponding theorem is developed. The effect of the parameter perturbations and the measurement noise is investigated through simulations. The simulation results under different conditions show the effectiveness of the method.

A robust tuning method for Åström’s two-degree of Freedom Modified Smith Predictor (MSP) is proposed, and it can achieve the fast setpoint and load disturbance responses independently. The tuning rules may meet the requirements within a certain delay margin according to the robustness theory. The simulation results illustrate that the tuning method is efficient compared with other controllers. Finally, the MSP controller is applied to the 15L batch fermentation system for controlling the temperature in bioreactor, and the experiment results further verify that the robust tuning rules may achieve good performance.

A constrained generalized predictive control (GPC) algorithm based on the T-S fuzzy model is presented for the nonlinear system. First, a Takagi-Sugeno (T-S) fuzzy model based on the fuzzy cluster algorithm and the orthogonal least square method is constructed to approach the nonlinear system. Since its consequence is linear, it can divide the nonlinear system into a number of linear or nearly linear subsystems. For this T-S fuzzy model, a GPC algorithm with input constraints is presented. This strategy takes into account all the constraints of the control signal and its increment, and does not require the calculation of the Diophantine equations. So it needs only a small computer memory and the computational speed is high. The simulation results show a good performance for the nonlinear systems.

One of the more challenging and unresolved issues in ATM networks is the congestion control of available bit rate (ABR). The dynamic controller is designed based on the control theory and the feedback mechanism of explicit rates. With the given method of a chosen parameter, it can guarantee the stability of the controller and closed loop system with propagation delay and bandwidth oscillation. It needs less parameters(only one) to be designed. The queue length can converge to the given value in the least steps. The fairness of different connections is considered further. The simulations show better performance and good quality of service(QoS) is achieved.

The decentralized robust guaranteed cost control problem is studied for a class of interconnected singular large-scale systems with time-delay and norm-bounded time-invariant parameter uncertainty under a given quadratic cost performance function. The problem that is addressed in this study is to design a decentralized robust guaranteed cost state feedback controller such that the closed-loop system is not only regular, impulse-free and stable, but also guarantees an adequate level of performance for all admissible uncertainties. A sufficient condition for the existence of the decentralized robust guaranteed cost state feedback controllers is proposed in terms of a linear matrix inequality (LMI) via LMI approach. When this condition is feasible, the desired state feedback decentralized robust guaranteed cost controller gain matrices can be obtained. Finally, an illustrative example is provided to demonstrate the effectiveness of the proposed approach.

A novel control method for a general class of nonlinear systems using fuzzy logic systems (FLSs) is presertted. Indirect and direct methods are combined to design the adaptive fuzzy output feedback controller and a high-gain observer is used to estimate the derivatives of the system output. The closed-loop system is proven to be semiglobally uniformly ultimately bounded. In addition, it is shown that if the approximation accuracy of the fuzzy logic system is high enough and the observer gain is chosen sufficiently large, an arbitrarily small tracking error can be achieved. Simulation results verify the effectiveness of the newly designed scheme and the theoretical discussion.

To improve the robustness of high-precision servo systems, quantitative feedback theory (QFT) which aims to achieve a desired robust design over a specified region of plant uncertainty is proposed. The robust design problem can be solved using QFT but it fails to guarantee a high precision tracking. This problem is solved by a robust digital QFT control scheme based on zero phase error (ZPE) feed forward compensation. This scheme consists of two parts: a QFT controller in the closed-loop system and a ZPE feed-forward compensator. Digital QFT controller is designed to overcome the uncertainties in the system. Digital ZPE feed forward controller is used to improve the tracking precision. Simulation and real-time examples for flight simulator servo system indicate that this control scheme can guarantee both high robust performance and high position tracking precision.

A reservation-based feedback scheduling (FS-CBS) of a set of model predictive control (MPC) tasks is presented to optimize the global control performance subject to limited computational resource. Implemented as anytime algorithm, MPC task allows computation time to be traded for control performance. Each MPC task is assigned with a constant bandwidth server (CBS), whose reserved processor time is adjusted dynamically. The FS-CBS is shown robust against the varying of execution time of MPC tasks at runtime. Simulation results illustrate its effectiveness.

Considering the stochastic delay problems existing in networked control systems, a new control mode is proposed for networked control systems whose delay is longer than a sampling period. Under the control mode, the mathematical model of such a system is established. A stochastic stabilization condition for the system is given. The maximum delay can be derived from the stabilization condition.

A new method to evaluate the fitness of the Bayesian networks according to the observed data is provided. The main advantage of this criterion is that it is suitable for both the complete and incomplete cases while the others not. Moreover it facilitates the computation greatly. In order to reduce the search space, the notation of equivalent class proposed by David Chickering is adopted. Instead of using the method directly, the novel criterion, variable ordering, and equivalent class are combined,moreover the proposed mthod avoids some problems caused by the previous one. Later, the genetic algorithm which allows global convergence, lack in the most of the methods searching for Bayesian network is applied to search for a good model in this space. To speed up the convergence, the genetic algorithm is combined with the greedy algorithm. Finally, the simulation shows the validity of the proposed approach.

In view of certain defects of common rough communication, using the S-rough sets, this article presents a S-rough communication model. The S-rough communication model is the extension of the common rough communication model. S-rough communication has two kinds of forms: one-direction S-rough communication and two-direction S-rough communication. The mathematical structure and characteristics of the one-direction S-rough communication and the two-direction S-rough communication, the relationship theorem between the one-direction S-rough communication and the two-direction S-rough communication are also presented. The S-rough communication is a dynamic communication method, and it is a novel research direction in rough sets field.

The perfect sequences are so ideal that all out-of-phase autocorrelation coefficients are zero, and if the sequences are used as the coding modulating signal for the phase-modulated radar, there will be no interference of side lobes theoretically. However, it has been proved that there are no binary perfect sequences of period 4 < n≤12100 . Hence, the almost perfect sequences with all out-of-phase autocorrelation coefficients as zero except one are of great practice in engineering. Currently, the cyclic difference set is one of most effective tools to analyze the binary sequences with perfect periodic autocorrelation function. In this article, two characteristic formulas corresponding to the autocorrelation and symmetric structure of almost perfect sequences are calculated respectively. All almost perfect sequences with period n, which is a multiple of 4, can be figured out by the two formulas. Several almost perfect sequences with different periods have been hunted by the program based on the two formulas and then applied to the simulation program and practical application for ionospheric sounding.

The derivation of a diagonally loaded sample-matrix inversion (LSMI) algorithm on the busis of inverse matrix recursion (i.e.LSMI-IMR algorithm) is conducted by reconstructing the recursive formulation of covariance matrix. For the new algorithm, diagonal loading is by setting initial inverse matrix without any addition of computation. In addition, a corresponding improved recursive algorithm is presented, which is low computational complexity. This eliminates the complex multiplications of the scalar coefficient and updating matrix, resulting in significant computational savings. Simulations show that the LSMI-IMR algorithm is valid.

A nonlinear data analysis algorithm, namely empirical data decomposition (EDD) is proposed, which can perform adaptive analysis of observed data. Analysis filter, which is not a linear constant coefficient filter, is automatically determined by observed data, and is able to implement multi-resolution analysis as wavelet transform. The algorithm is suitable for analyzing non-stationary data and can effectively wipe off the relevance of observed data. Then through discussing the applications of EDD in image compression, the paper presents a 2-dimension data decomposition framework and makes some modifications of contexts used by Embedded Block Coding with Optimized Truncation （EBCOT）. Simulation results show that EDD is more suitable for non-stationary image data compression.

To aim at the multimode character of the data from the airplane detecting system, the paper combines Dempster-Shafer evidence theory and subjective Bayesian algorithm and makes to propose a mixed structure multimode data fusion algorithm. The algorithm adopts a prorated algorithm relate to the incertitude evaluation to convert the probability evaluation into the precognition probability in an identity frame, and ensures the adaptability of different data from different source to the mixed system. To guarantee real time fusion, a combination of time domain fusion and space domain fusion is established, this not only assure the fusion of data chain in different time of the same sensor, but also the data fusion from different sensors distributed in different platforms and the data fusion among different modes. The feasibility and practicability are approved through computer simulation.

Satellite link characteristics drastically degrade transport control protocol (TCP) performance. An efficient performance enhancing scheme is proposed. The improvement of TCP performance over satellite-based Internet is accomplished by protocol transition gateways at each end of a satellite link. The protocol which runs over a satellite link executes the receiver-driven flow control and acknowledgements- and timeouts-based error control strategies. The validity of this TCP performance enhancing scheme is verified by a series of simulation experiments. Results show that the proposed scheme can efficiently enhance the TCP performance over satellite-based Internet and ensure that the available bandwidth resources of the satellite link are fully utilized.

The reconfigurable cryptographic chip is an integrated circuit that is designed by means of the method of reconfigurable architecture, and is used for encryption and decryption. Many different cipher algorithms can be flexibly implemented with the aid of a reconfigurable cryptographic chip and can be used in many fields. This article takes an example for the SHA-1/224/256 algorithms, and then designs a reconfigurable cryptographic chip based on the thought and method of the reconfigurable architecture. Finally, this paper gives the implementation result based on the FPGA of the family of Stratix II of Altera Corporation, and presents a good research trend for resolving the storage in hardware implementation using FPGAs.

For the problem of large network load generated by the Gnutella resource-searching model in Peer to Peer (P2P) network, a improved model to decrease the network expense is proposed, which establishes a cluster in P2P network, auto-organizes logical layers, and applies a hybrid mechanism of directional searching and flooding. The performance analysis and simulation results show that the proposed hierarchical searching model has availably reduced the generated message load and that its searching-response time performance is as fairly good as that of the Gnutella model.