A survey of VLSI implementations of tree search algorithms for MIMO detection
A survey of VLSI implementations of tree search algorithms for MIMO detection
Multiple-input multiple-output (MIMO) detection algorithms have received considerable research interest in recent years, as a result of the increasing need for high data-rate communications. Detection techniques range from the low-complexity linear detectors to the maximum likelihood detector, which scales exponentially with the number of transmit antennas. In between these two extremes are the tree search (TS) algorithms, such as the popular sphere decoder, which have emerged as attractive choices for implementing MIMO detection, due to their excellent performance-complexity trade-offs. In this paper, we survey some of the state-of-the-art VLSI implementations of TS algorithms and compare their results using various metrics such as the throughput and power consumption. We also present notable contributions that have been made in the last three decades in implementing TS algorithms for MIMO detection, especially with respect to achieving low-complexity, high-throughput designs. Finally, a number of design considerations and trade-offs for implementing MIMO detectors in hardware are presented.
3644-3674
Bello, Ibrahim
b9ef7b75-b7eb-435d-a4e5-186f48f328ea
Halak, Basel
8221f839-0dfd-4f81-9865-37def5f79f33
El-Hajjar, Mohammed
3a829028-a427-4123-b885-2bab81a44b6f
Zwolinski, Mark
adfcb8e7-877f-4bd7-9b55-7553b6cb3ea0
October 2016
Bello, Ibrahim
b9ef7b75-b7eb-435d-a4e5-186f48f328ea
Halak, Basel
8221f839-0dfd-4f81-9865-37def5f79f33
El-Hajjar, Mohammed
3a829028-a427-4123-b885-2bab81a44b6f
Zwolinski, Mark
adfcb8e7-877f-4bd7-9b55-7553b6cb3ea0
Bello, Ibrahim, Halak, Basel, El-Hajjar, Mohammed and Zwolinski, Mark
(2016)
A survey of VLSI implementations of tree search algorithms for MIMO detection.
Circuits Systems and Signal Processing, 35 (10), .
(doi:10.1007/s00034-015-0218-y).
Abstract
Multiple-input multiple-output (MIMO) detection algorithms have received considerable research interest in recent years, as a result of the increasing need for high data-rate communications. Detection techniques range from the low-complexity linear detectors to the maximum likelihood detector, which scales exponentially with the number of transmit antennas. In between these two extremes are the tree search (TS) algorithms, such as the popular sphere decoder, which have emerged as attractive choices for implementing MIMO detection, due to their excellent performance-complexity trade-offs. In this paper, we survey some of the state-of-the-art VLSI implementations of TS algorithms and compare their results using various metrics such as the throughput and power consumption. We also present notable contributions that have been made in the last three decades in implementing TS algorithms for MIMO detection, especially with respect to achieving low-complexity, high-throughput designs. Finally, a number of design considerations and trade-offs for implementing MIMO detectors in hardware are presented.
Text
A Survey of VLSI Implementations of Tree Search Algorithms for MIMO Detection.pdf
- Accepted Manuscript
Text
art_10.1007_s00034-015-0218-y.pdf
- Version of Record
More information
Accepted/In Press date: 29 November 2015
e-pub ahead of print date: 30 December 2015
Published date: October 2016
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 385873
URI: http://eprints.soton.ac.uk/id/eprint/385873
ISSN: 0278-081X
PURE UUID: a6866783-eb3a-435e-8907-195297ae1039
Catalogue record
Date deposited: 13 Jan 2016 17:07
Last modified: 15 Mar 2024 03:42
Export record
Altmetrics
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics
