Abstract
This brief presents an improved sorting architecture for ${K}$ -best multiple-input multiple-output (MIMO) detection. In the proposed architecture, two properties of the ${K}$ -best MIMO detection are exploited for simplifications: the order among siblings from the same parent node can be easily identified; the order among the ${K}$ -best nodes is dispensable. Besides, the generalized mergesort-based architecture for the ${K}$ -best sorting is presented so that the proposed sorter can be constructed for any power-of-two ${K}$ and modulation scheme. Compared to the conventional ones, the proposed architecture lowers not only the hardware complexity but also the latency significantly.
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 callMore From: IEEE Transactions on Circuits and Systems II: Express Briefs
Disclaimer: 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.
