论文信息 - Fast algorithms for exponential data modeling

Fast algorithms for exponential data modeling

A new fast algorithm is presented for quantifying signals modeled by a sum of exponentially damped sinusoids. The new algorithm is applied to the quantitative analysis of Nuclear Magnetic Resonance (NMR) data and is shown to be up to an order of magnitude more efficient than currently used linear prediction and state-space based methods.<<ETX>>

[1] T. Kailath,et al. Fast Parallel Algorithms for QR and Triangular Factorization , 1987 .

[2] D. van Ormondt,et al. Improved algorithm for noniterative time-domain model fitting to exponentially damped magnetic resonance signals , 1987 .

[3] R. Brent,et al. QR factorization of Toeplitz matrices , 1986 .

[4] Henrik Gesmar,et al. Application of the Linear Prediction Method to NMR Spectroscopy , 1991 .

[5] D. van Ormondt,et al. Analysis of NMR Data Using Time Domain Fitting Procedures , 1992 .

[6] G. W. Stewart,et al. An updating algorithm for subspace tracking , 1992, IEEE Trans. Signal Process..

[7] R. Kumaresan,et al. Estimating the parameters of exponentially damped sinusoids and pole-zero modeling in noise , 1982 .

[8] C Decanniere,et al. Metabolic response to halothane in piglets susceptible to malignant hyperthermia: an in vivo 31P-NMR study. , 1993, Journal of applied physiology.

[9] K. Arun,et al. State-space and singular-value decomposition-based approximation methods for the harmonic retrieval problem , 1983 .