Introduction - If you have any usage issues, please Google them yourself
As far as is known,few literature deals with the quantified
relationship between complexity and detection performance of SD.
Sphere radius is proposed to be a transition parameter,thus the quantified
relationship is analyzed theoretically.This part of work can be divided
into three paas:1)In order to analyze the performance of SD,the
asymptotic bound of optimal performance is utilized,and latter the
performance loss caused by search space reduction is quantified with the
help of above bound.Since the performance loss is affected by the sphere
radius directly,sphere radius Can be used to represent the performance
feature of SD.2)Based on the characteristic of complexity of SD,derive
all upper.bound of average complexity;therefore the sphere radius
becomes the metric of average complexity.3)By making use of sphere
radius,the bridge between performance and complexity can be built.The
compute simulations verify above analysis for different MIMO use cases.