检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:尤明厚[1,2] 陶小峰[1,2] 崔琪楣[1,2] 张平[1,2]
机构地区:[1]北京邮电大学无线新技术研究所,北京100876 [2]泛网无线通信教育部重点实验室(北京邮电大学),北京100876
出 处:《电子与信息学报》2010年第7期1531-1537,共7页Journal of Electronics & Information Technology
基 金:国家973计划项目(2009CB320406);国家自然科学基金(60872048);国家科技重大专项(2008ZX03003-004;2009ZX03003-009)资助课题
摘 要:迭代树搜索(ITS)是一种有效的基于M-算法的软MIMO检测方案。然而ITS会遇到某些比特的对数似然比(LLR)无法确定的情况,虽可采用赋常数值方法(称为clipping)解决,但这会影响系统性能。为此,该文提出一种新的基于M-算法的软检测方案。该方案在树的每一级递推计算部分符号序列的后验概率,并基于此近似计算从第1级到该级的所有比特LLR,再采用M-算法保留部分符号序列延伸至下一级。该算法可确保每比特都可计算LLR,且能得到可靠性高的LLR值。考虑到某些比特LLR会多次计算,文中给出了算法的低复杂度实现。另外,该文还给出了一种计算符号序列后验概率的简单方法。最后,仿真结果表明所提算法相比ITS具有更好的性能,并使性能与复杂度达到较好的折中。Iterative Tree Search(ITS) is an efficient M-algorithm based soft MIMO detection scheme.However,ITS often faces the problem that Log-Likelihood Ratio(LLR) values of some detected bits can not be evaluated.Although it can be somewhat solved by setting the LLR magnitude for these bits to a constant value—LLR clipping,the system performance would be degraded.To overcome this problem,this paper presents a new M-algorithm based soft detection scheme.The scheme recursively calculates the a posterior probabilities of partial symbol sequences at each stage of the tree,based on which the LLRs of those bits from the first stage to the current one are approximately computed,and then,by using M-algorithm,retains partial symbol sequences and extends them to the next stage.The scheme can ensure that the LLR of each bit can be calculated,and provide highly reliable LLRs.Considering that the LLRs of some bits may be evaluated several times,a reduced-complexity implementation method is given in the paper.In addition,the paper suggests a simple approach for calculating the a posterior probabilities of symbol sequences.Finally,simulation results show that the proposed algorithm can obtain better performance than ITS and achieve good performance-complexity trade-off.
关 键 词:MIMO 软检测 M-算法 后验概率 比特对数似然比
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.74