Year-end Sale % OFF 
Abstract
It has been demonstrated that the unconstrained partitioned fast block LMS (PFBLMS) algorithm suffers from an inherently slow convergence rate. A solution to this problem has previously been proposed by the second author of this paper, which reduces the correlation by reducing the overlap between partitions. A drawback of this solution is that it requires more memory than the conventional PFBLMS algorithm. In this paper, we propose an alternative solution that does not require any additional memory. A lattice structure is used instead to remove the correlation and increase the convergence rate.
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.
