Construct · 1 fields · 1 citations

Levinson-Durbin recursion: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Signal processing

order-recursive method that solves Toeplitz normal equations for linear prediction or Wiener filtering in a number of steps growing with the square of the order.

In signal processing, Levinson-Durbin recursion refers to order-recursive method that solves Toeplitz normal equations for linear prediction or Wiener filtering in a number of steps growing with the square of the order. This meaning comes from Levinson (1946) in Journal of Mathematics and Physics.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Levinson-Durbin recursion sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

filtering1 fields · 1 citationsanchor · one word, several carriers normal3 fields · 7 citationsjingle · one word, three constructs number3 fields · 6 citationsjingle · one word, three constructs

References

Levinson, N. (1946). The Wiener (Root Mean Square) Error Criterion in Filter Design and Prediction. Journal of Mathematics and Physics, 25(1-4), 261-278. https://doi.org/10.1002/sapm1946251261

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct