.png){kind=icon}
.png){kind=icon}
Return
Fast Blind Equalization Using Bounded Non-Linear Function With Non-Gaussian Noise
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2020.2991046.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Blind equalization is widely utilized to eliminate inter-symbol interference in communication system. It is still a challenge to support blind equalization method within non-Gaussian noise environments. Aiming at improving its convergence speed and robustness performance, in this letter, a novel fast blind equalization method is proposed by using bounded nonlinear function (BNF) and quasi-Newton method. Firstly, BNF-based cost function is proposed to effectively eliminate non-Gaussian noise and realize equalization. Next, quasi-Newton method is developed as the iteration method, which can accelerate the convergence speed. Moreover, theoretical analysis is provided to illustrate that the proposed algorithm has a robust convergence performance. Simulation results show that the proposed method enables evident performance improvement in terms of convergence speed and robustness with non-Gaussian noise.
Keywords:
Blind equalizers
Convergence
Gaussian noise
Cost function
Interference
Acceleration
Simulation
Blind equalization
bounded nonlinear function (BNF)
quasi-Newton
non-Gaussian noise
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W