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

提出了一种适用于短突发信号的低复杂度基于FFT的信道盲辨识算法。算法基于MCR(minimum cross-relation)算法只需最小冗余度信息可求解出信道向量的特性，通过将其建立的线性方程经过FFT变换后再求解信道向量，并结合算法中的矩阵 的秩信息提出了一种快速阶数估计算法。仿真表明，该算法既克服了传统辨识算法对于短突发观测数据下性能不佳的缺点，又降低了原有基于FFT的信道盲辨识算法的复杂度和提升其对阶数的鲁棒性。

Low computational complexity FFT-based Blind Channel Identification Algorithm

A low computational complexity blind channel identification algorithm based on FFT was proposed for short burst signal. This algorithm was expoliting the property of the MCR algorithm only requiring minimum redundancy information to obtain the channel vector,then made the linear equations established by MCR algorithm through FFT to get the channel vector, a fast order estimation algorithm was proposed by expoliting the rank information of matrix .The simulation proved that the proposed algorithm could overcome the shortcoming of the traditional identification algorithms in condition of small observed data and reduce the computational complexity of the original FFT-based algorithm with improved robustness to order.