Block Levinson Algorithm
If M is not strictly Toeplitz, but block Toeplitz, the Levinson recursion can be derived in much the same way by regarding the block Toeplitz matrix as a Toeplitz matrix with matrix elements (Musicus 1988). Block Toeplitz matrices arise naturally in signal processing algorithms when dealing with multiple signal streams (e.g., in MIMO systems) or cyclo-stationary signals.
Read more about this topic: Levinson Recursion
Famous quotes containing the word block:
“Dug from the tomb of taste-refining time,
Each form is exquisite, each block sublime.
Or good, or bad,—disfigur’d, or deprav’d,—
All art, is at its resurrection sav’d;
All crown’d with glory in the critic’s heav’n,
Each merit magnified, each fault forgiven.”
—Martin Archer, Sir Shee (1769–1850)