Abstract
Sphere Decoders (SD) have found more popularity among other MIMO detectors because of their close-to-ML error-rate performance and lower hardware complexity. One of the variants of SD is the K-best algorithm. The conventional implementations of K-best are not fast enough to be considered for hardware implementation of the emerging standards like 802.11n because of the throughput bottleneck which is the sort operation. In this work we have proposed the parallel merge algorithm (PMA), which enables us to use more pipeline levels in the system because of its short critical path, resulting in throughput increase, about 4 times compared to the other K-best implementations. Also, we have modified the K-best algorithm by discarding the calculation of unnecessary paths ,which results in a 20% decrease in area and 44% decrease in the number of operations compared to the original K-best.
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.
