论文标题
基于MATLAB模拟的两个最佳订购的SIC MIMO探测器之间的复杂性比较
Complexity Comparison between Two Optimal-Ordered SIC MIMO Detectors Based on Matlab Simulations
论文作者
论文摘要
本文首先介绍了我们共享的MATLAB源代码，该代码模拟了[1]和[2]中提出的两个最佳订购的SIC检测器。根据我们的共享MATLAB代码，我们通过理论复杂性计算和数值实验比较了[1]和[2]中两个检测器之间的计算复杂性。我们进行理论复杂性计算，以获得[1]和[2]中两个检测器的最坏情况复杂性。然后，从理论上最坏情况的复杂性中，我们得出的结论是，[2]中提出的检测器需要9n 2比[1]中提出的检测器多的浮点操作（FLOPS），其中n是发射天线的数量。我们的数值实验还表明，[2]中的检测器比[1]中的检测器需要更多的案例和平均复杂性。
This paper firstly introduces our shared Matlab source code that simulates the two optimal-ordered SIC detectors proposed in [1] and [2]. Based on our shared Matlab code, we compare the computational complexities between the two detectors in [1] and [2] by theoretical complexity calculations and numerical experiments. We carry out theoretical complexity calculations to obtain the worst-case complexities for the two detectors in [1] and [2]. Then from the theoretical worst-case complexities, we make the conclusion that the detector proposed in [2] requires 9N 2 more floating-point operations (flops) than the detector proposed in [1], where N is the number of transmit antennas. Our numerical experiments also show that the detector in [2] requires more worst-case and average complexities than the detector in [1].
