Some convergence properties of Godards quartic algorithm

Convergence analysis on Godard's quartic (GQ) algorithm used for blind equalization is accomplished, The first main result is an explanation of the local behavior of the GQ algorithm around the global minimum point of the average performance function, From this result, we can determine the adaptation gain and compare the convergence rate with that of the decision directed (DD) algorithm. It is shown that the convergence rate of the GQ algorithm is faster than that of the DD equalization algorithm. The second main result is a description of the geometry of the average performance function: the region of attraction is observed to depend on the characteristics of the channel as well as the statistics of the input signal. It is shown that a good initial parameter vector of the GQ algorithm can be chosen based on the information of the geometry of the average performance function.
Publisher
ELSEVIER SCIENCE BV
Issue Date
1997-02
Language
ENG
Keywords

EQUALIZATION; EQUALIZERS

Citation

SIGNAL PROCESSING, v.56, no.3, pp.313 - 320

ISSN
0165-1684
DOI
10.1016/S0165-1684(96)00178-8
URI
http://hdl.handle.net/10203/5516
Appears in Collection
EE-Journal Papers(저널논문)
  • Hit : 330
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0