Channel Equalization Techniques To Mitig PDF
Channel Equalization Techniques To Mitig PDF
__________________________________________________________________________________________________________________________________
_______________________________________________________________________________________
Abstract
The major limitation in current wireless communications is the dispersion of time and the interference of the symbols. To counteract
these problems, diverse adaptive equalization techniques are used. The equalization technique is to curb time dispersion is introduced
by the communication channel and counteracts the resulting effect of inter-symbol interference (ISI). Obviously, some form of blind
equalization must be established in the receiver design. Blind equalizers estimates transmitted signals and channel parameters
simultaneously, and may also be time-varying. The aim of this research paper is to study the performance of various adaptive filter
algorithms for both blind channel and Non-blind channel equalization such as Recursive Least means Square (RLS) algorithm
equalizer, the Least Mean Square (LMS) algorithm equalizer and the Constant Modulus Algorithm (CMA) equalizer in terms of the
symbol error rate and convergence speed. The Quadrature Phase Shift Keying (QPSK) and 16-Quadrature Amplitude Modulation
(16-QAM) is used as a modulation scheme. © 2019 ijrei.com. All rights reserved
Keywords: Adaptive Equalizer, Constant modulus algorithm, Recursive Means Least Square
_________________________________________________________________________________________________________
system coefficients are set and used to decode messages as it has a constant modulus and therefore is called CMA, it is
transmitted in the future or adapted using a rough estimate of very effective for achieving channel equalization. The CMA
the operation known as direct adaptation to decisions. The goal attempts to minimize the cost function j(n), which depends on
of channel equalization is to remove the effects of the channel the difference between the received samples of squared
on the transmitted symbol sequence i.e., inter-symbol magnitude and Godard dispersion constants.
interference (ISI), which can be done by inverse filtering,
linear equalizer or decision-feedback equalization or by
applying sequential detection. The following cost functions
below explain how equalizer filter can be optimized.
There are three main adaptation algorithms used in this By replacing R2 with 𝐸|𝑥(𝑛)|4 ⁄𝐸|𝑥(𝑛)|2 the above equation
research, one is least mean square (LMS), constant modulus becomes,
algorithm (CMA) and the other is recursive least square (RLS)
filter.
𝐷2 = { 𝐸|𝑥(𝑛)|4 − 2(𝐸|𝑥(𝑛)|2 )2 ∑|𝑠𝑛 |4
3.1 Constant Modulus Algorithm (CMA) 𝑘
+ 2(𝐸|𝑥(𝑛)|2 )2 (∑|𝑠𝑛 |2 )2 }
Godard proposed an algorithm that can be used for this 𝑘
(6)
purpose. This algorithm introduces a different cost function − 2(𝐸 |𝑥(𝑛)|4 ∑|𝑥(𝑛)|2
that exploits the characteristics of the transmitted modulated
𝑘
signal. Godard’s algorithm works for phased-modulated signal + 𝑐𝑜𝑛𝑠𝑡𝑎𝑛𝑡
196
Nandar Nyein Thu et. al / International journal of research in engineering and innovation (IJREI), vol 3, issue 3 (2019), 195-199
D2 Can be written as the equation below, known as the step size. The convergence of this algorithm is
directly proportional to the step-size parameter μ. When the
𝐷2 = {−|𝑥(𝑛)|4 − 2(𝐸|𝑥(𝑛)|2 )2 ∑|𝑠𝑘 |4 step size is within a range that ensures convergence, the
process leads the estimated weights to the optimal weights.
𝑘
2 Stability is ensured provided that the following condition is
+ 2(𝐸|𝑥(𝑛)|2 )2 (∑|𝑠𝑘 |2 ) (7) met.
𝑘
lim 𝐸{𝑤𝑛 } = 𝑤 = 𝑅𝑥 −1 𝑟𝑑𝑥
− 2𝑅2 𝐸|𝑥(𝑛)|2 ∑|𝑠𝑘 |2 + 𝑅2 𝑥→∞
𝑘
𝐸{𝑤𝑛+1 } = 𝐸{𝑤𝑛 } + 𝜇𝐸 {𝑑(𝑛)𝑥 ∗ (𝑛)}
It was stated that the CM cost reduction is possible, if the − 𝜇𝐸{𝑥 ∗ (𝑛)𝑥 𝑇 (𝑛) 𝑤𝑛 } (11)
following satisfied when |S0|2 is close to unity,
2
0<𝜇<
4(𝐸𝑥(𝑛))2 |𝑠0 |2 4
− 2𝐸|𝑥(𝑛)| ≥ 0 (8) (𝑝 + 1){|𝑥(𝑛)|2 }
Fundamental concepts about equalizers, blind channel 3.3 Recursive Least Square Algorithm (RLS)
equalization and along with four different versions of constant
modulus algorithm (CMA) have been presented that are This algorithm recursively finds the filter coefficients which
derived from the same cost function introduced by Godard in reduces a weighted linear least squares cost function
[5]. concerning to the input signals [7]. The purpose of this
algorithm is to reduce the mean squares error. In RLS, the input
3.2 Least Mean Square (LMS) signals are assumed deterministic. The RLS exhibits extremely
fast convergence as compared to other conventional
As described earlier the LMS algorithm is built around a algorithms. Nevertheless, this advantage comes at the price of
transversal filter that performs a filtering process. The high computational processing complexity, and possibly not
weighting factor mechanism is accountable for execution the very good tracking performance when the filter to be estimated
adaptive control method on the tape weight of the transversal changes. RLS and LMS algorithms are similar as shown in
filter. The LMS algorithm is consists of two processes: Figure 3 but RLS algorithm gives sufficient tracking ability for
Filtering process, which involves calculating the output (d(n – fast fading channel [8]. Additionally, RLS algorithm have
d)) of a linear filter with respect to the input signal and stability problems because of the covariance update formula
resulting an estimation error by subtracting this output with a p(n), which is used for electronic adjustment in accordance
desired response as shown in equation bellow: with the estimation error as follows the figure below illustrate
the RLS algorithm block diagram:
𝑒(𝑛) = 𝑑(𝑛) − 𝑦(𝑛) (9)
𝑤 ̂𝑛 + 𝜇(𝑛)𝑒 ∗ (𝑛)
̂(𝑛+1) = 𝑤 (10)
197
Nandar Nyein Thu et. al / International journal of research in engineering and innovation (IJREI), vol 3, issue 3 (2019), 195-199
̂ 𝐻 (𝑛 − 1) 𝑢(𝑛)
𝜉(𝑛) = 𝑑(𝑛) − 𝑤 (15)
𝑤
̂(𝑛) = 𝑤
̂(𝑛 − 1) + 𝑘(𝑛) 𝜉(𝑛) (16)
The model used and shown in Fig.4, consists of a binary data Figure 5: Results of RLS, LMS and CMA Equalization with QPSK
b(n) and a modulated using QPSK and 16-QAM technique to
produce the transmitted signal s(n). s(n) goes through the
channel that has the transfer function. In this research work one
Gaussian communication channel with its z-transform or
transfer function is considered in a form as;
𝐴
𝐻(𝑧) =
𝐵 + 𝐶𝑧 −1
198
Nandar Nyein Thu et. al / International journal of research in engineering and innovation (IJREI), vol 3, issue 3 (2019), 195-199
Cite this article as: Nandar Nyein Thu, Gyamfi Sylvester, Fahad Ahmed Memon, Changjiang Bu, Channel equalization
techniques to mitigate inter-symbol interference in wireless communication, International Journal of Research in Engineering and
Innovation Vol-3, Issue-3 (2019), 195-199.
199