The UWA equalizer exhibits sparse features due to the sparsity of the UWA channel itself, which means that most coefficients are close to zero (
Vlachos et al., 2012;
Li and Preisig, 2007). Inspired by sparse adaptive filtering theory, attempts at combining sparse nature with adaptive equalizers have gained considerable interest.
Pelekanakis and Chitre (2010) apply improved proportionate normalized least mean square (IPNLMS) to the decision feedback equalization (DFE). The results prove its superiority when sparse channel is encountered and it also shows robustness for non-sparse channel.
Duan et al. (2018) use the IPNLMS to update the coefficients of the Turbo equalizer. It speeds up the convergence of large taps with good tracking ability and low computational complexity.
Chen et al. (2009) add the norm penalties to the cost function and exploit them as sparse regularizations, thus obtaining zero-attracting LMS (ZA-LMS) and reweighted ZA-LMS (RZA-LMS), which gain additional performance. In
Tao et al. (2017), authors propose selective ZA-NLMS (SZA-NLMS) equalization method. Compared with ZA-NLMS, it does not impose the same penalty on all coefficients uniformly, but limits the scope of constraints, further improving the performance of the equalizer. The LMS equalizer is widely used due to the simplicity of operation and small amount of calculation. However, it is sensitive to input signals and SNR, and the performance is severely degraded especially under low SNR (
Guan et al., 2013b). Recursive least square (RLS) can overcome such problems, and methods employing RLS constrained by sparse features have also appeared. RLS penalized by a general convex function is proposed in (
Eksioglu and Tanc, 2011). It can adaptively adjust the strength of the sparse constraint according to certain criteria, so the performance improves significantly. However, the computational complexity of RLS increases as the square of the length of the equalizer (
Eksioglu, 2014). When the UWA channel multipath expansion is severe, the computational complexity is extremely high. The least mean fourth (LMF) based on high order moment is also an effective method to overcome noise (
Walach and Widrow, 1984). It utilizes the fourth power instead of the square power of the equalization error. According to the theory in
Mendel (1991), the high-order energy filter can suppress the noise interference better, and can overcome the shortcomings of the LMS. However, its computational complexity is still very high. Combining the advantages of LMS and LMF, the LMS/F algorithm can effectively improve the performance of LMS without sacrificing its simplicity and stability. The performance of LMS/F has proven to be better than that of traditional LMS and LMF (
Guan et al., 2013b). Using the sparse nature of the channel, the ZA-LMS/F and RZA-LMS/F channel estimation algorithms constrained by the
${l_1}$ norm or the weighted
${l_1}$ norm have been proposed (
Guan et al., 2013a). However, few papers mention the application of the sparse LMS/F algorithm to the equalizer. Moreover, the sparse LMS/F algorithm mentioned above is performed in the real domain, which is not suitable for processing baseband complex signals in UWA systems. In this paper, we propose a LMS/F-DAE algorithm with adaptive norm constrained. Compared with the traditional LMS/F algorithm, it has two improvements: (1) Extend the LMS/F only suitable for processing real signals to the complex domain to process the baseband UWA signals. (2) Adaptively assign sparse penalty terms to each equalizer coefficient to improve the sparse level and the equalization performance.