Abstract
A fast algorithm for the solution of a Toeplitz system of equations is presented. The algorithm requires order <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N(\log N)^{2}</tex> computations where N is the number of equations. For banded Toeplitz matrices the order of computations is reduced to only <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N \log N + m(\log m)^{2}</tex> where 2m is the maximum number of nonzero principal subdiagonals of the Toeplitz matrix. The algorithm is in essence a fast implementation of the Trench algorithm in reverse. Thus, the algorithm involves imbedding of the given matrix in a cyclic matrix and a fast HD (half-divisor) algorithm to compute the first row of the inverse matrix. The desired solution is then obtained directly from the first row by applying fast Fourier transform techniques in order <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N \log N</tex> computations. Finally, the extension of the algorithm to block Toeplitz matrices is also presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Acoustics, Speech, and Signal Processing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
