2007
DOI: 10.2200/s00086ed1v01y200712spr003
|View full text |Cite
|
Sign up to set email alerts
|

The Theory of Linear Prediction

Abstract: Linear prediction theory has had a profound impact in the field of digital signal processing. Although the theory dates back to the early 1940s, its influence can still be seen in applications today. The theory is based on very elegant mathematics and leads to many beautiful insights into statistical signal processing. Although prediction is only a part of the more general topics of linear estimation, filtering, and smoothing, this book focuses on linear prediction. This has enabled detailed discussion of a nu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
77
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 67 publications
(78 citation statements)
references
References 57 publications
1
77
0
Order By: Relevance
“…In this study, we employ both Ridge regression and linear predictive model and observe that the estimated parameters are very similar to each other. For this reason , we provide the results only obtained from the linear predictive coding [23] via Levinson-Durbin recursion, lpc(d, p) [24] , which minimizes the variance of error ε i,j (p) of (1). Note that in lpc(d, p), d is a 1-dimensional series, starting at the seed voxel and ending at the pth nearest neighboring voxel, which is sorted by the distance between the seed voxel and its neighbors.…”
Section: Mesh Arc Descriptors (Mad)mentioning
confidence: 99%
“…In this study, we employ both Ridge regression and linear predictive model and observe that the estimated parameters are very similar to each other. For this reason , we provide the results only obtained from the linear predictive coding [23] via Levinson-Durbin recursion, lpc(d, p) [24] , which minimizes the variance of error ε i,j (p) of (1). Note that in lpc(d, p), d is a 1-dimensional series, starting at the seed voxel and ending at the pth nearest neighboring voxel, which is sorted by the distance between the seed voxel and its neighbors.…”
Section: Mesh Arc Descriptors (Mad)mentioning
confidence: 99%
“…Minimizing equation (2) with respect to a i,j,k is accomplished by employing Levinson-Durbin recursion [21], where E(·) is the expectation operator. The arc weights a i,j,k , which are computed for each seed voxel at each time instant t i , is used to form the mesh arc vectorā i,j = [a i,j,1 a i,j,2 · · · a i,j,p ].…”
Section: Mesh Learning and Local Relational Features (Lrf)mentioning
confidence: 99%
“…The widely used linear prediction [15] provides the tool for estimating the formant frequencies and their bandwidths based on the assumptions presented above. The speech signal is split into segments of 30 ms and the formants are estimated by finding the roots after solving the normal equations.…”
Section: Features Related To the Spectral Content Of Speechmentioning
confidence: 99%