一种基于FFT低复杂度的信道盲辨识算法  

Low Computational Complexity FFT-Based Blind Channel Identification Algorithm

作　　者：孙有铭[1] 刘洛琨[1] 杨正举[1] 郭虹[1] 

机构地区：[1]解放军信息工程大学信息系统工程学院,郑州450002

出　　处：《数据采集与处理》2014年第3期378-383,共6页Journal of Data Acquisition and Processing

基　　金：国家高技术研究发展计划("八六三"计划)(2009AA011205)资助项目

摘　　要：提出了一种适用于短突发信号的低复杂度基于FFT的信道盲辨识算法。算法基于最小C-R(Minimum cross-relation,MCR)算法只需最小冗余度信息可求解出信道向量的特性,通过将其建立的线性方程经过FFT变换后再求解信道向量,并结合算法中矩阵Fy的秩信息提出了一种快速阶数估计算法。仿真表明,该算法克服了传统辨识算法对于短突发观测数据下性能不佳的缺点,降低了原有基于FFT的信道盲辨识算法的复杂度,同时提升其对阶数的鲁棒性。A low computational complexity blind channel identification algorithm based on FFT is proposed for short burst signal.The algorithm expolits the property of minimum crossrelation （MCR） algorithm to obtain the channel vector with only minimum redundancy information,then establishes linear equations by MCR algorithm through FFT to get the channel vector,therefore,a fast order estimation algorithm is proposed by expoliting the rank information of matrix Fy.The simulation proves that the proposed algorithm can improve the low performance of traditional identification algorithms on the condition of small observed data,reduce the computational complexity of the original FFT-based algorithm,and improve robustness to order estimation.

关 键 词：信道盲辨识 最小C-R算法 短突发信号 阶数估计 

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