Abstract

The number of multiplications in split lattice algorithms, related to the autocorrelation matrix, is reduced by 30 percent in comparison with classical lattice algorithms. Split version of the Burg method (BM) and the covariance lattice method (CLM) are presented. As in previously published split algorithms the number of multiplications in the proposed algorithms is reduced. >

Full Text
Paper version not known

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 call

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.