Abstract
An efficient computation algorithm, based on unitary Jacobi-type rotations, is developed for fast least-square deconvolution. Specifically, this algorithm is able to solve a positive definite covariance matrix with a special Toeplitz structure in O(N/sup 2/) operations instead of O(N/sup 3/) operations. This algorithm, which takes advantage of the inherent structure of the underlying deconvolution problem, is guaranteed to be numerically stable since only unitary transformation is used. It is implemented on an experimental system for the estimation of human vocal tract cross-section. A significant gain in processing is observed.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
