Robust space–time adaptive processing with colored loading using iterative optimization

The performance of space–time adaptive processing (STAP) may degrade dramatically if some undesired mismatches exist in real scenarios, such as array calibration error, distorted antenna shape, direction of arrival (DOA) and Doppler frequency mismatches between the actual and presumed responses to the desired target signal, insufficient training data samples and so on. In this paper, we develop a new approach to STAP that is robust to different variations in real scenarios. This method is based on the iterative optimization for the spatial–temporal separate filter. It is confirmed that this method belongs to the class of colored loading algorithms. The loading factor can be efficiently calculated based on the known level of the uncertainty mismatch sets of spatial temporal steering vectors. Computer simulations demonstrate that the proposed robust two-dimensional (2-D) beamformer with colored loading has attained better performance as compared to the conventional STAP algorithm.     

Multigrid methods with space–time concurrency

Computing and Visualization in Science - We consider the comparison of multigrid methods for parabolic partial differential equations that allow space–time concurrency. With current trends in...     

Channel estimation based on neural network in space time block coded MIMO–OFDM system

In this study, we propose feed-forward multilayered perceptron (MLP) neural network trained with the Levenberg–Marquardt algorithm to estimate channel parameters in MIMO–OFDM systems. Bit error rate (BER) and mean square error (MSE) performances of least square (LS) and least mean square error (LMS) algorithms are also compared to our proposed neural network to evaluate the performances. Neural network channel estimator has got much better performance than LS and LMS algorithms. Furthermore it doesn?t need channel statistics and sending pilot tones, contrary to classical algorithms.     

Space–time code selection for OFDM–MISO systems

In this paper, a space–time code selection technique for multiple transmit antenna OFDM systems is proposed, and a constant-rate transmission mode for the space–time code selection technique is introduced. Subcarriers are divided into subcarrier groups and a comparison of the equivalent SISO channel envelopes with a set of predetermined threshold levels for a central subcarrier of each group is performed at the receiver, which decides on the subcarriers to be used at each antenna and sends this information to the transmitter. The transmitter adjusts the space–time code to the number of selected antennas at each subcarriers group using four bits for feedback information per group. Simulation results show that the system performs well for a range of Doppler frequencies for correlated and uncorrelated channels, outperforming transmit antenna selection techniques and adaptive transmit antenna diversity systems for both variable-rate and constant-rate transmission modes.     

Robust adaptive fuzzy control scheme for nonlinear system with uncertainty

In this paper, a robust adaptive fuzzy control scheme for a class of nonlinear system with uncertainty is proposed. First, using prior knowledge about the plant we obtain a fuzzy model, which is called the generalized fuzzy hyperbolic model （GFHM）. Secondly, for the case that the states of the system are not available an observer is designed and a robust adaptive fuzzy output feedback control scheme is developed. The overall control system guarantees that the tracking error converges to a small neighborhood of origin and that all signals involved are uniformly bounded. The main advantages of the proposed control scheme are that the human knowledge about the plant under control can be used to design the controller and only one parameter in the adaptive mechanism needs to be on-line adjusted.     

An optimal time–space algorithm for dense stereo matching

The increasing demand for higher resolution images and higher frame rate videos will always pose a challenge to computational power when real-time performance is required to solve the stereo-matching problem in 3D reconstruction applications. Therefore, the use of asymptotic analysis is necessary to measure the time and space performance of stereo-matching algorithms regardless of the size of the input and of the computational power available. In this paper, we survey several classic stereo-matching algorithms with regard to time–space complexity. We also report running time experiments for several algorithms that are consistent with our complexity analysis. We present a new dense stereo-matching algorithm based on a greedy heuristic path computation in disparity space. A procedure which improves disparity maps in depth discontinuity regions is introduced. This procedure works as a post-processing step for any technique that solves the dense stereo-matching problem. We prove that our algorithm and post-processing procedure have optimal O(n) time–space complexity, where n is the size of a stereo image. Our algorithm performs only a constant number of computations per pixel since it avoids a brute force search over the disparity range. Hence, our algorithm is faster than “real-time” techniques while producing comparable results when evaluated with ground-truth benchmarks. The correctness of our algorithm is demonstrated with experiments in real and synthetic data.     

A BSS-based space–time multi-channel algorithm for complex-jamming suppression

This paper considers the problem of suppressing complex-jamming, which contains sidelobe blanket jammings (SLJs), multiple near-mainlobe blanket jammings (multiple-NMLJs) and self-defensive false target jamming (SDJ). We propose a blind source separation (BSS)-based space–time multi-channel algorithm for complex-jamming suppression. The space–time multi-channel consists of spatial multiple beams and temporal multiple adjacent pulse repetition intervals (PRIs). The source signals can be separated by the BSS, owing to their statistical independence. The real target and SDJ can then be obtained by the pulse compression approach, distinguished by echo identification simultaneously. A remarkable feature of the proposed approach is that it does not require prior knowledge about real target or jammings, and it is easy to implement for engineering applications.     

