Institutional Repository
Technical University of Crete
EN  |  EL

Search

Browse

My Space

Efficient Levinson and Schur-type algorithms for block near-to-Toeplitz systems of equations

Liavas Athanasios, Theodoridis, Spyros

Full record


URI: http://purl.tuc.gr/dl/dias/A4878504-B506-449E-A74D-9D0777EDEA2F
Year 1994
Type of Item Peer-Reviewed Journal Publication
License
Details
Bibliographic Citation A. P. Liavas and S. Theodoridis, “Efficient Levinson and Schur-type algorithms for block near-to-Toeplitz systems of equations,” Signal Proc., vol. 35,no. 3, pp. 241–255, Feb. 1994.doi: 10.1016/0165-1684(94)90214-3 https://doi.org/15 pages
Appears in Collections

Summary

In this paper new efficient Levinson- and Schur-type algorithms are derived for block near-to-Toeplitz systems of equations. In contrast to previously derived algorithms, the block near-to-Toeplitz property is exploited on a scalar level leading to Levinson- and Schur-type algorithms based on scalar instead of matrix operations. As a consequence, the highly parallel Schur-type algorithm can be implemented in a straightforward way on a linear array processor, consisting of scalar operators locally connected.

Services

Statistics