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

URI	http://purl.tuc.gr/dl/dias/A4878504-B506-449E-A74D-9D0777EDEA2F	-
Identifier	https://doi.org/15 pages	-
Language	en	-
Extent	10.1016/0165-1684(94)90214-3	en
Title	Efficient Levinson and Schur-type algorithms for block near-to-Toeplitz systems of equations	en
Creator	Liavas Athanasios	en
Creator	Λιαβας Αθανασιος	el
Creator	Theodoridis, Spyros	en
Publisher	Elsevier	en
Content 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.	en
Type of Item	Peer-Reviewed Journal Publication	en
Type of Item	Δημοσίευση σε Περιοδικό με Κριτές	el
License	http://creativecommons.org/licenses/by/4.0/	en
Date of Item	2015-11-08	-
Date of Publication	1994	-
Subject	Levinson-type algorithms	en
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	en

Export

Metadata & Content in a METS Package:

Metadata in Format: