Time-domain coding of (near) toll quality speech at rates below 16 KB/S

Kroon, P.

doi:10.1016/0165-1684(85)90136-7

Search citation statements

Order By: Relevance

Paper Sections

Select...

Short-cut To the Levinson Algorithm1

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1988

2004

Publication Types

Select...

Article5

Other1

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 8 publications

(2 citation statements)

References 24 publications

(45 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is then very easy to see why this assumption leads to inversion algorithms such as Levinson's whose complexity is of the order of O(p²) rather than the usual O(p 3 ) complexity.…”

Section: Short-cut To the Levinson Algorithmmentioning

confidence: 99%

“…We present here two somewhat original interpretations of the Levinson and Lattice algorithms, using matrix-based and geometric-oriented approaches respectively. As far as we know, they are usually not presented as such in textbooks, although the geometricoriented approach to linear prediction is sometimes used (see [2], [3], [4] for instance).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Unusual teaching short-cuts to the Levinson and lattice algorithms

Dutoit

2004 IEEE International Conference on Acoustics, Speech, and Signal Processing

View full text Add to dashboard Cite

The Levinson and Lattice algorithms are taught in many signal processing curricula. If only one, the fact that every cell phone solves Yule-Walker equations every 10 ms justifies it all. These algorithms, however, tend to be hard to conceptualize in a few mental images. This paper proposes two such short-cut views, geometric in the wide sense, which proved to help students "see" the essence of these tools.

show abstract

“…It is then very easy to see why this assumption leads to inversion algorithms such as Levinson's whose complexity is of the order of O(p²) rather than the usual O(p 3 ) complexity.…”

Section: Short-cut To the Levinson Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%