«上一篇/Previous Article|本期目录/Table of Contents|下一篇/Next Article»

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:

34

期数:

2024年09期

页码:

77-81

栏目:

移动与物联网络

出版日期:

2024-09-10

文章信息/Info

Title:

Research and Optimization of Blind Channel Estimation Algorithm Based on Clustering

文章编号:

1673-629X(2024)09-0077-05

作者:

董福才1; 方承志1; 闫路洋2

1. 南京邮电大学 电子与光学工程学院、柔性电子(未来技术)学院,江苏 南京 210023;2. 中国联合网络通信有限公司 郑州市分公司,河南 郑州 450064

Author(s):

DONG Fu-cai1; FANG Cheng-zhi1; YAN Lu-yang2

1. School of Electronic and Optical Engineering & School of Flexible Electronics (Future Technology),Nanjing University of Posts and Telecommunications,Nanjing 210023,China;2. Zhengzhou Branch,China United Network Communications Corporation Limited,Zhengzhou 450064,China

关键词:

正交频分复用; 盲信道估计; 信道均衡; 聚类分析; K-means算法

Keywords:

orthogonal frequency division multiplexing; blind channel estimation; channel equalization; cluster analysis; K-means

分类号:

TP391.9;TN911.5

DOI:

10.20165/j.cnki.ISSN1673-629X.2024.0184

摘要:

正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)在现代通信系统中发挥着重要的作用,而信道估计是 OFDM 系统接收机的关键环节。 针对传统导频信道估计算法需要大量的导频开销,降低信道带宽利用率,以及已有的盲信道估计算法估计性能差且算法复杂度高等不足,该文提出了一种基于改进聚类算法的盲信道估计算法。 该算法在系统接收端把接收到信号看作一幅时频二维平面,通过使用时频窗口以迭代方式遍历该平面,在遍历过程中用改进的 K-means 算法对时频窗口内的符号数据做聚类分析,并根据符号先验信息以及信道时频相关性实现信道估计与均衡的目的。 通过计算机仿真实验结果表明,改进 K-means 的盲信道估计算法的误比特率整体上低于基于简单线性预编码的盲估计算法,当信噪比大于 10 dB 时,改进 K-means 的盲信道估计算法的误比特率比子空间方法更低。 在高信噪比情况下估计性能与最小均方误差(Minimum Mean Square Error,MMSE)估计算法相当。 因此,相较于已有的盲信道估计算法,改进 K-means 的盲信道估计算法提高了估计精度,降低了算法复杂度。

Abstract:

The Orthogonal Frequency Division Multiplexing plays an important role in the modern communication system,and the channel estimation is the key link of the OFDM system receiver. The traditional pilot channel estimation algorithm needs a lot of pilot overhead,which reduces the channel bandwidth utilization,and the existing blind channel estimation algorithms have poor estimation performance and high algorithm complexity. In view of these deficiencies, a blind channel estimation algorithm based on improved clustering algorithm is proposed. In this algorithm,the received signal is regarded as a time-frequency two-dimensional plane at the receiving end of the system,and the plane is traversed in an iterative manner by using a time-frequency window. In the traversal process,the symbol data in the time-frequency window are clustered by an improved K-means algorithm, and the channel estimation and equalization are realized according to the symbol prior information and the channel time-frequency correlation. The computer simulation results show that the bit error rate of the improved K-means blind channel estimation algorithm is lower than that of the blind channel estimation algorithm based on simple linear precoding. And the bit error rate of the improved K-means blind channel estimation algorithm is lower than that of the subspace method when the signal-to-noise ratio is greater than 10 dB. The estimation performance is equivalent to the Minimum Mean Square Error estimation algorithm in the case of high SNR. Therefore, compared with the existing blind channel estimation algorithms,the improved K-means blind channel estimation algorithm improves the estimation accuracy and reduces the complexity of the algorithm.

常用功能

更新日期/Last Update: 2024-09-10