检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]信息工程大学信息系统工程学院,河南郑州450000
出 处:《电子学报》2016年第3期633-638,共6页Acta Electronica Sinica
基 金:国家自然科学基金(No.61072046)
摘 要:针对信道记忆长度较大时,成对载波多址(Paired Carrier Multiple Access,PCMA)混合信号单通道盲分离复杂度高的问题,本文提出一种新型的减状态判决反馈前馈逐幸存路径处理(Reduced-State Decision Feedback-Feedforward Per-Survivor Processing,RSDFF-PSP)分离算法.该算法先利用截短逐幸存路径处理(Per-Survivor Processing,PSP)算法得到预判决,忽略掉前导和后尾干扰的影响,将复杂度控制在能够容忍的范围内;然后分别设计全局判决反馈滤波器和延时判决前馈滤波器,利用分支路径度量的预判决结果反馈以及延时前馈来补偿前导和后尾干扰带来的性能损失,并结合二次判决获得了更佳的分离性能.仿真实验结果表明,RSDFF-PSP算法在减少复杂度的同时能够最大限度地得到逐幸存路径处理最大似然序列估计(Per-Survivor Processing Maximum Likelihood Sequence Estimation,PSP-MLSE)的性能,实现复杂度和性能的良好折中.A reduced-state,decision feedback-feedforw ard per-survivor processing( RSDFF-PSP) separation algorithm is proposed for the paired carrier multiple access( PCM A) single channel blind separation w hich has high computational complexity w ith long channel memory. In the algorithm,the truncated PSP algorithm is employed to obtain the preliminary decisions,the pre-and post-cursors are ignored to control complexity. Then the global decision feedback and delayed decision feedforw ard filters are designed to process the pre-and post-cursors. M oreover,the second decision is combined to obtain better performance. Simulation results illustrate that the proposed algorithm can provide the tradeoff betw een complexity and performance,w hich has nearly the same performance as that of the per-survivor processing maximum likelihood sequence estimation( PSP-M LSE) w hile reducing the complexity.
关 键 词:成对载波多址 单通道盲分离 判决反馈前馈 逐幸存路径处理
分 类 号:TN911[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3