Abstract
This paper describes a new algorithm that improves the convergence performance of the transform-domain least mean-square (TRLMS) algorithm. The algorithm exploits the sparse structure of the correlation matrix of the transformed input process to derive a data dependent Gram-Schmidt orthogonalization type transform of the process. We show its faster convergence compared with the time-domain least mean-square (LMS) algorithm and the DCT or the DWT-based TRLMS algorithm. The Gram-Schmidt orthogonalization is realized using a modified adaptive escalator algorithm. The modification significantly reduces the computational complexity of the adaptive escalator algorithm and determines the computational complexity of the proposed algorithm.
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 callDisclaimer: 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.
