Incremental refinement algorithms can quickly produce approximate results and may then improve the quality of those results in subsequent stages of computation. They offer promise for the development of real-time syst...
详细信息
ISBN:
(纸本)0819419222
Incremental refinement algorithms can quickly produce approximate results and may then improve the quality of those results in subsequent stages of computation. They offer promise for the development of real-time systems whose performance degrades gracefully under diminishing hard deadlines. We present a new class of incremental refinement algorithms which employ mixed-radix signal representations for the calculation of successive approximations to the DFT. This class includes algorithms with a wide range of cost/quality tradeoff characteristics. This work generalized a previously reported class of algorithms which employ binary signal representations only. The mixed-radix formulation allows solutions of a given level of quality to be achieved using significantly fewer arithmetic operations in many instances. Under certain restrictions, these algorithms can also be implemented with no computational overhead using fixed-point binary hardware.
A design automation toolset of great applicability to the signalprocessing system design community is described herein, the JRS NetSyn product. NetSyn provides facilities for building and maintaining libraries of reu...
详细信息
ISBN:
(纸本)0819419222
A design automation toolset of great applicability to the signalprocessing system design community is described herein, the JRS NetSyn product. NetSyn provides facilities for building and maintaining libraries of reusable hardware and software parts. The NetSyn methodology supports hardware/software codesign and tradeoffs and the distribution of software functions to processing elements in accordance with selected optimization objectives. NetSyn utilizes VHDL, Ada, and ANSI C standard languages and related tools. It facilities software reuse by porting application systems to alternative architectures. The paper presents some of the underlying concepts of NetSyn and then describes the functionality of the toolset in some detail.
This paper introduces an interactive signal-processing environment called grid, grid allows the creation of complex arrays of signal-processingalgorithms by simply choosing the desired units from a toolbox and wiring...
详细信息
Under advanced Research Prjects Agency (ARPA) sponsorship, Loral Defense Systems, Arizona has developed algorithms and techniques for suppressing radio frequency interference (RFI) in radar signals. These techniques u...
详细信息
ISBN:
(纸本)0819418404
Under advanced Research Prjects Agency (ARPA) sponsorship, Loral Defense Systems, Arizona has developed algorithms and techniques for suppressing radio frequency interference (RFI) in radar signals. These techniques use conventional signalprocessing elements in an unconventional manner to localize the RFI energy in a domain where it can be easily distinguished from radar returns and removed from the radar data with minimal effect on coherent radar signal image formation processing. Significantly improved synthetic-aperture radar (SAR) images have been obtained using these techniques. Flight tests of a Loral airborne SAR system operating from 500 to 800 MHz have provided the SAR data used to develop and refine these RFI suppression techniques.
We consider the linear least squares problem subject to multiple quadratic constraints, which is motivated by a practical application in controller design. We use the techniques of convex optimization, in particluar, ...
详细信息
ISBN:
(纸本)0819419222
We consider the linear least squares problem subject to multiple quadratic constraints, which is motivated by a practical application in controller design. We use the techniques of convex optimization, in particluar, interior-point methods for semi-definite programming. We reduce a quasi-convex potential function. Each iteration requires calculating a primal and dual search direction and minimizing along the plane defined by these search directions. The primal search direction requires solving a least squares problem whose matrix is composed of a block- Toeplitz portion plus other structured matrices. We make use of Kronecker products and FFTs to greatly reduce the calculation. In addition, the matrix updates and matrix inverses in the plane search are actually low-rank updates to structured matrices so we are able to further reduce the flops required. Consequently, we can design controllers for problems of considerable size.
We consider the identification of nonlinear systems when the excitation is a non-Gaussian process. Closed from expressions are found for a class of nonlinear time-invariant as well as for time-varying systems which ar...
详细信息
ISBN:
(纸本)0819419222
We consider the identification of nonlinear systems when the excitation is a non-Gaussian process. Closed from expressions are found for a class of nonlinear time-invariant as well as for time-varying systems which are excited by stationary and nonstationary inputs, respectively. The nonlinear model used represents a subset of the Volterra series, judiciously chosen so that closed form expressions can be resolved for non-Gaussian inputs. Nonlinear coherence functions are also derived in closed form. Estimation issues are discussed. Two examples are given to illustrate the general results.
Detection and estimation of harmonic signals embedded in noise is one of the most encountered problems in the signalprocessing area. Much research has been done for solving such a problem regarding its importance in ...
详细信息
ISBN:
(纸本)0819419222
Detection and estimation of harmonic signals embedded in noise is one of the most encountered problems in the signalprocessing area. Much research has been done for solving such a problem regarding its importance in many applications. Second order statistics have been used extensively by many authors such as Whittle, Bartlett, Hannan, and Priestley. Each of them proposed a test for harmonic signal detection. However, most of these tests have been proposed under the Gaussina assumption. As a matter of fact, when the the noise is non- Gaussian, statistics of higher order could provide much more information. This is where this paper is directed. We particularly focus our attention on the third and fourth order cumulant methods. Statistical tests based on an extension of the existing tests are used and their efficiency analyzed and discussed.
An application-specific processor dedicated to Kalman-filter-based measurand reconstruction in spectrometric applications is proposed, It is intended to act as coprocessor of a host processor, performing relatively so...
详细信息
An application-specific processor dedicated to Kalman-filter-based measurand reconstruction in spectrometric applications is proposed, It is intended to act as coprocessor of a host processor, performing relatively sophisticated processing of measurement data subject to systematic errors of an instrumental type and to random errors of various natures, It is basically designed for improving the resolution of spectrometric measurements commonly used in environmental laboratories, but it may be useful in other applications where similar processing of measurement data is required, Examples of applications of the processor in spectrometric measurements, its metrological advantages and limitations, as well as perspectives of its development, are presented.
Recursive least square (RLS) estimations are used extensively in many signalprocessing and control applications. The least squares estimator w(t) can be found by solving a linear matrix system A(t)w(t) equals d(t) at...
详细信息
ISBN:
(纸本)0819419222
Recursive least square (RLS) estimations are used extensively in many signalprocessing and control applications. The least squares estimator w(t) can be found by solving a linear matrix system A(t)w(t) equals d(t) at each adaptive time step t. In this paper, we consider block RLS computations. Our approach is to employ Galerkin projection methods to solve the linear systems. The method generates a Krylov subspace from a set of direction vectors obtained by solving one of the systems and then projects the residuals of other systems orthogonally onto the generated Krylov subspace to get the approximate solutions. The whole process is repeated until all the systems are solved. Both the exponential data weighting infinite memory method and finite memory sliding data window method are used to formulate the equations. In order to speed up the convergence rate of the method, FFT-based preconditioners are also employed. Numerical results are reported to illustrate the effectiveness of the Galerkin projection method for RLS computations.
In this paper, we discuss some issues relevant to efficient, high performance subspace based tracking problems. Efficient subspace updating has been widely applied to target tracking problems. In this paper, we discus...
详细信息
ISBN:
(纸本)0819419222
In this paper, we discuss some issues relevant to efficient, high performance subspace based tracking problems. Efficient subspace updating has been widely applied to target tracking problems. In this paper, we discuss a linear frequency modulated (FM) signal model for approximating slowly time varying narrowband signals that frequently arise in subspace based tracking problems. We also discuss the appropriateness of forward-backward (FB) averaging for increasing the efficiency of subspace updating. We then derive bias expressions for the peak locations of a discrete time Fourier transform spectrum of a linear FM signal. Finally, simulations confirm our bias expressions, and show that FB averaging can enhance the time varying frequency estimation performance of MUSIC over that of forward only averaging.
暂无评论