Maximum Likelihood and Soft Input Soft Output MIMO Detection at a Reduced Complexity

Yang, Kaiying; Tsai, Shang-Ho

doi:10.1109/tvt.2018.2874044

Cited by 1 publication

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we present a DMT optimal pruning algorithm for the decoding problem (1). Besides being DMT optimal, we show that the proposed algorithm benefits from an appropriate complexity behavior at high SNR.…”

Section: The Proposed Dmt Optimal Pruning Algorithmmentioning

confidence: 99%

“…The integer LS problem arises in many applications, e.g. the decoding of high rate space-time codes [1]. The optimum solution for the integer LS problem can be obtained by the maximum likelihood (ML) detector.…”

Section: Introductionmentioning

confidence: 99%

“…• By intersecting some one dimensional spheres, here after referred to as zero-spheres 1 , with the well-known hypersphere of the SD algorithm, we propose a pruning method. The zero-spheres are constructed around the minimum mean squared error (MMSE) equalized observations which trap some of constellation points within a zero-sphere with radius R ZSD .…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Complexity Efficient DMT-Optimal Tree Pruning Based Sphere Decoding

Neinavaie

Derakhtian

Vorobyov

2020

ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

View full text Add to dashboard Cite

We present a diversity multiplexing tradeoff (DMT) optimal tree pruning sphere decoding algorithm which visits merely a single branch of the search tree of the sphere decoding (SD) algorithm, while maintaining the DMT optimality at high signal to noise ratio (SNR) regime. The search tree of the sphere decoding algorithm is pruned via intersecting one dimensional spheres with the hypersphere of the SD algorithm, and the radii are chosen to guarantee the DMT optimality. In contrast to the conventional DMT optimal SD algorithm, which is known to have a polynomial complexity at high SNR regime, we show that the proposed method achieves the DMT optimality by solely visiting a single branch of the search tree at high SNR regime. The simulation results are corroborated with the claimed characteristics of the algorithm in two different scenarios.

show abstract

Section: The Proposed Dmt Optimal Pruning Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation