Abstract
New sphere decoding algorithms are proposed in this paper. In particular an iterative list branch and bound (BB) algorithm based on the basic BB algorithm is proposed in this paper, 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 lower bound and the candidate list is updated every 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
