A comparison of cyclostationary blind equalization algorithms in the mobile radio environment

✍ Scribed by Jon Altuna; Bernard Mulgrew

• Publisher: John Wiley and Sons
• Year: 1998
• Tongue: English
• Weight: 154 KB
• Volume: 12
• Category: Article
• ISSN: 0890-6327
• DOI: 10.1002/(sici)1099-1115(199805)12:3<267::aid-acs478>3.0.co;2-7

✦ Synopsis

In this paper we address the problem of blind equalization in the mobile radio environment using cyclostationary techniques, where the channel is generally non-minimum phase and the phase information of the system has to be preserved. Conventional second-order statistics applied to the received signal sampled at the symbol rate do not preserve phase information and therefore cannot be applied to identify separate minimum-phase and maximum-phase zeros of the channel. It has been shown that phase information can be preserved using only second-order statistics if the received signal is sampled using fractionally spaced sampling. This paper deals with the issue of how the convergence of the cyclostationary blind equalization algorithms compares to conventional supervised methods in the pan-European mobile radio system GSM. The results suggest that the convergence speed of some of the actual cyclostationary algorithms is fast for stationary channels but slow compared to conventional supervised non-adaptive (LS) and adaptive (LMS) algorithms in time-varying mobile radio channels. ?