Non-parametric regression for space–time forecasting under missing data

As more and more real time spatio-temporal datasets become available at increasing spatial and temporal resolutions, the provision of high quality, predictive information about spatio-temporal processes becomes an increasingly feasible goal. However, many sensor networks that collect spatio-temporal information are prone to failure, resulting in missing data. To complicate matters, the missing data is often not missing at random, and is characterised by long periods where no data is observed. The performance of traditional univariate forecasting methods such as ARIMA models decreases with the length of the missing data period because they do not have access to local temporal information. However, if spatio-temporal autocorrelation is present in a space–time series then spatio-temporal approaches have the potential to offer better forecasts. In this paper, a non-parametric spatio-temporal kernel regression model is developed to forecast the future unit journey time values of road links in central London, UK, under the assumption of sensor malfunction. Only the current traffic patterns of the upstream and downstream neighbouring links are used to inform the forecasts. The model performance is compared with another form of non-parametric regression, K-nearest neighbours, which is also effective in forecasting under missing data. The methods show promising forecasting performance, particularly in periods of high congestion.     

A new method of speech transmission over space time block coded co-operative MIMO–OFDM networks using time and space diversity

Reliable and good quality of service for speech transmission over wireless network has been a major challenge for the communication engineers and researchers. In this paper a new technique of speech compression and transmission using different Daubechies wavelets in a space time block coded co-corporative MIMO–OFDM networks using time and space diversity has been proposed. The main focus has been laid on design and development of wavelet based compression of multimedia signals for cooperative MIMO–OFDM system. We tried to find out various major issues regarding the wavelet compression of a speech signal. These issues include choice of a wavelet, decomposition level and thresholding criteria suitable for speech compression and transmission in co-operative MIMO–OFDM systems. A wavelet based speech compression technique using hard and soft thresholding algorithm has been proposed. The work shows that wavelet compression with QPSK modulation is a promising compression technique in a cooperative MIMO–OFDM system which makes use of the elegant theory of wavelets. The performance has been evaluated using mean square error, peak signal to noise ratio, compression ratio, bit error rate, and retained signal energy. It has been found that the transmitted speech signal is retrieved well under noisy conditions at higher order Daubechies wavelets. From the results it is clear that proposed technique aims at a radio access technology that can provide service performance comparable to that of current fixed Line accesses. To evaluate the performance of the proposed method, various performance parameters have been compared with previously implemented techniques and it has been found that the proposed work shows better performance as compared to the already existing techniques.     

Quantum algorithm to solve function inversion with time–space trade-off

In general, it is a difficult problem to solve the inverse of any function. With the inverse implication operation, we present a quantum algorithm for solving the inversion of function via using time–space trade-off in this paper. The details are as follows. Let function \(f(x)=y\) have k solutions, where \(x\in \{0, 1\}^{n}, y\in \{0, 1\}^{m}\) for any integers n, m. We show that an iterative algorithm can be used to solve the inverse of function f(x) with successful probability \(1-\left( 1-\frac{k}{2^{n}}\right) ^{L}\) for \(L\in Z^{+}\). The space complexity of proposed quantum iterative algorithm is O(Ln), where L is the number of iterations. The paper concludes that, via using time–space trade-off strategy, we improve the successful probability of algorithm.     

A unified difference-spectral method for time–space fractional diffusion equations

In this paper we develop a unified difference-spectral method for stably solving time–space fractional sub-diffusion and super-diffusion equations. Based on the equivalence between Volterra integral equations and fractional ordinary differential equations with initial conditions, this proposed method is constructed by combining the spectral Galerkin method in space and the fractional trapezoid formula in time. Numerical experiments are carried out to verify the effectiveness of the method, and demonstrate that the unified method can achieve spectral accuracy in space and second-order accuracy in time for solving two kinds of time–space fractional diffusion equations.     

A space–time adaptation scheme for unsteady shallow water problems

We provide a space–time adaptation procedure for the approximation of the Shallow Water Equations (SWE). This approach relies on a recovery based estimator for the global discretization error, where the space and time contributions are kept separate. In particular we propose an ad hoc procedure for the recovery of the time derivative of the numerical solution and then we employ this reconstruction to define the error estimator in time. Concerning the space adaptation, we move from an anisotropic error estimator able to automatically identify the density, the shape and the orientation of the elements of the computational mesh. The proposed global error estimator turns out to share the good properties of each recovery based error estimator. The whole adaptive procedure is then combined with a suitable stabilized finite element SW solver. Finally the reliability of the coupled solution–adaptation procedure is successfully assessed on two unsteady test cases of interest for hydraulics applications.     

Periodic solutions for a delayed predator–prey system with stage-structured predator on time scales

