# Study of Frequency domain exponential functional link network filters

arXiv: https://arxiv.org/abs/2201.05501 · HTML: https://mlsanity.com/paper/2201.05501/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 4 of its 73 references that are in the map.
- First posted on arXiv 12 Jan 2022.

## Builds on (most cited first, 4 of 4)

- [Design of Robust Adaptive Beamforming Algorithms Based on Low-Rank and Cross-Correlation Techniques](https://mlsanity.com/paper/1606.01313/) (2016)
- [Sparsity-Aware Adaptive Algorithms Based on Alternating Optimization with Shrinkage](https://mlsanity.com/paper/1401.0463/) (2014)
- [Study of Robust Diffusion Recursive Least Squares Algorithms with Side Information for Networked Agents](https://mlsanity.com/paper/1812.09985/) (2018)
- [Robust Adaptive Filtering Based on Exponential Functional Link Network](https://mlsanity.com/paper/2102.02952/) (2021)

## Abstract (arXiv)

The exponential functional link network (EFLN) filter has attracted tremendous interest due to its enhanced nonlinear modeling capability. However, the computational complexity will dramatically increase with the dimension growth of the EFLN-based filter. To improve the computational efficiency, we propose a novel frequency domain exponential functional link network (FDEFLN) filter in this paper. The idea is to organize the samples in blocks of expanded input data, transform them from time domain to frequency domain, and thus execute the filtering and adaptation procedures in frequency domain with the overlap-save method. A FDEFLN-based nonlinear active noise control (NANC) system has also been developed to form the frequency domain exponential filtered-s least mean-square (FDEFsLMS) algorithm. Moreover, the stability, steady-state performance and computational complexity of algorithms are analyzed. Finally, several numerical experiments corroborate the proposed FDEFLN-based algorithms in nonlinear system identification, acoustic echo cancellation and NANC implementations, which demonstrate much better computational efficiency.
