Open Science Research Excellence

Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29526

Select areas to restrict search in scientific publication database:
Efficient Variants of Square Contour Algorithm for Blind Equalization of QAM Signals
A new distance-adjusted approach is proposed in which static square contours are defined around an estimated symbol in a QAM constellation, which create regions that correspond to fixed step sizes and weighting factors. As a result, the equalizer tap adjustment consists of a linearly weighted sum of adaptation criteria that is scaled by a variable step size. This approach is the basis of two new algorithms: the Variable step size Square Contour Algorithm (VSCA) and the Variable step size Square Contour Decision-Directed Algorithm (VSDA). The proposed schemes are compared with existing blind equalization algorithms in the SCA family in terms of convergence speed, constellation eye opening and residual ISI suppression. Simulation results for 64-QAM signaling over empirically derived microwave radio channels confirm the efficacy of the proposed algorithms. An RTL implementation of the blind adaptive equalizer based on the proposed schemes is presented and the system is configured to operate in VSCA error signal mode, for square QAM signals up to 64-QAM.
Digital Object Identifier (DOI):


[1] D. Godard, Self recovering equalization and carrier tracking in twodimensional data communication systems, IEEE Trans. Commun. COM-28(1980) 1867-1875.
[2] J. R. Treichler, B. G. Agee, A new approach to multipath correction of constant modulus signals, IEEE Trans. on Acoust., Speech, Signal Processing ASSP-31 (2) (1983) 459-472
[3] S. U. H. Qureshi, Adaptive equalization, Proceedings of the IEEE 73 (9) (1985)1349-1387.
[4] J. Liu, X. Lin, Equalization in high-speed communication systems, IEEE Circuits and Systems Magazine (2004) 4-17.
[5] J. J. Shynk, R. P. Gooch, G. Krishnamurthy, C. K. Chan, A comparative performance study of several blind equalization algorithms, SPIE 1565 (1991)102-117.
[6] J.-J. Werner, J. Yang, D. Harman, G. A. Dumont, Blind equalization for broadband access, IEEE Communications Magazine (1999) 87-93.
[7] J. Yang, J.-J. Werner, G. A. Dumont, The multimodulus blind equalization and its generalized algorithms, IEEE Journal on selected areas in communication 20 (5) (2002) 997-1015.
[8] J. Yang, J.-J. Werner, G. A. Dumont, The multimodulus blind equalization algorithm, in: Proc. Int. Conf. on Digital Signal Processing, 1997, pp. 127-130.
[9] Y. Sato, A method of self-recovering equalization for multilevel amplitude-modulation systems, IEEE Trans. Commun. COM-23 (1975)679-682.
[10] T. Thaiupatump, S.A. Kassam, Square contour algorithm: A new algorithm for blind equalization and carrier phase recovery, in: Proc. 37th Asilomar Conference on Signals, Systems and Computers, 2003, pp. 647-651.
[11] T. Thaiupatump, L. He, S.A. Kassam, Square contour algorithm for blind equalization of QAM signals, Signal Process. 86 (11) (2006) 3357-3370.
[12] K. Banovic, E. Abdel-Raheem, M. A. S. Khalid, A novel radiusadjusted approach for blind adaptive equalization, IEEE Signal Processing Letters 13 (1) (2006) 37-40.
[13] F. C. C. De Castro, M. C. F. De Castro, and D. S. Arantes, "Concurrent blind deconvolution for channel equalization," in Proc. ICC, Helsinki, Finland, Jun. 2001, pp. 366-371.
[14] A configurable fractionally-spaced blind adaptive equalizer for QAM demodulators Digital Signal Processing, Volume 17, Issue 6, November 2007, Pages 1071-1088. Kevin Banović, Mohammed A.S. Khalid, Esam Abdel-Raheem.
Vol:13 No:04 2019Vol:13 No:03 2019Vol:13 No:02 2019Vol:13 No:01 2019
Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007