





















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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。