A computationally efficient implementation of the Levinson algorithm in two steps that dramatically reduces the computational coal is presented. The algorithm uses the generalised Levinson recursion for block matrices as a first step, and the Gohberg-Semencul formula as a second step, saving similar to 75% in terms of the computational cost for a typical two-channel deconvolution problem.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据