Professional Documents
Culture Documents
Abstract.
This work analyses, implements and modifies the adaptive The fig. 1, illustrates the general adaptive filter structure, in
filter structure configured as predictor based in fuzzy which it can be seen that the system requires an input signal
logic and the LMS algorithm (Least Mean Square). Using described as x and a desired signal d besides the output signal
the concept of Fuzzy lineal Associative Memory (FAM) to y and the error signal e which is employed to adapt the
represent a set of fuzzy rules IF-THEN; which works as
adaptive filter parameters [10-15].
inference mechanism to classify the input signal and select
the best condition in order to obtain an adaptation of the
filter parameters updating the filter response. The The best known adaptive algorithms are the Recursive Least
Adaptive Fuzzy filter (AFF) implementation is made in a Square (RLS) and the Least Mean Square (LMS). The RLS
Texas Instruments (TI) Digital signal Processor (DSP) algorithm offers faster convergence speed with respect to the
DSK TMS320C6713. Finally, to plot and illustrate the LMS algorithm, but talking about low computational
results of this work we use the Mat Lab tool. simplicity the LMS algorithm is better [8].
The expression (1) is known as the LMS, where 1 is
the next tap of the filter, is the present parameter, µ is
I. INTRODUCTION. the convergence factor, is the input signal of the filter
and finally the error signal , which it is used as a
In the literature an adaptive filter is a system able to change
feedback of the adaptive algorithm [11-15].
its parameters in according to the input signal changes
through the adaptation algorithms. The implantation of this 1 (1)
kind of filters can be designed using the FIR (Finite Impulse
Response) or IIR (Infinite Impulse Response) structure taking An AFF is conformed by a set of judgments better know as
into account for each case the structure characteristics, being the fuzzy rules or linguistic rules (If-Then)[2].
for the IIR the high computational complexity and for the FIR
filter, the low computational complexity. Therefore the FIR If “xi” is “ai” Then “bi” is “yi”
If “xj” is “aj” Then “bj” is “yj”
structure is selected for this work but if the system involves
If “xk” is “ak” Then “bk” is “yk”
non-linear changes, the filter will require a bigger order;
hence the complexity of the filter will increase. That’s why The descriptions of these fuzzy rules are defined through three
the objective of this work develops two adaptive FIR filters processes in which the fuzzy system is delimited, fig. 2: input
with low computational complexity, one being a modification inference, inference mechanism (antecedent and consequence)
of the first, which can adapt its parameters using a fuzzy logic and output inference [5-8].
structure [1,8,11-15].
Fig. 1. The general adaptive filter structure Fig. 2. The AFF description.
The task of the input inference is to map the crisp input into a Fig. 3 shows the membership function proposing A1 as
fuzzy value or a set of fuzzy values between 0 and 1 through completely negative level. The level between zero and
the membership functions [3-9]. completely negative is A2. The middle level is A3. The level
These membership functions can be different (triangular, between zero and completely positive is A4, and A5 as the
trapezoidal, Gaussian, etc) and these are defined by the expert completely positive level [8].
knowledge.
1087
3
The filters input signal is the desired signal of the system too,
in this way the predictor configuration is achieved, fig.5.
1088
4
The result shows that the low frequency components are the The same voice signal was applied with the modified AFF,
same but the AFF output adds some more high frequency illustrated in fig.10.
components.
The fig.11 shows the spectrogram of the modified AFF
IV. MODIFICATION. output, in which it can be seen that the high and low
frequency components are practically the same.
The modification proposed considers the previous
classification using the FAM to calculate the filter
parameters without being directly replaced into the LMS
algorithm. We use the buffer characteristic ( ) of the
traditional FIR filters to change it in order to adequate de filter
input signal (7).
∑ (7)
1 (8)
Fig.11. Desired and obtained spectrogram by the modified AFF
In the same way, this modification was tested with a tune,
fig.9, and a voice signal, fig.10. V. CONCLUSIONS.
This work develops a non-linear Adaptive Fuzzy Filter with
the LMS algorithm, which is responsible of update the
parameters in order to decrease the error per iteration. Some
of the most important advantages of the fuzzy filters are the
incorporation of the linguistic information which comes from
the human knowledge to the filter (as If-Then rules).
The results show that the AFF has a good behavior to identify
non-linear functions and employs few data to achieve the
adaptation. The modification of the filter has a better
description of the signal and less phase lag without increasing
Fig. 9. Modified AFF results with a tune
the size of the Cartesian product, and therefore, maintaining
The output of the modified AFF has a better description of the the low complexity of the filter making faster this process.
signal; the result of the modified AFF follows better the
desired signal. In accordance with the input signal the filter will select an
adequate convergence factor having as objective to get the
answer signal more efficient.
VI. REFERENCES.
[1] B.Farhang-Boroujeny, “Adaptive Filters”. Ed. John Wiley & son
2000. West Sussex POD19IUD, England
[2] Li-Xi Wang, Jerry M.Mendel, “Fuzzy Adaptive Filters, with Aplication
to Nonlinear Channel Equalitation”,IEE Transactions on fuzzy systems,
Vol. 1 No. 3. 1993. Pp 161-168.
Fig.10. Desired and obtained signal by the modified AFF
1089
5
1090