Elsevier

Information Sciences

Volume 40, Issue 2, 1 December 1986, Pages 131-142
Information Sciences

An LDU decomposition algorithm for a block Toeplitz matrix having a parallel and pipelined computing structure

https://doi.org/10.1016/0020-0255(86)90003-4Get rights and content

Abstract

This paper presents an LDU decomposition algorithm for a block Toeplitz matrix, which is well suited to a parallel and pipelined architecture. Writing the size of one block element as d and the number of the blocks as p, this algorithm requires O(p2d3) computing time on a sequential computer. Our proposed architecture achieves O(pd) computing time with a two-dimensional array of O(pd2) processor elements.

References (12)

  • S.Y. Kung et al.

    A highly concurrent algorithm and pipelined architecture for solving Toeplitz systems

    IEEE Trans. Acoust. Speech Signal Process.

    (Feb. 1983)
  • S.Y. Kung

    On supercomputing with systolic/wavefront array processors

  • I. Schur

    Über Potenzreihen die in Innern des Einheitskreises beschrankt sind

    J. Reine Angew. Math.

    (1917)
  • J. Rissanen

    Algorithms for triangular decomposition of block Hankel and Toeplitz matrices with applications to factoring positive matrix polynomials

    Math. Comp.

    (Jan. 1973)
  • P. Dewilde et al.

    On a generalized Szegö-Levinson realization algorithm for optimal linear predictor based on a network synthesis approach

    IEEE Trans. Circuits and Systems

    (Sept. 1978)
  • H. Sakai

    Circular lattice filtering using Pagano's method

    IEEE Trans. Acoust. Speech Signal Process

    (Apr. 1982)
There are more references available in the full text version of this article.

Cited by (0)

View full text