The NMRPipe system is a UNIX software environment of processing, graphics, and analysis tools designed to meet current routine and research-oriented multidimensional processing requirements, and to anticipate and accommodate future demands and developments. The system is based on UNIX pipes, which allow programs running simultaneously to exchange streams of data under user control. In an NMRPipe processing scheme, a stream of spectral data flows through a pipeline of processing programs, each of which performs one component of the overall scheme, such as Fourier transformation or linear prediction. Complete multidimensional processing schemes are constructed as simple UNIX shell scripts. The processing modules themselves maintain and exploit accurate records of data sizes, detection modes, and calibration information in all dimensions, so that schemes can be constructed without the need to explicitly define or anticipate data sizes or storage details of real and imaginary channels during processing. The asynchronous pipeline scheme provides other substantial advantages, including high flexibility, favorable processing speeds, choice of both all-in-memory and disk-bound processing, easy adaptation to different data formats, simpler software development and maintenance, and the ability to distribute processing tasks on multi-CPU computers and computer networks.

NMRPipe: a multidimensional spectral processing system based on UNIX pipes

The quintessential goal of sensor array signal processing is the estimation of parameters by fusing temporal and spatial information, captured via sampling a wavefield with a set of judiciously placed antenna sensors. The wavefield is assumed to be generated by a finite number of emitters, and contains information about signal parameters characterizing the emitters. A review of the area of array processing is given. The focus is on parameter estimation methods, and many relevant problems are only briefly mentioned. We emphasize the relatively more recent subspace-based methods in relation to beamforming. The article consists of background material and of the basic problem formulation. Then we introduce spectral-based algorithmic solutions to the signal parameter estimation problem. We contrast these suboptimal solutions to parametric methods. Techniques derived from maximum likelihood principles as well as geometric arguments are covered. Later, a number of more specialized research topics are briefly reviewed. Then, we look at a number of real-world problems for which sensor array processing methods have been applied. We also include an example with real experimental data involving closely spaced emitters and highly correlated signals, as well as a manufacturing application example.

Two decades of array signal processing research: the parametric approach

In the choice of an estimator for the spectrum of a stationary time series from a finite sample of the process, the problems of bias control and consistency, or "smoothing," are dominant. In this paper we present a new method based on a "local" eigenexpansion to estimate the spectrum in terms of the solution of an integral equation. Computationally this method is equivalent to using the weishted average of a series of direct-spectrum estimates based on orthogonal data windows (discrete prolate spheroidal sequences) to treat both the bias and smoothing problems. Some of the attractive features of this estimate are: there are no arbitrary windows; it is a small sample theory; it is consistent; it provides an analysis-of-variance test for line components; and it has high resolution. We also show relations of this estimate to maximum-likelihood estimates, show that the estimation capacity of the estimate is high, and show applications to coherence and polyspectrum estimates.

Spectrum estimation and harmonic analysis

There is an increasing demand for dynamic systems to become safer and more reliable This requirement extends beyond the normally accepted safety-critical systems such as nuclear reactors and aircraft, where safety is of paramount importance, to systems such as autonomous vehicles and process control systems where the system availability is vital It is clear that fault diagnosis is becoming an important subject in modern control theory and practice Robust Model-Based Fault Diagnosis for Dynamic Systems presents the subject of model-based fault diagnosis in a unified framework It contains many important topics and methods; however, total coverage and completeness is not the primary concern The book focuses on fundamental issues such as basic definitions, residual generation methods and the importance of robustness in model-based fault diagnosis approaches In this book, fault diagnosis concepts and methods are illustrated by either simple academic examples or practical applications The first two chapters are of tutorial value and provide a starting point for newcomers to this field The rest of the book presents the state of the art in model-based fault diagnosis by discussing many important robust approaches and their applications This will certainly appeal to experts in this field Robust Model-Based Fault Diagnosis for Dynamic Systems targets both newcomers who want to get into this subject, and experts who are concerned with fundamental issues and are also looking for inspiration for future research The book is useful for both researchers in academia and professional engineers in industry because both theory and applications are discussed Although this is a research monograph, it will be an important text for postgraduate research students world-wide The largest market, however, will be academics, libraries and practicing engineers and scientists throughout the world

Robust Model-Based Fault Diagnosis for Dynamic Systems

A new approach is presented to the problem of detecting the number of signals in a multichannel time-series, based on the application of the information theoretic criteria for model selection introduced by Akaike (AIC) and by Schwartz and Rissanen (MDL). Unlike the conventional hypothesis testing based approach, the new approach does not requite any subjective threshold settings; the number of signals is obtained merely by minimizing the AIC or the MDL criteria. Simulation results that illustrate the performance of the new method for the detection of the number of signals received by a sensor array are presented.

