1986
DOI: 10.1016/0022-2364(86)90446-4
|View full text |Cite
|
Sign up to set email alerts
|

Error theory for time-domain signal analysis with linear prediction and singular value decomposition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
26
0

Year Published

1989
1989
2007
2007

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 46 publications
(26 citation statements)
references
References 2 publications
0
26
0
Order By: Relevance
“…In signal processing, the Cramér-Rao bound (CRB) (1-3) on the variance of unbiased estimators is widely used as a measure of attainable precision of parameter estimates from a given set of observations (4). This paper enhances its usefulness for magnetic resonance spectroscopy quantitation.…”
Section: Introductionmentioning
confidence: 97%
“…In signal processing, the Cramér-Rao bound (CRB) (1-3) on the variance of unbiased estimators is widely used as a measure of attainable precision of parameter estimates from a given set of observations (4). This paper enhances its usefulness for magnetic resonance spectroscopy quantitation.…”
Section: Introductionmentioning
confidence: 97%
“…The algorithm implementation is user independent once the number of sinusoids contained in the signal is specified. The standard deviations of the parameters were estimated with the Cramer-Rao lower bounds [26]. The CK-catalyzed reaction rates were calculated as rate constants (k) times the PCr concentration (PCr/ NTP !…”
Section: Nmr Experimentsmentioning
confidence: 99%
“…For example, for quite some time, singular value decomposition (SVD) has been developed to obtain linear prediction (LP) coefficients in NMR signal processing. 1,2 In recent years, noise elimination methods 3 and large solvent peak suppression methods 4,5 were developed using the basic properties of SVD. The SVD matrix A for a given NMR data can be represented by m × n dimensional elements as in equation (1), (1) where U and V are the square matrices carrying m × m and n × n dimensions, respectively.…”
Section: Introductionmentioning
confidence: 99%