In this paper, a novel algorithm with high computational efficiency is proposed for the filter adaptation in a feedforward active noise control system. The proposed algorithm Zero Forcing Block Adaptive Filter (ZF-BAF) performs filter adaptation on a block-by-block basis in the frequency domain. Filtering is performed in the time domain on a sample-by-sample basis. Working in the frequency domain permits us to get sub-linear complexity, whereas filtering in the time domain minimizes the latency. Furthermore, computational burden is tunable to meet specific requirements about adaptation speed and processing load. No other parameter tuning according to the working condition is required. Computer simulations, performed in different realistic cases against other high-performing time and frequency-domain algorithms, show that achievable performances are comparable, or even better, with those of the algorithms perfectly tuned for each specific case. Robustness exhibited in the tests suggests that performances are expected to be even better in a wide range of real cases where it is impossible to know a priori how to tune the algorithms.

A computationally efficient algorithm for feedforward active noise control systems / Gaiotto S.; Laudani A.; Lozito G.M.; Fulginei F.R.. - In: ELECTRONICS. - ISSN 2079-9292. - ELETTRONICO. - 9:(2020), pp. 1-20. [10.3390/electronics9091504]

A computationally efficient algorithm for feedforward active noise control systems

Lozito G. M.;
2020

Abstract

In this paper, a novel algorithm with high computational efficiency is proposed for the filter adaptation in a feedforward active noise control system. The proposed algorithm Zero Forcing Block Adaptive Filter (ZF-BAF) performs filter adaptation on a block-by-block basis in the frequency domain. Filtering is performed in the time domain on a sample-by-sample basis. Working in the frequency domain permits us to get sub-linear complexity, whereas filtering in the time domain minimizes the latency. Furthermore, computational burden is tunable to meet specific requirements about adaptation speed and processing load. No other parameter tuning according to the working condition is required. Computer simulations, performed in different realistic cases against other high-performing time and frequency-domain algorithms, show that achievable performances are comparable, or even better, with those of the algorithms perfectly tuned for each specific case. Robustness exhibited in the tests suggests that performances are expected to be even better in a wide range of real cases where it is impossible to know a priori how to tune the algorithms.
2020
9
1
20
Gaiotto S.; Laudani A.; Lozito G.M.; Fulginei F.R.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/1247538
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 2
social impact