Detection of signals by information theoretic criteria

The frequency-estimation performance of the forward-backward linear prediction (FBLP) method of Nuttall/Uhych and Clayton, is significantly improved for short data records and low signal-to-noise ratio (SNR) by using information about the rank M of the signal correlation matrix. A source for the improvement is an implied replacement of the usual estimated correlation matrix by a least squares approximation matrix having the lower rank M. A second, related cause for the improvement is an increase in the order of the prediction filter beyond conventional limits. Computationally, the recommended signal processing is the same as for the FBLP method, except that the vector of prediction coefficients is formed from a linear combination of the M principal eigenvectors of the estimated correlation matrix. Alternatively, singular value decomposition can be used in the implementation. In one special case, which we call the Kumaresan-Prony (KP) case, the new prediction coefficients can be calculated in a very simple way. Philosophically, the improvement can be considered to result from a preliminary estimation of the explainable, predictable components of the data, rather than attempting to explain all of the observed data by linear prediction.

Estimation of frequencies of multiple sinusoids: Making linear prediction perform like maximum likelihood

We have presented techniques [1] - [6] based on linear prediction (LP) and singular value decomposition (SVD) for accurate estimation of closely spaced frequencies of sinusoidal signals in noise. In this note we extend these techniques to estimate the parameters of exponentially damped sinusoidal signals in noise. The estimation procedure presented here makes use of "backward prediction" in addition to SVD. First, the method is applied to data consisting of one and two exponentially damped sinusoids. The choice of one and two signal components facilitates the comparison of estimation error in pole damping factors and pole frequencies to the appropriate Cramer-Rao (CR) bounds and to traditional methods of linear prediction. Second, our method is applied to an example due to Steiglitz [8] in which the data consists of noisy values of the impulse response samples (composed of many exponentially damped sinusoids) of a linear system having both poles and zeros. The poles of the system are accurately determined by our method and the zeros are obtained subsequently, using Shanks' method.

Estimating the parameters of exponentially damped sinusoids and pole-zero modeling in noise

The problem of estimating the angles of arrival of M plane waves incident simultaneously on a line array with L + 1 (L?M) sensors utilizing the special eigenstructure of the covariance matrix C of the signal plus noise at the output of the array is addressed. A polynomial D(z) with special properties is constructed from the eigenvectors of C, the zeros of which give estimates of the angle of arrival. Although the procedure turns out to be essentially the same as that developed by Reddi, the development presented here provides insight into the estimation problem.

Estimating the Angles of Arrival of Multiple Plane Waves

Using an accurate formula for the error in approximating a low rank component, we calculate the performance of adaptive detection based on reduced-rank nulling. In this principal component inverse (PCI) method, one temporarily regards the interference as a strong signal to be enhanced. The resulting estimate of the interference waveform is subtracted from the observed data, and matched filtering is used to detect signal components in the residual waveform. We also present a generalized likelihood-ratio test (GLRT) for adaptively detecting a low rank signal in the presence of low rank interference. This approach leads to a test which is closely related to the PCI method and extends the PCI method to the case where strong signal components are present in the data. A major accomplishment of the work is our calculation of the statistics of the output of the matched filter for the case in which interference cancellation and signal detection are carried out on the same observed data matrix. That is, no separate data is used for adaptation. Examples are presented using both simulated data and real, active-sonar reverberation data from the ARSRP, the Acoustic Reverberation Special Research Program of the Office of Naval Research. >

Adaptive detection using low rank approximation to a data matrix

Linear-prediction-based (LP) methods for fitting multiple-sinusoid signal models to observed data, such as the forward-backward (FBLP) method of Nuttall [5] and Ulrych and Clayton [6], are very ill-conditioned. The locations of estimated spectral peaks can be greatly affected by a small amount of noise because of the appearance of outliers. LP estimation of frequencies can be greatly improved at low SNR by singular value decomposition (SVD) of the LP data matrix. The improved performance at low SNR is also better than that obtained by using the eigenvector corresponding to the minimum eigenvalue of the correlation matrix, as is done in Pisarenko's method and its variants.

Donald W. Tufts

Papers

Estimation of frequencies of multiple sinusoids: Making linear prediction perform like maximum likelihood

Estimating the parameters of exponentially damped sinusoids and pole-zero modeling in noise

Estimating the Angles of Arrival of Multiple Plane Waves

Adaptive detection using low rank approximation to a data matrix

Singular value decomposition and improved frequency estimation using linear prediction