.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
blind equalization
convergence analysis
convex optimization
SGBA
subgradient
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.9K
被引数:
1.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
Structural characterization of LDPE/EVA blends containing nanoclay‐flame retardant combinations
PREAI
分享收藏 没有更多内容
没有更多内容