Abstract
For active control of road noise inside a vehicle, many reference signals are required in adaptive control systems, resulting in slow convergence speeds and heavy computational loads. In this paper, a means of reducing the computational complexity of adaptive control algorithms is investigated based on the fast-converging least-mean-squares Newton (LMS-Newton) algorithm. By analyzing the autocorrelation matrix of reference signals filtered by secondary paths, it is found that the dimensions of the autocorrelation matrix of filtered reference signals do not necessarily have to equal the dimensions of the adaptive control filters, and instead the dimensions can be determined from the correlation between reference signals filtered by secondary paths. Then a computationally efficient segment-update block algorithm is proposed that splits adaptive control filters into several segments and the coefficients of each segment are updated independently. Theoretical analysis shows that the proposed segment-update block algorithm has similar convergence speed and noise-reduction performance as the traditional LMS-Newton algorithm when a segment of appropriate length is chosen, but the computational complexity is reduced dramatically because the inverse autocorrelation matrix is replaced by a smaller matrix. The performance of the proposed algorithm is verified through simulation experiments with different recorded road noises and secondary paths, and the results are compared with those of some typical algorithms. The simulation results showed that the proposed algorithm achieved a similar noise-reduction performance with an approximately 8.9-times reduction of computational complexity compared with the traditional LMS-Newton algorithm.
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.