University of Surrey

Test tubes in the lab Research in the ATI Dance Research

MultiSphere: Massively Parallel Tree Search for Large Sphere Decoders

Nikitopoulos, K, Chatzipanagiotis, D, Jayawardena, C and Tafazolli, R (2016) MultiSphere: Massively Parallel Tree Search for Large Sphere Decoders In: IEEE GLOBECOM 2016, 2016-12-04 - 2016-12-08, Washington, DC.

[img]
Preview
Text
Multisphere_submitted120416.pdf - Accepted version Manuscript
Available under License : See the attached licence file.

Download (412kB) | Preview
[img]
Preview
PDF (licence)
SRI_deposit_agreement.pdf
Available under License : See the attached licence file.

Download (33kB) | Preview

Abstract

—This work introduces MultiSphere, a method to massively parallelize the tree search of large sphere decoders in a nearly-independent manner, without compromising their maximum-likelihood performance, and by keeping the overall processing complexity at the levels of highly-optimized sequential sphere decoders. MultiSphere employs a novel sphere decoder tree partitioning which can adjust to the transmission channel with a small latency overhead. It also utilizes a new method to distribute nodes to parallel sphere decoders and a new tree traversal and enumeration strategy which minimize redundant computations despite the nearly-independent parallel processing of the subtrees. For an 8 × 8 MIMO spatially multiplexed system with 16-QAM modulation and 32 processing elements MultiSphere can achieve a latency reduction of more than an order of magnitude, approaching the processing latency of linear detection methods, while its overall complexity can be even smaller than the complexity of well-known sequential sphere decoders. For 8×8 MIMO systems, MultiSphere’s sphere decoder tree partitioning method can achieve the processing latency of other partitioning schemes by using half of the processing elements. In addition, it is shown that for a multi-carrier system with 64 subcarriers, when performing sequential detection across subcarriers and using MultiSphere with 8 processing elements to parallelize detection, a smaller processing latency is achieved than when parallelizing the detection process by using a single processing element per subcarrier (64 in total).

Item Type: Conference or Workshop Item (Conference Paper)
Subjects : Electronic Engineering
Authors :
AuthorsEmailORCID
Nikitopoulos, KUNSPECIFIEDUNSPECIFIED
Chatzipanagiotis, DUNSPECIFIEDUNSPECIFIED
Jayawardena, CUNSPECIFIEDUNSPECIFIED
Tafazolli, RUNSPECIFIEDUNSPECIFIED
Date : 2016
Copyright Disclaimer : © 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Contributors :
ContributionNameEmailORCID
UNSPECIFIEDIEEE, UNSPECIFIEDUNSPECIFIED
Uncontrolled Keywords : Sphere Decoding, Parallel Processing, Large Multiple-Input–Multiple-Output (MIMO), Lattice Search.
Related URLs :
Depositing User : Symplectic Elements
Date Deposited : 05 Jul 2016 16:15
Last Modified : 05 Jul 2016 16:15
URI: http://epubs.surrey.ac.uk/id/eprint/811116

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800