收录:
摘要:
An iterative list Branch and Bound (BB) algorithm based on the basic BB algorithm is proposed, which can obtain a candidate list to compute soft information that is used in the iterative detector. Furthermore, an improved algorithm is proposed which uses the prior information from the preceding iteration to calculate the lover bound and the candidate list is updated in each iteration. Simulation results show that the proposed list BB algorithm can achieve near capacity performance and the improved algorithm achieves good performance with smaller candidate list size. © 2007 IEEE.
关键词:
通讯作者信息:
电子邮件地址: