Abstract
For adaptive filters with many taps, a short processing delay, and relative low computational complexity, the partitioned block frequency-domain adaptive filter (PBFDAF) is a good choice. The computational complexity of this algorithm is significantly reduced by using the alternated constrained PBFDAF. This particular algorithm applies gradient constraints in an alternating manner. In this paper, a serious problem in performance of the alternated constrained PBFDAF is described. Furthermore, a modification is proposed that effectively alleviates this problem. By using this modification together with a gradient constraint approximation, a new efficient alternated constrained PBFDAF is developed. Compared with the fully constrained PBFDAF, this new constraining method does not show any significant performance loss and still has a much smaller computational complexity.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.