Abstract
For the correlated input, the Volterra kernel-based least mean-square (LMS) algorithm in the time-domain exhibits a slow learning rate caused by the large eigenvalue spread of the input covariance matrix. To tackle such an issue, this paper develops a novel frequency-domain Volterra kernel-based filter, resulting in the periodic update constrained frequency-domain second-order Volterra normalized LMS (named as P-CFDSOV-NLMS1) algorithm. Subsequently, by using one- and two-dimensional discrete Fourier transforms (DFTs) simultaneously, another frequency-domain implementation and corresponding P-CFDSOV-NLMS2 algorithm are constructed. In contrast, the P-CFDSOV-NLMS1 scheme only requires one-dimensional DFT operations and takes advantage of the joint information between the block input vectors. Then, the mean and mean-square convergence behaviors of the P-CFDSOV-NLMS1 algorithm are investigated. Furthermore, the designed frequency-domain method is extended to three different widely complex-valued Volterra kernel-based models. Finally, computer simulations reveal that the suggested algorithms outperform the previously reported frequency-domain techniques in terms of convergence speed and tracking ability.
| Original language | English |
|---|---|
| Article number | 109295 |
| Number of pages | 12 |
| Journal | Signal Processing: the Official Publication of the European Association for Signal Processing |
| Volume | 216 |
| DOIs | |
| Publication status | Published - Mar 2024 |
Keywords
- Adaptive filter
- Frequency-domain
- Joint-normalized matrix
- Mean-square analysis
- Volterra kernel
- Widely complex-valued model
Fingerprint
Dive into the research topics of 'Frequency-domain Volterra kernel-based adaptation: formulations and algorithms'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver