VLSI implementation of MIMO detection using the sphere decoding algorithm

By Andreas Peter Burg, Moritz Borgmann, Markus Wenk, Martin Zellweger, W. Fichtner, Helmut Bölcskei. IEEE Journal of Solid-State Circuits, 2005

645 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.

Algorithm and implementation of the K-best sphere decoding for MIMO detection (2006, methodology): “The decoding throughput of [27] is variable due to employing the sequential SE type of algorithm.”
Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs (2015, background): “There exist a number of other variants of the tree-search based MIMO detectors, which mainly fall into three categories: the depth-first tree-search detector [53], [54], [57]–[61], [80], [82], [319], the breadth-first tree-search detector [62]–[64], [320] and the best-first tree-search detector [68]”
Fixing the Complexity of the Sphere Decoder for MIMO Detection (2008, methodology): “throughput) of any hardware implementation of the SD as shown in [14], [17].”
Large-Scale MIMO Detection for 3GPP LTE: Algorithms and FPGA Implementations (2014, background): “tion [13]–[15] or soft-output sphere decoding (SD) [16]–[18],”
Soft-output sphere decoding: algorithms and VLSI implementation (2008, methodology): “Since the proposed max-log STS SESD VLSI implementation is based on the one-node-per-cycle (ONPC) VLSI architecture developed in [16] for hard-output SESD, we start our discussion by briefly reviewing relevant aspects of [16].”