摘要
提出了基于列表的迭代分枝定界算法,利用搜索到的候选列表计算比特软信息,降低了最大后验概率检测的计算复杂度,同时进一步提出了考虑先验信息的迭代分枝定界算法.仿真结果表明,列表迭代分枝定界算法通过在多入多出(MIMO)信道检测和信道解码之间传递外信息,取得了逼近信道容量的性能,而修正的迭代分枝定界算法以小的候选列表大小,同样取得了好的性能.
An iterative list branch and bound algorithm is proposed in multiple input multiple output detection（MIMO）, which adopts searched candidate list to compute soft information and reduces computation complexity of maximum likelihood detection. Furthermore, an improved algorithm that considers the prior information is proposed. Simulation results show that the proposed iterative algorithm can achieve near-capacity performance by exchanging extrinsic information between MIMO channel detection and channel decoding. The improved algorithm achieves good performance with smaller candidate list size.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
2006年第5期50-53,共4页
Journal of Beijing University of Posts and Telecommunications
基金
国家"863计划"项目(2001AA123016)
关键词
多入多出系统
分枝定界算法
迭代检测
multiple input multiple output
branch-and-bound algorithm
iterative detector
