1. 中国科学技术大学电子工程与信息科学系,安徽,合肥,230027
2. 西南电子电信技术研究所,四川,成都,610041
3. 中国科学技术大学电子工程与信息科学系安徽合肥,230027
4. 西南电子电信技术研究所四川成都,610041
纸质出版:2008
移动端阅览
许小东, 路友荣, 戴旭初, 等. 自适应减少复杂度的盲最大似然序列估计[J]. 电子学报, 2008,36(10):2044-2048.
XU Xiao-dong, LU You-rong, DAI Xu-chu, et al. Adaptive Reduced-Complexity Blind Maximum Likelihood Sequence Estimation[J]. Acta Electronica Sinica, 2008, 36(10): 2044-2048.
基于逐幸存路径处理原理和自适应选择幸存路径的思想
本文提出了一种自适应减少计算复杂度的盲最大似然序列估计新算法.通过分析和推导
给出了一种近似估计网格图最小欧式距离的方法
并利用该估计值对幸存路径进行取舍
在网格搜索中仅保留少数幸存路径来进行信道参数和发送符号序列的联合盲估计.理论分析和计算机仿真结果表明
对严重符号干扰信道
在较高信噪比条件下
本文提出的新算法具有较理想的误符号率性能和较低的计算复杂度.
A novel algorithm for adaptive reduced-complexity blind maximum likelihood sequence estimation (MLSE) is proposed.Basic idea behind the proposed algorithm is the principle of per-survivor processing (PSP) and the adaptive selection of survivor path.The key feature of the proposed algorithm is that the minimum Euclidean distance in the trellis can adaptively be estimated
and then only a small number of the most likely survivors in the trellis are retained and utilized for joint channel and data estimation.Theoretical analysis and computer simulation results show that
for channels with severe intersymbol interference (ISI)
the proposed algorithm has higher performance in symbol error rate and lower computational complexity at high signal-to-noise ratios (SNR).
0
浏览量
1071
下载量
2
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621