Beam-based adaptive processing is an economical way to achieve good interference rejection performance from an adaptive receiving array, at much less computational cost than full element-based methods. However, to exp...
详细信息
Beam-based adaptive processing is an economical way to achieve good interference rejection performance from an adaptive receiving array, at much less computational cost than full element-based methods. However, to exploit this potential for planar arrays it is necessary to identify, in real time, which beams must be retained for adaptive cancellation. This paper analyzes the beam-selection problem and presents a computationally efficient algorithm that performs real-time beam selection.
An iterative solution is given for solving deblurring problems having nonnegativity constraints through the use of methods motivated by tomographic imaging. After briefly reviewing three versions of tomographic-imagin...
详细信息
An iterative solution is given for solving deblurring problems having nonnegativity constraints through the use of methods motivated by tomographic imaging. After briefly reviewing three versions of tomographic-imaging problems, the paper indicates how methods that have proven to be powerful for the third version, weighted-integral tomography, can be applied to the more general deblurring problem when nonnegativity constraints are present.
We develop an algorithm for adaptively estimating the noise subspace of a data matrix, as is required in signalprocessing applications employing the 'signal subspace' approach. The noise subspace is estimated...
详细信息
In this paper, an adaptive algorithm for direction-finding of correlated sources is presented. The algorithm is low in computational complexity and it does not require determination of the effective rank of the array ...
详细信息
In this paper, an adaptive algorithm for direction-finding of correlated sources is presented. The algorithm is low in computational complexity and it does not require determination of the effective rank of the array correlation matrix. The algorithm employs a gradient technique to determine the minimum eigenvector of the correlation matrix and an orthogonalization technique to determine the second minimum eigenvector. The two noise eigenvectors are then used to compute the spatial spectra. The angle of arrivals can then be found by superimposing the two spectra. To verify further the true arrivals, additional spatial spectral can be computed using a combination of the two noise eigenvectors. Numerical results show that the proposed algorithms are effective in resolving correlated sources.
Effective signal detection and feature extraction in noisy environments generally depend on exploiting some knowledge of the signal. When the signal is exactly known, the matched filter is the optimum signal processin...
详细信息
Cumulants, and their associated Fourier transforms, known as polyspectra, are very useful in situations where one or more of the preceding phenomena - non-Gaussianity, nonminimum phase, colored Gaussian noise, and non...
详细信息
Cumulants, and their associated Fourier transforms, known as polyspectra, are very useful in situations where one or more of the preceding phenomena - non-Gaussianity, nonminimum phase, colored Gaussian noise, and nonlinearities - are present. Because second-order-based techniques have not led to very useful results in the face of these phenomena, it is no exaggeration to believe that it should be possible to reexamine every application and/or method that has ever made use of second-order statistics, using higher-order statistics, to see if better results can be obtained. The purpose of this paper is to give a brief introduction to cumulants and polyspectra and to give a brief overview of some of their applications.
We develop an algorithm for adaptively estimating the noise subspace of a data matrix, as is required in signalprocessing applications employing the 'signal subspace' approach. The noise subspace is estimated...
详细信息
We develop an algorithm for adaptively estimating the noise subspace of a data matrix, as is required in signalprocessing applications employing the 'signal subspace' approach. The noise subspace is estimated using a rank-revealing QR factorization instead of the more expensive singular value or eigenvalue decompositions. Using incremental condition estimation to monitor the smallest singular values of triangular matrices, we can update the rank-revealing triangular factorization inexpensively when new rows are added and old rows are deleted. Experiments demonstrate that the new approach usually requires O(n2) work to update an n × n matrix, and accurately tracks the noise subspace.
This paper presents a new systolic array implementation of the Kalman filter that is not excessive in either hardware or computation steps. For a dynamic system with N states and M observation components, the array us...
详细信息
This paper presents a new systolic array implementation of the Kalman filter that is not excessive in either hardware or computation steps. For a dynamic system with N states and M observation components, the array uses N(N+1) processors and about 4N+6M computation steps. In some applications, it is also required that the processing system continue to function even after some of the components of the system fail. The Kalman filter systolic array is extended to one that is tolerant of faults in the processing elements of the array by using techniques of algorithm-based fault tolerance. Overhead for fault tolerance is about 47% additional hardware and 17% additional computational steps in the example of radar tracking.
A new parallel Jacobi-like algorithm for computing the eigenvalues of a general complex matrix is presented. The asymptotic convergence rate of this algorithm is provably quadratic and this is also demonstrated in num...
详细信息
A new parallel Jacobi-like algorithm for computing the eigenvalues of a general complex matrix is presented. The asymptotic convergence rate of this algorithm is provably quadratic and this is also demonstrated in numerical experiments. The algorithm promises to be suitable for real-time signalprocessing applications. In particular, the algorithm can be implemented using n2/4 processors, taking O (n log2 n) time for random matrices.
Current bilinear time-frequency representations apply a fixed kernel to smooth the Wigner distribution. However, the choice of a fixed kernel limits the class of signals that can be analyzed effectively. This paper pr...
详细信息
Current bilinear time-frequency representations apply a fixed kernel to smooth the Wigner distribution. However, the choice of a fixed kernel limits the class of signals that can be analyzed effectively. This paper presents optimality criteria for the design of signal-dependent kernels that suppress cross-components while passing as much auto-component energy as possible, irrespective of the form of the signal. A fast algorithm for the optimal kernel solution makes the procedure competitive computationally with fixed kernel methods. Examples demonstrate the superior performance of the optimal kernel for a frequency modulated signal.
暂无评论