检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机工程与应用》2013年第12期172-177,205,共7页Computer Engineering and Applications
摘 要:针对同频调制多路线性混合信号的单通道盲分离,根据自适应跟踪信道参数和逐幸存路径处理原理的思想,在基于LMS跟踪的M-PSP算法框架下,提出了一种能减小计算复杂度的RLS-RPSP算法。该算法利用多路RLS收敛速度快的特点,通过分段设置幸存路径数来保留幸存路径,既能实现对多路信道响应的同步跟踪,又无需对初始响应作任何粗估计。理论分析和仿真结果表明,在具有近似相同的误码率性能情况下,不论非时变或时变信道,新算法相比LMS跟踪下的M-PSP算法,至少能降低一半的运算复杂度。Aiming at the single-channel blind separation of the multi-channel co-frequency modulated linear mixed signal, a new algorithm called RLS-RPSP is proposed which can reduce the computation complexity. The proposed algorithm is according to the idea of adaptive tracking channel, the Per-Survivor Processing (PSP) algorithm, and the framework of M-PSP algorithm based on LMS algorithm. The survivor path can be reserved by piecewise setting the number of survivor path employing the fast convergence of multi-channel RLS algorithm. Therefore, the proposed algorithm not only can synchronously track the multiple channels, but also does not need any estimation of the initial response. The theoretical and simulation results show that, compared with the M-PSP algorithm based on LMS, the proposed algorithm can reduce at least half of the computational complexity when the bit error rates are approximately the same.
关 键 词:单通道盲分离 基于M算法的逐幸存路径处理算法(M-PSP) 多路递归最小二乘(RLS) 基于RLS算法的降复杂度 PSP算法(RLS—RPSP) 降低复杂度
分 类 号:TN911[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.147.83.1