An Improved Recursive Least Square Algorithm For Adapting Fuzzy Channel Equalizer

被引:1
|
作者
Zerdoumi, Zohra [1 ]
Abdou, Latifa [2 ]
Bdirina, Elkhanssa [3 ]
机构
[1] Univ Mohamed Boudiaf MSila, Dept Elect, LGE Lab, MSila, Algeria
[2] Univ Mohamed Khider, Dept Elect Engn, LI3CUB Lab, Biskra, Algeria
[3] Univ Djelfa, Fac Sci & Technol, LAADI Lab, Djelfa, Algeria
关键词
Keywords -c hannel equalization; digital communication; nonlinear channels; adaptive fuzzy filtering;
D O I
10.48084/etasr.5906
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Adaptive filters have been thoroughly investigated in digital communication. They are especially exploited as equalizers, to compensate for channel distortions, although equalizers based on linear filters perform poorly in nonlinear distortion. In this paper, a nonlinear equalizer based on a fuzzy filter is proposed and a new algorithm for the adaptation parameters is presented. The followed approach is based on a regularization of the Recursive Least Square (RLS) algorithm and an incorporation of fuzzy rules in the adaptation process. The proposed approach, named Improved Fuzzy Recursive Least Square (IFRLS), enhances significantly the fuzzy equalizer performance through the acquisition of more convergence properties and lower steady-state Mean Square Error (MSE). The efficiency of the IFRLS algorithm is confirmed through extensive simulations in a nonlinear environment, besides the conventional RLS, in terms of convergence abilities, through MSE, and the equalized signal behavior. The IFRLS algorithm recovers the transmitted signal efficiently and leads to lower steady-state MSE. An improvement in convergence abilities is noticed, besides the RLS.
引用
收藏
页码:11124 / 11129
页数:6
相关论文
共 50 条
  • [1] A simple recursive least square algorithm of space-temporal joint equalizer
    Leou, Maw-Lin
    Liaw, Yi-Ching
    Wu, Chien-Min
    [J]. DIGITAL SIGNAL PROCESSING, 2012, 22 (06) : 1145 - 1153
  • [2] A recursive algorithm for data least square method and channel equalization
    Lim, Jun-Seok
    Kim, Jae Soo
    [J]. DYNAMICS OF CONTINUOUS DISCRETE AND IMPULSIVE SYSTEMS-SERIES B-APPLICATIONS & ALGORITHMS, 2006, 13E : 2232 - 2235
  • [3] Improved Variable Forgetting Factor Recursive Least Square Algorithm
    Albu, Felix
    [J]. 2012 12TH INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION, ROBOTICS & VISION (ICARCV), 2012, : 1789 - 1793
  • [4] A recursive data least square algorithm and its channel equalization application
    Lim, Jun-Seok
    Kim, Jea-Soo
    Sung, Koeng-Mo
    [J]. IEICE TRANSACTIONS ON COMMUNICATIONS, 2007, E90B (08) : 2143 - 2146
  • [5] The Underwater Acoustic OFDM Channel Equalizer Basing On Least Mean Square Adaptive Algorithm
    Ma, Xuefei
    Zhao, Chunhui
    Qiao, Gang
    [J]. 2008 IEEE INTERNATIONAL SYMPOSIUM ON KNOWLEDGE ACQUISITION AND MODELING WORKSHOP PROCEEDINGS, VOLS 1 AND 2, 2008, : 1052 - +
  • [6] FPGA Implementation for A Recursive Least Square Algorithm
    Peng Liang
    Sun Guocang
    Deng Haihua
    Chen Ming
    [J]. 2013 2ND INTERNATIONAL SYMPOSIUM ON INSTRUMENTATION AND MEASUREMENT, SENSOR NETWORK AND AUTOMATION (IMSNA), 2013, : 741 - 744
  • [7] Recursive least square and fuzzy modelling using genetic algorithm for process control application
    Rahman, Ribhan Zafira Abdul
    Yusof, Rubiyah
    Khalid, Marzuki
    [J]. AMS 2007: FIRST ASIA INTERNATIONAL CONFERENCE ON MODELLING & SIMULATION ASIA MODELLING SYMPOSIUM, PROCEEDINGS, 2007, : 388 - +
  • [8] Least square kurtosis constant modulus algorithm based underwater acoustic channel blind equalizer
    Guo, YC
    Guo, Y
    Zhao, JW
    [J]. PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 1040 - 1044
  • [9] Convergence and stability of recursive damped least square algorithm
    Zengqiang C.
    Maoqiong L.
    Zhuzhi Y.
    [J]. Applied Mathematics and Mechanics, 2000, 21 (2) : 237 - 242
  • [10] CONVERGENCE AND STABILITY OF RECURSIVE DAMPED LEAST SQUARE ALGORITHM
    陈增强
    林茂琼
    袁著祉
    [J]. Applied Mathematics and Mechanics(English Edition), 2000, (02) : 237 - 242