Evaluation of three algorithms used in blind equalization

Pao Yue-kong Library Electronic Theses Database

Evaluation of three algorithms used in blind equalization

 

Author: Chan, Cheuk-lam
Title: Evaluation of three algorithms used in blind equalization
Degree: M.Sc.
Year: 1998
Subject: Equalizers (Electronics)
Algorithms
Hong Kong Polytechnic University -- Dissertations
Department: Multi-disciplinary Studies
Dept. of Electronic Engineering
Pages: x, 105 leaves : ill. ; 30 cm
Language: English
InnoPac Record: http://library.polyu.edu.hk/record=b1441873
URI: http://theses.lib.polyu.edu.hk/handle/200/3760
Abstract: Most of the adaptive equalization methods require the initial training sequence. But in some cases, it is not possible to use the training sequence. As blind equalization schemes do not require the training sequence, blind equalizer can be used to achieve this goal. There are several types of blind equalization methods. However, the basic blind equalization method is the Constant Modulus Algorithm (CMA). Based on the Constant Modulus Algorithm, it is possible to develop other algorithms that can achieve better performance by increasing the system complexity. Three blind equalization algorithms - Least Mean Square Constant Modulus Algorithm (LMS-CMA), Fast Quasi-Newton Constant Modulus Algorithm (FQN-CMA), Conjugated Gradient Constant Modulus Algorithm (CG-CMA) - are studied. The relationship between the parameters and the performance are investigated. The FQN-CMA gives the shortest adaptation time and the fastest initial convergence rate. The LMS-CMA gives the longest adaptation time and slowest initial convergence rate while the CG-CMA gives the best compromise amongst these three algorithms. A Modified Conjugated Gradient Constant Modulus Algorithm (MCG-CMA) is the enhancement algorithm of the CG-CMA. The MCG-CMA can achieve similar performance as the CG-CMA with reducing the computational power. The study of optimum value of step size is suggested for further study for the MCG-CMA.

Files in this item

Files Size Format
b14418733.pdf 5.880Mb PDF
Copyright Undertaking
As a bona fide Library user, I declare that:
  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

     

Quick Search

Browse

More Information