Algorithm and implementation of the K-best sphere decoding for MIMO detection

By Zhan Guo, Peter Nilsson. IEEE Journal on Selected Areas in Communications, 2006

746 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs (2015, methodology): “[63], [448] Proposed and implemented both hard and soft SE-strategy based K-best tree-search MIMO detectors, which are capable of supporting up to 53.”
Deep MIMO detection (2017, methodology): “Consequently, several modified search algorithms have been purposed, offering improved complexity performance [3][4].”
Channel Estimation for OFDM (2014, background): “has several variants (see [161] for more detailed information).”
Learning to Detect (2018, methodology): “In the high accuracy regime, sphere decoding algorithms [2], [3], [4] were proposed, based on lattice search, and offering better computational complexity with a rather low ac-”
Experimental Demonstration of 50-Mb/s Visible Light Communications Using 4 $\,\times\,$ 4 MIMO (2014, methodology): “Other standard MIMO techniques such as the sphere decoding with maximum likelihood detector [14] as well as the lattice-reduction-aided detection [15] are available but are also not considered here.”
Fixing the Complexity of the Sphere Decoder for MIMO Detection (2008, methodology): “• Application of the K-Best lattice decoder [11] (equivalent to the sequential M-algorithm [12]).”