2004 IEEE International Conference on Acoustics, Speech, and Signal Processing
DOI: 10.1109/icassp.2004.1326950
|View full text |Cite
|
Sign up to set email alerts
|

Approximate ML detection for MIMO systems with very low complexity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(13 citation statements)
references
References 8 publications
0
13
0
Order By: Relevance
“…Moreover, when compared to the ML detection, we had showed in [7] that the iterative receiver converges after 3 iterations only. However, the ML detection complexity increases with the MIMO architecture size and the modulation order [16]. Thus, the proposed 3D code complexity is of the same order of the NO codes complexity.…”
Section: Complexity Considerationsmentioning
confidence: 99%
“…Moreover, when compared to the ML detection, we had showed in [7] that the iterative receiver converges after 3 iterations only. However, the ML detection complexity increases with the MIMO architecture size and the modulation order [16]. Thus, the proposed 3D code complexity is of the same order of the NO codes complexity.…”
Section: Complexity Considerationsmentioning
confidence: 99%
“…We list a few here. In [5], a multistage quadrant oriented demodulator is presented for QAM. In [2], the sphere decoder [4] is generalized to a multistage algorithm, again by exploiting QAM quadrant subsets.…”
Section: Related Workmentioning
confidence: 99%
“…The Markov chain Monte Carlo (MCMC) technique [12] executes the Gibbs sampling (GS) procedure to generate a list of likely candidates of transmitted symbol vectors for detection. By reducing the search set, the multilevel detection scheme [13] achieves near-ML performance with much lower complexity.…”
Section: Introductionmentioning
confidence: 99%