2014
DOI: 10.1109/tcomm.2014.2367013
|View full text |Cite
|
Sign up to set email alerts
|

A Dominance-Based Soft-Input Soft-Output MIMO Detector With Near-Optimal Performance

Abstract: Iterative detection-and-decoding for multi-input multi-output (MIMO) communication systems require a soft-input soft-output (SISO) detection algorithm, which, in the optimal formulation, is well known to be exponentially complex in the number of transmitting antennas. This paper presents a novel SISO detector for MIMO systems, named SISO king decoder. It is a tree-search branch-and-bound algorithm, which exploits the properties of the channel matrix and the a-priori information on the transmitted bits to reduc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
10
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 22 publications
(10 citation statements)
references
References 51 publications
(97 reference statements)
0
10
0
Order By: Relevance
“…Recovering multiplexed data from signals received by many antennas in an optimal manner requires tremendously high amount of computations, so the reduction of detection complexity has been a great concern for utilizing the massive MIMO technique in practical communication systems [3,4]. As an approach to reduce the detection complexity, suboptimal linear detection algorithms have been intensively studied [7,[16][17][18][19][20][21][22][23][24][25][26], where matched filter (MF) detection, zero forcing (ZF) detection and minimum mean squared error (MMSE) detection are well known examples. Nevertheless, these linear detection schemes cannot lower the computational complexity of the massive MIMO receiver to an acceptable level because the inversion of high dimensional matrices is still required.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Recovering multiplexed data from signals received by many antennas in an optimal manner requires tremendously high amount of computations, so the reduction of detection complexity has been a great concern for utilizing the massive MIMO technique in practical communication systems [3,4]. As an approach to reduce the detection complexity, suboptimal linear detection algorithms have been intensively studied [7,[16][17][18][19][20][21][22][23][24][25][26], where matched filter (MF) detection, zero forcing (ZF) detection and minimum mean squared error (MMSE) detection are well known examples. Nevertheless, these linear detection schemes cannot lower the computational complexity of the massive MIMO receiver to an acceptable level because the inversion of high dimensional matrices is still required.…”
Section: Introductionmentioning
confidence: 99%
“…Then, low complexity detection algorithms based on approximate matrix inversion [18,19], low complexity factor graph (FG) based belief propagation (BP) algorithms [20][21][22] and pairwise Markov random fields (MRF) based MIMO detection algorithms [20,21] have been proposed. Tree-searching soft-input soft-output (SISO) MIMO detection algorithms have also been proposed in various forms [23][24][25][26]. The FG based BP detection with Gaussian approximation of interference (GAI), called FG-GAI BP detector, was proposed as one of the promising solutions to reduce the computational complexity of the massive MIMO receiver to the practically allowable level [21,22].…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, to obtain a channel capacity close to the Shannon limit, a new kind of MIMO system, known as the Turbo-MIMO system that is based on bit-interleaved coded modulation, was investigated by Sellathurai and Haykin [5]. Endowed with turbo learning principle [6], these iterative receivers make detection and decoding by exchanging soft bits information mutually, which lets them approach approximately optimal performance with in a computationally feasible manner [5] [7][8][9][10][11].…”
Section: Introductionmentioning
confidence: 99%
“…Specifically, the complexity for the QRD-M increases exponentially when the modulation order is high, due to tree structures. In [19][20][21][22], many detection algorithms were developed to reduce the complexity for tree search algorithms. In [19][20][21], the proposed algorithms are based on sphere decoding (SD) and K-best decoding.…”
Section: Introductionmentioning
confidence: 99%
“…In [19][20][21][22], many detection algorithms were developed to reduce the complexity for tree search algorithms. In [19][20][21], the proposed algorithms are based on sphere decoding (SD) and K-best decoding. These algorithms have a very lower complexity than the conventional detection scheme and the ML, with similar error performance.…”
Section: Introductionmentioning
confidence: 99%