检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《重庆邮电大学学报(自然科学版)》2011年第2期135-139,共5页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
基 金:国家科技重大专项(2009ZX03007-002);国家自然科学基金(60976022)~~
摘 要:针对IEEE 802.11n MIMO-OFDM系统提出一种基于相干带宽估计的自适应排序K-best检测器(adaptivesorted K-best detector,ASK-best)。通过皮尔逊相关系数(Pearson correlation coefficient)对相干带宽进行估计,据此将频带有效子载波划分为多个子带,对子带内子载波实施相同排序K-best检测。该改进可逼近基于每个子载波排序的全排序K-best检测性能,同时能根据信道相干带宽估计量自适应调整子载波排序次数。20 MHz带宽(56个有效子载波)和4×4天线配置条件下,相比全排序K-best 56次排序,在TGn单径平坦衰落信道A下,ASK-best自适应调整排序次数为1,14径多经衰落信道C下,ASK-best不超过8次排序就可达到全排序K-best性能。An adaptive sorted K-best detector(ASK-best)based on estimation of coherence bandwidth is proposed for IEEE 802.11n system.The valid subcarriers are divided into several sub-bands according to coherence bandwidth estimated by Pearson Correlation Coefficient,and the corresponding valid subcarriers in each sub-band are processed by the identical sorted K-best detector.It is proved that the proposed algorithm can provide system performance close to all sorted K-best imposing on each subcarrier.Meanwhile the times of sort can be adaptive according to estimation of coherence bandwidth.In the configuration of 20 MHz bandwidth(56 valid subcarriers)and 4×4 multiple input multiple output(MIMO),compared to 56 times of sort in all sorted K-best,while ASK-best provides the performance close to all sorted K-best,the times of sort are one in flat channel fading of TGn channel A,and about 8 in multipath channel fading of TGn channel C.
关 键 词:IEEE802.11N MIMO-OFDM K-best 自适应排序
分 类 号:TN914[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.42