Abstract
In K-best sphere decoding algorithm (KB), the number of survivor paths K, can be integer values in all tree levels. A certain complexity is provided for each value of K. In this letter, a variant of the K-best sphere decoding algorithm for uncoded MIMO channels is proposed, namely, flexible fractional K-best algorithm (FFKB). The FFKB provides a degree of freedom in complexity in-between the discreet complexities of the traditional KB. Through the offline calculations, the FFKB determines the best operation mode for KB relative to the hardware capability from the complexity point of view.
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.
