.png){kind=icon}
Return
On the convergence of subgradient based blind equalization algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2006.03.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
SubGradient based Blind Algorithm (SGBA) has recently been introduced [A.T. Erdogan, C. Kizilkale, Fast and low complexity blind equalization via subgradient projections, IEEE Trans. Signal Process. 53 (2005) 2513-2524; C. Kizilkale, A.T. Erdogan, A fast blind equalization method based on subgradient projections, Proceedings of IEEE ICASSP 2004, Montreal, Canada, vol. 4, pp. 873-876.] as a convex and low complexity approach for the equalization of communications channels. In this article, we analyze the convergence behavior of the SGBA algorithm for the case where the relaxation rule is used for the step size. Our analysis shows that the monotonic convergence curve for the mean square distance to the optimal point is bounded between two geometric-series curves, and the convergence rate is dependent on the eigenvalues of the correlation matrix of channel outputs. We also provide some simulation examples for the verification of our analytical results related to the convergence behavior. (c) 2006 Elsevier B.V. All rights reserved.
Keywords:
blind equalization
convergence analysis
convex optimization
SGBA
subgradient
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
10.0K
Citations:
1.7W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
Structural characterization of LDPE/EVA blends containing nanoclay‐flame retardant combinations
PREAI
ShareSave no more
no more