Abstract
Partitioned-block frequency-domain adaptive filters provide lower algorithmic complexity than their time-domain counterparts. However, for certain applications, it is desirable to reduce complexity even further. This can be achieved by reducing the complexity of the constraint, or linearization, of the circular correlations. Existing methods are either suboptimal or are not sufficiently flexible in terms of the design parameters. Therefore, an alternative complexity reduction method is proposed, which achieves near-optimal performance and which, in addition, is flexible in terms of the design parameters, as these can be arbitrarily chosen.
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 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.
