适用于航空信道的并行STWQ信道估计算法  

A Parallel STWQ Channel Estimation Algorithm Fit for Aeronautic Channel

作　　者：何剑[1] 王永生[1] 胡锦涛[1] 姚如贵[1] 

机构地区：[1]西北工业大学电子信息学院,陕西西安710072

出　　处：《计算机仿真》2008年第9期43-45,92,共4页Computer Simulation

基　　金：十一.五预研项目(513250404);航天科技创新基金(N7CH0001);航空基金资助项目(2007ZC53030)

摘　　要：通过对航空信道的分析,指出其稀疏信道特征,使用普通算法对此信道进行信道估计会引入高阶自适应计算,为加快收敛速度、降低实现难度,提出了一种"并行STWQ(scrub taps waiting in a queue)信道估计算法",通过一定规律将所有抽头分组,每组单独完成STWQ算法,最终可以得到非零抽头的位置和其权值。针对具体应用给出算法的性能仿真结果,证明了算法在满足相同的性能要求时,可避免高阶自适应计算,节约了大量权值可忽略抽头所引入的资源占用和计算量,且搜索非零抽头所耗时间比STWQ算法成倍减少,可更好跟踪快变的稀疏信道。By analyzing the aeronautic channel,it is known that the channel has the ability of sparseness.Using the common channel estimation will bring out high-order adaptive signal process.To speed the convergence and relieve the difficulty of realization,the paper describes a new algorithm of parallel STWQ（scrub taps waiting in a queue）on channel estimation.The algorithm is to divide all taps into several groups as a rule at first,next,the STWQ algorithm is carried out for every group,finally,the list of non-zero taps can be found and their value can be got.The simulation results prove that less resource and calculation are used to meet the same ability requirement.The time for searching non-zero tap using new algorithm is sometimes shorter than that using STWQ algorithm.So the algorithm can trace channel variation better.

关 键 词：航空信道 稀疏信道 非零抽头 有效抽头 待选抽头等待队列 

分 类 号：TN911.7[电子电信—通信与信息系统]