The University of Southampton
University of Southampton Institutional Repository

VLSI Implementation of a Scalable K-best MIMO Detector

VLSI Implementation of a Scalable K-best MIMO Detector
VLSI Implementation of a Scalable K-best MIMO Detector
Multiple-input multiple-output (MIMO) communication systems enable high data rates to be achieved compared to single-antenna systems, however, they also incur a huge complexity cost at the receiver. For tree search MIMO detection techniques such as the K-best algorithm, the critical path length of the detector is also found to scale linearly with the number of antennas, which limits the maximum clock frequency that can be achieved especially at larger MIMO dimensions. In this paper, we present a novel K-best architecture that incurs a fixed critical path length irrespective of the number of antennas.
This is achieved by incrementally computing the interference terms of previously detected symbols rather than computing them at once like in the conventional K-best detector. Synthesis results show that the optimized detector achieves approximately a 2× maximum clock frequency improvement compared with the conventional K-best implementation. We also present an approximate sorting algorithm that determines the best candidates with a low complexity. The proposed K-best detector is implemented for a 4 × 4 64-QAM MIMO system using a folded architecture and a single core is able to achieve a throughput of 300 Mbps and an energy efficiency of 83.39 nJ/bit [query-pJ/bit], which compares favourably with other folded architectures in the literature.
Bello, Ibrahim A.
23297306-2748-4352-9c82-c9cec77b06fc
Halak, Basel
8221f839-0dfd-4f81-9865-37def5f79f33
El-Hajjar, Mohammed
3a829028-a427-4123-b885-2bab81a44b6f
Zwolinski, Mark
adfcb8e7-877f-4bd7-9b55-7553b6cb3ea0
Bello, Ibrahim A.
23297306-2748-4352-9c82-c9cec77b06fc
Halak, Basel
8221f839-0dfd-4f81-9865-37def5f79f33
El-Hajjar, Mohammed
3a829028-a427-4123-b885-2bab81a44b6f
Zwolinski, Mark
adfcb8e7-877f-4bd7-9b55-7553b6cb3ea0

Bello, Ibrahim A., Halak, Basel, El-Hajjar, Mohammed and Zwolinski, Mark (2015) VLSI Implementation of a Scalable K-best MIMO Detector. At The 15th International Symposium on Communications and Information Technologies (ISCIT 2015) (01/10/15) The 15th International Symposium on Communications and Information Technologies (ISCIT 2015), Japan. (doi:10.1109/ISCIT.2015.7458362).

Record type: Conference or Workshop Item (Paper)

Abstract

Multiple-input multiple-output (MIMO) communication systems enable high data rates to be achieved compared to single-antenna systems, however, they also incur a huge complexity cost at the receiver. For tree search MIMO detection techniques such as the K-best algorithm, the critical path length of the detector is also found to scale linearly with the number of antennas, which limits the maximum clock frequency that can be achieved especially at larger MIMO dimensions. In this paper, we present a novel K-best architecture that incurs a fixed critical path length irrespective of the number of antennas.
This is achieved by incrementally computing the interference terms of previously detected symbols rather than computing them at once like in the conventional K-best detector. Synthesis results show that the optimized detector achieves approximately a 2× maximum clock frequency improvement compared with the conventional K-best implementation. We also present an approximate sorting algorithm that determines the best candidates with a low complexity. The proposed K-best detector is implemented for a 4 × 4 64-QAM MIMO system using a folded architecture and a single core is able to achieve a throughput of 300 Mbps and an energy efficiency of 83.39 nJ/bit [query-pJ/bit], which compares favourably with other folded architectures in the literature.

Full text not available from this repository.

More information

Published date: October 2015
Venue - Dates: The 15th International Symposium on Communications and Information Technologies (ISCIT 2015), Japan, 2015-10-01
Organisations: EEE

Identifiers

Local EPrints ID: 379692
URI: https://eprints.soton.ac.uk/id/eprint/379692
PURE UUID: 82704876-3839-4d1f-8373-d4927cee4233
ORCID for Basel Halak: ORCID iD orcid.org/0000-0003-3470-7226
ORCID for Mohammed El-Hajjar: ORCID iD orcid.org/0000-0002-7987-1401
ORCID for Mark Zwolinski: ORCID iD orcid.org/0000-0002-2230-625X

Catalogue record

Date deposited: 27 Jul 2015 13:18
Last modified: 17 Aug 2018 00:35

Export record

Altmetrics

Contributors

Author: Ibrahim A. Bello
Author: Basel Halak ORCID iD
Author: Mohammed El-Hajjar ORCID iD
Author: Mark Zwolinski ORCID iD

University divisions

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×