In this paper, a modified delayed predator–prey system with stage structure for predator is proposed and studied, which generalizes and incorporates as special cases some known models. With the help of continuation theorem based on the Gaines and Mawhin coincidence degree theory, we investigate the existence of periodic solutions for the proposed delayed predator–prey system with stage-structured predator and two kinds of functional responses (called Holling III functional response and Beddington–DeAngelis functional response) on time scales. In particular, when the time scale is chosen as the set of the real numbers or the integers, the existence of the periodic solutions of the corresponding continuous-time and discrete-time models follows.     

Robust adaptive uniform exact tracking control for uncertain Euler–Lagrange system

This paper offers a solution to the robust adaptive uniform exact tracking control for uncertain nonlinear Euler–Lagrange (EL) system. An adaptive finite-time tracking control algorithm is designed by proposing a novel nonsingular integral terminal sliding-mode surface. Moreover, a new adaptive parameter tuning law is also developed by making good use of the system tracking errors and the adaptive parameter estimation errors. Thus, both the trajectory tracking and the parameter estimation can be achieved in a guaranteed time adjusted arbitrarily based on practical demands, simultaneously. Additionally, the control result for the EL system proposed in this paper can be extended to high-order nonlinear systems easily. Finally, a test-bed 2-DOF robot arm is set-up to demonstrate the performance of the new control algorithm.     

A family of space–time connecting discretization schemes with local impact detection for elastodynamic contact problems

We derive, formulate and analyze a new family of discretization schemes for elastodynamic contact problems which implicitly resolve the individual impact times for each node on the contact interface. Within our approach, information from the space discrete setting is incorporated into the time discretization by means of pointwise chosen parameters for the time discretization scheme. The members of this family can be interpreted as modified Newmark schemes, thus making them easily understandable and implementable. We prove that for certain parameter choices the algorithms are dissipative methods. Further, as our analysis and our numerical experiments show, a special solution dependent choice of parameters leads to a new space–time connecting discretization with a highly stable behavior of displacements, velocities and boundary stresses at the contact interface.     

A fast algorithm for solving the space–time fractional diffusion equation

In this paper, we propose a fast algorithm for efficient and accurate solution of the space–time fractional diffusion equations defined in a rectangular domain. The spatial discretization is done by using the central finite difference scheme and matrix transfer technique. Due to its nonlocality, numerical discretization of the spectral fractional Laplacian ${(?\Delta )}_s^{\alpha /2}$ results in a large dense matrix. This causes considerable challenges not only for storing the matrix but also for computing matrix–vector products in practice. By utilizing the compact structure of the discrete system and the discrete sine transform, our algorithm avoids to store the large matrix from discretizing the nonlocal operator and also significantly reduces the computational costs. We then use the Laplace transform method for time integration of the semi-discretized system and a weighted trapezoidal method to numerically compute the convolutions needed in the resulting scheme. Various experiments are presented to demonstrate the efficiency and accuracy of our method.     

A stable space–time finite element method for parabolic evolution problems

This paper is concerned with the analysis of a new stable space–time finite element method (FEM) for the numerical solution of parabolic evolution problems in moving spatial computational domains. The discrete bilinear form is elliptic on the FEM space with respect to a discrete energy norm. This property together with a corresponding boundedness property, consistency and approximation results for the FEM spaces yield an a priori discretization error estimate with respect to the discrete norm. Finally, we confirm the theoretical results with numerical experiments in spatial moving domains.     

A Galerkin finite element scheme for time–space fractional diffusion equation

In this paper, a Galerkin finite element scheme to approximate the time–space fractional diffusion equation is studied. Firstly, the fractional diffusion equation is transformed into a fractional Volterra integro-differential equation. And a second-order fractional trapezoidal formula is used to approach the time fractional integral. Then a Galerkin finite element method is introduced in space direction, where the semi-discretization scheme and fully discrete scheme are given separately. The stability analysis of semi-discretization scheme is discussed in detail. Furthermore, convergence analysis of semi-discretization scheme and fully discrete scheme are given in details. Finally, two numerical examples are displayed to demonstrate the effectiveness of the proposed method.     

Maximum sensitivity based fractional IMC–PID controller design for non-integer order system with time delay

A simple approach with a small number of tuning parameters is a key goal in fractional order controller design. Recently there have been a number of limited attempts to bring about improvements in these areas. In this paper, a new design method for a fractional order PID controller based on internal model control (IMC) is proposed to handle non-integer order systems with time delay. In order to reduce the number of tuning parameters and mitigate the impact of time delay, the fractional order internal model control scheme is used. Considering the robustness of the control system with respect to process variations and model uncertainty, maximum sensitivity is applied to the tuning of the parameters. The resulting controller has the structure of a fractional order PID which is cascaded with a filter. This is named a fractional IMC–PID controller. Numerical results are given to show the efficiency of the proposed controller.