Levinson algorithm over integers for strongly regular Hermitian toeplitz matrices

This paper presents a new version for the classical Levinson algorithm for solution of a symmetric (Hermitian) Toeplitz set of equations. The new version has the property that for a Toeplitz matrix with (Gaussian) integer entries the algorithm is carried out entirely over integers. The new algorithm has a low binary complexity with a near-linear integer growth rate. The integer preserving property provides an immediate means to control the numerical accuracy of the solution and its associated triangular factorization. It is also more attractive for symbolic computation.