A new algorithm was previously introduced for blind, adaptive equalization, known as the decorrelation algorithm. The algorithm is based on decorrelating the input to the decision or threshold device of a decision fee...
详细信息
A new algorithm was previously introduced for blind, adaptive equalization, known as the decorrelation algorithm. The algorithm is based on decorrelating the input to the decision or threshold device of a decision feedback equalizer to reduce the intersymbol interference at the equalizer's output. To increase the rate of convergence of this blind, adaptive, decision feedback equalizer, a fast Kalman structure was proposed, but not without a dramatic increase in complexity and limited numerical stability. In the present paper, more computationally efficient lattice-based structures are proposed. Using the decorrelation algorithm to control these structures, the authors maintain a high rate of convergence with better numerical stability in finite-precision environments.< >
Matching model point patterns to observed point patterns is of important concern in machine vision. Conventional search algorithms not only fail to arrive at the optimal match, but are computationally expensive, time ...
详细信息
Matching model point patterns to observed point patterns is of important concern in machine vision. Conventional search algorithms not only fail to arrive at the optimal match, but are computationally expensive, time consuming, and search the solution space sequentially. This paper presents a fast, inexpensive, algorithmically and operationally parallel evolutionary program (EP) for optimal point pattern matching based on a stochastic and heuristic optimisation framework. Novel, knowledge-based, genetic operators are defined and are dynamically controlled to achieve "fast fine tuning" and an optimal global search by efficiently combining the elements of "gradient descent" and "random search". The developed EP algorithm outperforms existing techniques and is robust as it achieves a fast, optimal pattern match even in the presence of high noise and incomplete data sets, with insignificant degradation.< >
We present a solution to the multi-scale deconvolution problem using higher order spectra where the data to be deconvolved consist of noise corrupted sensor array measurements. The model assumes that the data are gene...
详细信息
We present a solution to the multi-scale deconvolution problem using higher order spectra where the data to be deconvolved consist of noise corrupted sensor array measurements. The model assumes that the data are generated as a convolution of an unknown wavelet with linearly time-scaled versions of an unknown signal (reflectivity sequence). This type of data occurs in many signalprocessing applications, including radar, sonar and seismic processing. Our approach relies on exploiting the redundancy in the measurements due to time-scaling, and does not require knowledge of the wavelet or the signal. We formulate and solve the deconvolution problem as a quadratic minimization subject to a quadratic constraint in the sum-of-cumulants domain. The formulation using higher-order spectra reduces the effect of additive Gaussian noise on the accuracy of the results when compared to the standard time-domain formulation.< >
In this paper, we present a comprehensive theory of spatially-variant (SV) mathematical morphology. A kernel representation of increasing operators in terms of the union (resp., intersection) of SV erosions (resp., SV...
详细信息
In this paper, we present a comprehensive theory of spatially-variant (SV) mathematical morphology. A kernel representation of increasing operators in terms of the union (resp., intersection) of SV erosions (resp., SV dilations) is provided. A representation of algebraic openings (resp., algebraic closings) in terms of the union (resp., intersection) of SV openings (resp., SV closings) is also provided.< >
Simulation using importance sampling (IS) can obtain large speed-up factors if the modification or bias of the underlying probability measures is properly chosen. In the paper, the stochastic gradient optimisation tec...
详细信息
Simulation using importance sampling (IS) can obtain large speed-up factors if the modification or bias of the underlying probability measures is properly chosen. In the paper, the stochastic gradient optimisation techniques previously used to analyse single queue networks with bursty traffic are extended to tandem networks of queues with bursty traffic. The effectiveness of IS and stochastic gradient algorithms is demonstrated by their application to the problem of estimating the cell blocking probability due to buffer overflow of each queue in a tandem configuration. For the examples presented, these methods achieve speed-up factors of 5 to 8 orders of magnitude over conventional Monte Carlo simulation.
We describe techniques for specifying the requirements of real-world interface chips, using as a test target a processor interface unit (PIU). The PIU modeling problem is explained, and current interpreter specificati...
详细信息
Singular behavior of PD-eigenvalues of an nth-order scalar polynomial differential operator (SPDO) /spl Dscrsub /spl alpha=/spl deltasup n/+/spl Sigmasub k=1sup nspl alphasub k/(t)/spl deltasup k/spl minus/1/, where /...
详细信息
Singular behavior of PD-eigenvalues of an nth-order scalar polynomial differential operator (SPDO) /spl Dscrsub /spl alpha=/spl deltasup n/+/spl Sigmasub k=1sup nspl alphasub k/(t)/spl deltasup k/spl minus/1/, where /spl delta/=d/dt, is investigated. Main results of this paper include: (i) definition and properties of PD-eigenvectors associated with PD-eigenvalues, (ii) definitions and properties of generalized PD-eigenvectors and generalized PD-eigenvalues for singular PD-eigenvalues; (iii) application of (i) and (ii) in stability analysis of linear time-varying (LTV) systems /spl Dscrsub /spl alpha/spl lcub/y/spl rcub/=0, and (iv) application (i) and (ii) in the realization of PD-characteristic equation. The new results will have a significant impact on applications of the unified eigenvalue theory to the analysis and control of LTV control systems, and its further development.< >
This paper analyzes the problem of global asymptotic stability of delta-operator formulated discrete-time systems implemented in fixed-point arithmetic. It is shown that the free response of such a system tends to pro...
详细信息
This paper analyzes the problem of global asymptotic stability of delta-operator formulated discrete-time systems implemented in fixed-point arithmetic. It is shown that the free response of such a system tends to produce period one limit cycles if conventional quantization arithmetic schemes are used. Explicit necessary conditions for global asymptotic stability are derived, and these demonstrate that, in almost all cases, fixed-point arithmetic does not allow for global asymptotic stability in delta-operator formulated discrete-time systems that use a short sampling time.< >
A Hebbian-type learning algorithm for the total least-squares parameter estimation is presented. An asymptotic analysis is carried out to show that the algorithm allows the weight vector of a linear neuron unit to con...
详细信息
A Hebbian-type learning algorithm for the total least-squares parameter estimation is presented. An asymptotic analysis is carried out to show that the algorithm allows the weight vector of a linear neuron unit to converge to the eigenvector associated with the smallest eigenvalue of the correlation matrix of the input signal. When the algorithm is applied to solve parameter estimation problems, the converged weights directly yield the total least-squares solution. It is shown that the implementations of the proposed algorithm have the simplicity of those of the LMS algorithm, but its noise rejection capability is much superior to those of the least-squares-based algorithms. The applicability and performance of the algorithm are demonstrated through computer simulations of adaptive FIR and IIR parameter estimation problems.< >
This study constitutes an effort in identifying a class of unbounded coordinate transformations for vector linear time-varying systems of the form x/spl dot/=A(t)x. Main results of this paper include: (i) the definiti...
详细信息
This study constitutes an effort in identifying a class of unbounded coordinate transformations for vector linear time-varying systems of the form x/spl dot/=A(t)x. Main results of this paper include: (i) the definition and properties of meromorphic D-similarity transformations, (ii) two theorems on stability preserving meromorphic transformations. The results appear to be somewhat restrictive, but certainly shed some light on this intriguing yet difficult problem.< >
暂无评论