| Title |
Blind Equalization Schemes
with Different Error Equations |
| Author(s) |
Pulakesh Roy and A.
A. (Louis) Beex |
| Document Type |
Conference Proceeding |
| Conference |
2000 IEEE International
Symposium on Intelligent Signal Processing and Communication
Systems (ISPACS 2000) |
| Publication Information |
Volume 2, Pages 835
- 840 |
| Conference Date |
5 - 8 November 2000 |
| Document Download |
Available
Copyright Information: This publication
has been posted here to ensure timely dissemination
of scholarly and technical work. Copyright and all
rights therein are retained by authors or by other
copyright holders. All persons copying this information
are expected to adhere to the terms and constraints
invoked by each author's copyright. In most cases,
these works may not be reposted without the explicit
permission of the copyright holder.
|
| Abstract |
A general problem
with blind adaptation techniques is that they have poor
convergence properties compared to the traditional techniques
using training sequences. Having a multi-modal cost
surface, blind adaptation techniques may force the equalizer
to converge to a false minimum, depending on the initialization
. The most commonly used blind adaptation algorihtm
is the Constant Modulus Algorithm (CMA). In our
simulations a logarithmic error equation causes CMA
to converge to a global minimum when a differential
encoding scheme is used. The convergence rates of CMA
with different error equations were also investigated
for a symmetric channel. |
| Keywords |
n/a |
| Related Publications |
n/a |
| Related Project |
n/a |