摘要
Inthisarticleabridgebetweentheexpectedcomplexityandperformanceofspheredecoding(SD)isbuilt.TheexpectedcomplexityofSDforinfinitelatticesistheninvestigated,whichnaturallyistheupper-boundofthoseforallthefinitelatticesifgivenbythesamechannelmatrixandsignalnoiseratio(SNR).SuchexpectedcomplexityisanimportantcharacterizationofSDinmulti-antennasystems,becausenomatterwhatmodulationschemeisusedinpractice(generallyithasfiniteconstellationsize)thisupper-boundholds.AbovebridgealsoleadstoanewmethodofdeterminingtheradiusforSD.Thenumericalresultsshowboththerealvalueandupper-boundofaveragesearchednumberofcandidatesinSDfor16-QAMmodulatedsystemusingtheproposedsphereradiusdeterminingmethod.MostimportantofallnewunderstandingsofexpectedcomplexityofSDaregivenbasedonabovementionedtheoreticanalysisandnumericalresults.
出版日期
2010年03月13日(中国Betway体育网页登陆平台首次上网日期,不代表论文的发表时间)