The constant modulus adaptive blind equalization algorithms presented in this paper are shown to correspond to an error performance surface which is much improved upon that of existing algorithms such as the wellknown constant modulus (or Godard) algorithm. Many undesirable local solutions (ULSs) ar
β¦ LIBER β¦
Blind channel equalization and ϵ-approximation algorithms
β Scribed by Qingyu Li; Er-Wei Bai; Yinyu Ye
- Book ID
- 118691176
- Publisher
- IEEE
- Year
- 2001
- Tongue
- English
- Weight
- 226 KB
- Volume
- 49
- Category
- Article
- ISSN
- 1053-587X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Soft constraint satisfaction (SCS) blind
β
OΔuz Tanrikulu; Buyurman Baykal; Anthony G. Constantinides; Jonathon A. Chambers
π
Article
π
1998
π
John Wiley and Sons
π
English
β 261 KB
Channel estimation standard and adaptive
β
Yuang Lou
π
Article
π
1995
π
IEEE
π
English
β 430 KB
Unbiased blind adaptive channel identifi
β
Gesbert, D.; Duhamel, P.
π
Article
π
2000
π
IEEE
π
English
β 231 KB
Convergence of stochastic-approximation-
β
Han-Fu Chen; Xi-Ren Cao; Jie Zhu
π
Article
π
2002
π
IEEE
π
English
β 516 KB
Blind channel identification via stochas
β
G. Yin; Han-Fu Chen
π
Article
π
2002
π
Elsevier Science
π
English
β 141 KB
This work is devoted to the study of a class of recursive algorithms for blind channel identiΓΏcation. Using weak convergence methods, the convergence of the algorithm is obtained and the rate of convergence is ascertained. The technique discussed can also be used in the analysis of rates of converge
The expectation-maximization Viterbi alg
β
Nguyen, H.; Levy, B.C.
π
Article
π
2005
π
IEEE
π
English
β 396 KB