Convergence analysis of blind equalization algorithms using constellation-matching

Loading...
Thumbnail Image
Penn collection
Departmental Papers (ESE)
Degree type
Discipline
Subject
blind equalisers
convergence
constant modulus algorithm
constellation-matched error term
constellation-matching
convergence analysis
dynamic convergence behavior
generalized Sato algorithm
modified blind equalization algorithms
multimodulus algorithms
Adaptive equalizer
blind equalization algorithms
convergence analysis
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Contributor
Abstract

Two modified blind equalization algorithms are analyzed for performance. These algorithms add a constellation-matched error term to the cost functions of the generalized Sato and multimodulus algorithms. The dynamic convergence behavior and steady-state performance of these algorithms, and of a related version of the constant modulus algorithm, are characterized. The analysis establishes the improved performance of the proposed algorithms.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2008-11-25
Journal title
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Copyright 2008 IEEE. Reprinted from: Lin He; Kassam, S., "Convergence analysis of blind equalization algorithms using constellation-matching," Communications, IEEE Transactions on , vol.56, no.11, pp.1765-1768, November 2008 URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4686255&isnumber=4686252 This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
Recommended citation
Collection