Comments on "Low-Complexity SIC Detection Algorithms for Multiple-Input Multiple-Output Systems"

preprint2020arXivOpen access

Abstract

In the above paper, the optimal-ordered successive interference cancellation (SIC) detector proposed for multiple input multiple output (MIMO) systems was claimed to require a lower computational complexity than the optimal-ordered SIC detector proposed in the paper "An Improved Square-Root Algorithm for V-BLAST Based on Efficient Inverse Cholesky Factorization" (IEEE Trans. Wireless Commun., vol. 10, no. 1, Jan. 2011), since several incorrect complexities were quoted or claimed. In this comment, we revise the incorrect complexities, to draw the conclusion that the above-mentioned two detectors actually require the same dominant complexity.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.