Abstract
In digital communication systems, blind equalizers are used to combat inter-symbol interference (ISI), by only exploiting some statistical and geometrical properties of the transmitted signals. One of the first schemes of blind equalization is the constant modulus algorithm (CMA) which is known to be robust and requires simple hardware implementation. However, for quadrature amplitude modulations (QAM), used in high data-rate communications, the CMA leads to not sufficiently low residual errors. Our contribution presents a hybrid scheme based on the combination of the extended constant modulus algorithm (ECMA) and a modified version of a Gaussian criterion matched to the alphabet of the QAM symbols. The derived algorithm is tested on 512-QAM signals, where significant improvements in terms of mean square error (MSE) are obtained.
Access provided by Autonomous University of Puebla. Download conference paper PDF
Similar content being viewed by others
Keywords
- Mean Square Error
- Hybrid Algorithm
- Quadrature Amplitude Modulation
- Constellation Point
- Inter Symbol Interference
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
1 Introduction
In digital communication systems, adaptive equalizers play a central role in combating signal distortions. Due to bandwidth limitations, the transmission channel may exhibit inter symbol interference (ISI) and an equalizer is used at the receiver to correct the signal distortion caused by the ISI.
In supervised equalization approaches a pilot sequence known by the receiver is periodically sent to help for the minimization of the distance between the desired and the actual output. Whereas, in blind (or unsupervised) equalization ones only some statistical properties of the transmitted signals are needed, to adapt the tap weights of equalizers.
One of the most known algorithms of adaptive blind equalization is the constant modulus algorithm (CMA) [1]. It is known to be robust and requires simple hardware implementation [2].
However, for QAM modulations (non constant modulus), used in high data-rate communications’ systems, the CMA leads to not sufficiently low residual errors for a correct recovering of transmitted signals. Other algorithms, known to be more adapted to QAM symbols, have been proposed in the literature. For instance, the multi-modulus algorithm (MMA) [3] and the extended constant modulus (ECMA) [4] algorithms have been shown to achieve better equalization of QAM signals than does the CMA.
Unfortunately, for high-order QAM modulations, even these algorithms are unable to provide low residual ISI that allow reliable detection of the correct symbols. A way to improve performance CMA, MMA or ECMA, for dense QAM constellations, is to penalize their criteria by terms based on alphabet-matching functions (AMF) which leads to what is called hybrid adaptive blind equalization algorithms. They perform better than their classical counterparts.
One of the first AM criteria has been proposed by Barbarossa and Scaglione [5]. Beasley and Cole-Rhodes combined the MMA and this AM cost functions [6] and showed, using 16-QAM symbols, that the hybrid algorithm outperforms the original dual-mode CMA/AMA [5] and the MMA. In a similar way, He et al. [7] proposed an AM cost function based on even powers of sine functions and combined it with the CMA and demonstrated that hybrid algorithms have higher performance than conventional ones. Blind equalization algorithms are generally based on the minimization of cost functions that measure the closeness of the equalizer output to the constellation points and the stochastic gradient algorithm is commonly used to achieve numerically this minimization.
Our contribution consists of a combination of the ECMA cost function and a modified version of the AM cost function proposed in [5]. The modification is made to account for amplitude and phase information of the transmitted signals, and hence, improve the local convergence which leads to improved global performance. The performance of the derived algorithm has been studied for 16-QAMs (low order) in [8]. But in this work, its effectiveness is shown through simulation for 512-QAM (high order) signaling where performance is compared to those of the conventional MMA and ECMA together with a penalized adaptive version of the extended constant modulus algorithm, based on a squared cosine function [7].
2 Blind Equalization Model
Let us assume that a sequence \((s_n)_{n\in \mathbb {Z}}\) of independent-identically distributed (i.i.d.) symbols, drawn from a QAM constellation, is transmitted over the time invariant channel \(\mathbf{h}\) of length K. The mathematical model for the receiver input at time n is
We introduce vectors \({\mathbf {w} }=[w_0,\ldots ,w_{L-1}]^T\) and \(\mathbf {x_n} = [{x_n},\ldots ,x_{n - L + 1}]^T\) where \((\cdot )^T\) denotes transpose, then the equalizer output is
with \((\cdot )^*\) and \((\cdot )^H\) the conjugate and transpose conjugate operators, respectively.
3 MMA and ECMA Algorithms
The idea of the multi-modulus, is to split the cost function into a real and an imaginary part to take account not only for amplitude information but also for phase information, which helps in better equalizing QAM signals than the CMA does.Whereas the extended constant modulus is based on the generalization of the modulus of a complex number.
3.1 MMA Algorithm
The cost function of the MMA to be minimized w.r.t \({\mathbf {w} }\) is given by
where \(\mathbb {E}\left\{ \cdot \right\} \) denotes expectation and \(z_{nr}\) and \(z_{ni}\) are the real and imaginary part of \(z_n\), respectively. \(R_m\) is a dispersion constant given by
with \(s_k=s_{kr}+js_{ki}\) a QAM symbol. Letting \(M\) denote the order of the modulation, we have \(s_{nr},~s_{ni} \in \left\{ a_k;\; a_{k} =a_{kr} +j \,a_{ki},\;k=1,..,M\right\} \), with \(a_{kr},~a_{ki}\in \left\{ \pm 1,\pm 3,\ldots ,\pm (\sqrt{M}-1)\right\} \).
Equalizer coefficients are updated from formulas
3.2 ECMA Algorithms
The ECMA algorithm is a particular case of the generalized constant modulus algorithms proposed in [4]. Introducing the generalized complex modulus as
for \(p\ge 1\), \(z_{nr}\) and \(z_{ni}\) denoting the real and imaginary part of \(z_n\) respectively, the ECMA criterion is given by
with the dispersion constant
The learning rule for this algorithm is
4 Hybrid Algorithms
They combine the CMA, the MMA or the ECMA cost function with an AM-based criterion. The AMF has to vanish at each constellation point, to be symmetric around these points and uniform with respect to them. The former property means that in the case of perfect equalization, the equalizer output coincides with one of the constellation points (zero error). The latter implies that the AMF functions do not favor any data symbol in the alphabet over another.
The AM cost function proposed in [5] is
where \(a_k (k=1,\dots , M)\) are the constellation points and the parameter \(\sigma \) controls the width of the nulls.
The squared cosine AM cost function proposed in [7] has the form
with \(2d\) the minimum distance between symbols.
In our scheme the AM term given by (9), is modified such that the terms of the exponential are split into real and imaginary parts instead of the modulus, as in (10). It transforms to
We refer to the resulting hybrid algorithms as Cos-ECMA and MGauss-ECMA, if the AM is that given by (10) and (11), respectively.
Hence, combining the ECMA cost function with the modified Gaussian AM term we get
with \(\beta \) a parameter that trades off between the ECMA and the MGauss terms.
5 Numerical Experiment
The mean square error (MSE) of the MGauss-ECMA is compared to that of the Cos-ECMA, together with that of the MMA and the ECMA. For comparison, high order 512-QAM symbols are randomly drawn, the equalizer length is set to L = 11 and channel
\(h=[1 \quad 0.1294+0.483j]^T\) is used to transmit these symbols under a signal to noise ratio; SNR \(=\) 40 dB.
The values of the parameters (\(\mu \), \(\beta \) and \(\sigma \)) used in the numerical implementation are \(\mu =6\times 10^{-9}\) and \(\mu =2\times 10^{-9}\) for MMA and ECMA, respectively. Whereas, for Cos-ECMA \(\mu =2\times 10^{-9}\) and \(\beta =1,000\) while for MGauss-ECMA \(\mu =2\times 10^{-9}\), \(\beta =100\) and \(\sigma =0.4\).
From Fig. 1, we can notice that the hybrid algorithm Gauss-ECMA has the lowest residual error at steady state (\(-18\) dB). It can also be seen that the Cos-ECMA has a lower residual error than that of ECMA and MMA.
6 Conclusion
The hybrid adaptive blind equalization algorithm combining the ECMA cost function and the modified Gaussian AM cost function (MGauss-ECMA) has been compared to the conventional MMA and ECMA algorithms as well as to hybrid algorithm combining the ECMA and squared cosine function (Cos-ECMA). The simulations performed for the high-order QAM modulation, namely 512-QAM, shows that the two hybrid versions perform much better than conventional ones. However, the MGauss-ECMA lead to lower MSE than the Cos-ECMA.
References
Godard, D.N.: Self-recovering equalization and carrier tracking in two-dimensional data communication systems. IEEE Trans. Commun. 28(11), 1867–1875 (1980)
Johnson, C.R., et al.: Blind equalization using the constant modulus criterion: a review. Proc. IEEE 86(10), 1927–1950 (1998)
Yang, J., et al.: The multi-modulus blind equalization algorithm. In: Proceedings of IEEE 13th International Conference on, Digital Signal Processing (2006).
Li, X.L., Zhang, X.D.: A family of generalized constant modulus algorithms for blind equalization. IEEE Trans. Commun. 54(11), 1913–1917 (2006)
Barbarossa, S., Scaglione, A.: Blind equalization using cost function matched to the signal constellation. In: Proceedings of Asilomar, pp. 550–554 (1997).
Beasley, A., Cole-Rhodes, A.: Blind adaptive equalization for QAM signals using an alphabet-matched algorithm. IEEE GLOBECOM (2006).
He, L., et al.: A hybrid adaptive blind equalization algorithm for QAM signals in wireless communications. IEEE Trans. Sig. Process. 52(7), 2058–2069 (2004)
Labed, A., et al.: New hybrid adaptive blind equalization algorithms for QAM signals. Proc. ICASSP 2809–2812 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Labed, A. (2014). Hybrid Algorithm for Blind Equalization of QAM Signals. In: Helber, S., et al. Operations Research Proceedings 2012. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-00795-3_71
Download citation
DOI: https://doi.org/10.1007/978-3-319-00795-3_71
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-00794-6
Online ISBN: 978-3-319-00795-3
eBook Packages: Business and EconomicsBusiness and Management (R0)